./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.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_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:20:41,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:20:41,219 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 20:20:41,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:20:41,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:20:41,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:20:41,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:20:41,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:20:41,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:20:41,253 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:20:41,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:20:41,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:20:41,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:20:41,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:20:41,256 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:20:41,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:20:41,258 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:20:41,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:20:41,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:20:41,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:20:41,260 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:20:41,261 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:20:41,261 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:20:41,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:20:41,262 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:20:41,262 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:20:41,263 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:20:41,263 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:20:41,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:20:41,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:20:41,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:20:41,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:20:41,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:20:41,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:20:41,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:20:41,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:20:41,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:20:41,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:20:41,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:20:41,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:20:41,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:20:41,268 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_8ddba31b-1f8c-45db-93ce-aa4b05864805/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_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 -> 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 [2023-11-28 20:20:41,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:20:41,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:20:41,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:20:41,525 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:20:41,526 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:20:41,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 20:20:44,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:20:44,597 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:20:44,597 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 20:20:44,617 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/data/1903f9bbf/6d6ef1b1ee984f1383a0e5ba42b2cfe6/FLAG666751ad0 [2023-11-28 20:20:44,631 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/data/1903f9bbf/6d6ef1b1ee984f1383a0e5ba42b2cfe6 [2023-11-28 20:20:44,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:20:44,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:20:44,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:20:44,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:20:44,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:20:44,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41360996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44, skipping insertion in model container [2023-11-28 20:20:44,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,687 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:20:45,036 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:20:45,047 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:20:45,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:20:45,136 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:20:45,137 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:20:45,143 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:20:45,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45 WrapperNode [2023-11-28 20:20:45,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:20:45,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:20:45,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:20:45,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:20:45,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,194 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 147 [2023-11-28 20:20:45,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:20:45,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:20:45,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:20:45,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:20:45,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,230 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-28 20:20:45,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:20:45,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:20:45,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:20:45,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:20:45,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:20:45,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:20:45,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:20:45,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:20:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 20:20:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 20:20:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 20:20:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 20:20:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-28 20:20:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 20:20:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:20:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:20:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:20:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 20:20:45,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 20:20:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 20:20:45,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 20:20:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 20:20:45,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 20:20:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-28 20:20:45,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-28 20:20:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:20:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:20:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 20:20:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 20:20:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-28 20:20:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 20:20:45,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:20:45,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:20:45,320 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:20:45,466 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:20:45,468 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:20:45,812 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:20:46,004 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:20:46,004 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 20:20:46,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:46 BoogieIcfgContainer [2023-11-28 20:20:46,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:20:46,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:20:46,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:20:46,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:20:46,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:44" (1/3) ... [2023-11-28 20:20:46,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1184e6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:46, skipping insertion in model container [2023-11-28 20:20:46,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (2/3) ... [2023-11-28 20:20:46,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1184e6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:46, skipping insertion in model container [2023-11-28 20:20:46,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:46" (3/3) ... [2023-11-28 20:20:46,014 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 20:20:46,035 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:20:46,035 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-28 20:20:46,035 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:20:46,090 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 20:20:46,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 146 flow [2023-11-28 20:20:46,147 INFO L124 PetriNetUnfolderBase]: 2/61 cut-off events. [2023-11-28 20:20:46,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:20:46,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 2/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2023-11-28 20:20:46,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 65 transitions, 146 flow [2023-11-28 20:20:46,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 134 flow [2023-11-28 20:20:46,164 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:20:46,169 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;@6b04b63f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:20:46,169 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-28 20:20:46,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:20:46,172 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 20:20:46,172 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:20:46,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:46,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:20:46,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:20:46,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash 13818, now seen corresponding path program 1 times [2023-11-28 20:20:46,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:46,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932902048] [2023-11-28 20:20:46,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:46,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,428 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-28 20:20:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:46,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932902048] [2023-11-28 20:20:46,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932902048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:46,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:46,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:20:46,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188276625] [2023-11-28 20:20:46,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:46,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:46,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:46,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:46,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:46,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:20:46,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-28 20:20:46,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:46,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:20:46,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:47,758 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-28 20:20:47,758 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-28 20:20:47,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13210 conditions, 7283 events. 4217/7283 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54888 event pairs, 3179 based on Foata normal form. 360/7067 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-28 20:20:47,840 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-28 20:20:47,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 224 flow [2023-11-28 20:20:47,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-28 20:20:47,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-28 20:20:47,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-28 20:20:47,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-28 20:20:47,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:47,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-28 20:20:47,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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-28 20:20:47,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:47,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:47,865 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 134 flow. Second operand 3 states and 143 transitions. [2023-11-28 20:20:47,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 224 flow [2023-11-28 20:20:47,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:20:47,912 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-28 20:20:47,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-28 20:20:47,918 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-28 20:20:47,918 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-28 20:20:47,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-28 20:20:47,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:47,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:20:47,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:20:47,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:20:47,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:47,920 INFO L85 PathProgramCache]: Analyzing trace with hash 13819, now seen corresponding path program 1 times [2023-11-28 20:20:47,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:47,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115699657] [2023-11-28 20:20:47,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:47,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:48,027 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-28 20:20:48,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:48,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115699657] [2023-11-28 20:20:48,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115699657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:48,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:48,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:20:48,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759092951] [2023-11-28 20:20:48,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:48,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:48,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:48,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:48,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:48,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:20:48,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-28 20:20:48,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:48,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:20:48,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:49,192 INFO L124 PetriNetUnfolderBase]: 4217/7282 cut-off events. [2023-11-28 20:20:49,192 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-28 20:20:49,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13386 conditions, 7282 events. 4217/7282 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54800 event pairs, 3179 based on Foata normal form. 1/6707 useless extension candidates. Maximal degree in co-relation 13375. Up to 4390 conditions per place. [2023-11-28 20:20:49,264 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-28 20:20:49,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-28 20:20:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-28 20:20:49,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-28 20:20:49,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-28 20:20:49,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-28 20:20:49,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:49,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-28 20:20:49,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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-28 20:20:49,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:49,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:49,271 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 143 transitions. [2023-11-28 20:20:49,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-28 20:20:49,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:49,285 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-28 20:20:49,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-28 20:20:49,287 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2023-11-28 20:20:49,287 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-28 20:20:49,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-28 20:20:49,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:49,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:20:49,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:20:49,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:20:49,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash 412083033, now seen corresponding path program 1 times [2023-11-28 20:20:49,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:49,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580452479] [2023-11-28 20:20:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,412 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-28 20:20:49,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:49,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580452479] [2023-11-28 20:20:49,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580452479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:49,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:49,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:20:49,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204150891] [2023-11-28 20:20:49,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:49,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:49,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:49,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:49,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2023-11-28 20:20:49,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:49,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:49,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2023-11-28 20:20:49,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:50,382 INFO L124 PetriNetUnfolderBase]: 3311/5242 cut-off events. [2023-11-28 20:20:50,383 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-28 20:20:50,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10064 conditions, 5242 events. 3311/5242 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 33535 event pairs, 2177 based on Foata normal form. 0/5188 useless extension candidates. Maximal degree in co-relation 10053. Up to 3661 conditions per place. [2023-11-28 20:20:50,418 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-28 20:20:50,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 260 flow [2023-11-28 20:20:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-28 20:20:50,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7897435897435897 [2023-11-28 20:20:50,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-28 20:20:50,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-28 20:20:50,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:50,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-28 20:20:50,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 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-28 20:20:50,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:50,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:50,424 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 154 transitions. [2023-11-28 20:20:50,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 260 flow [2023-11-28 20:20:50,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:50,428 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-28 20:20:50,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-28 20:20:50,429 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-28 20:20:50,430 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-28 20:20:50,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:50,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:50,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:20:50,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:20:50,431 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:20:50,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash 412081639, now seen corresponding path program 1 times [2023-11-28 20:20:50,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:50,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455787725] [2023-11-28 20:20:50,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:50,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:50,480 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-28 20:20:50,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:50,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455787725] [2023-11-28 20:20:50,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455787725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:50,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:50,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:20:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811276630] [2023-11-28 20:20:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:50,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:50,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:50,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:50,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:50,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:20:50,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-28 20:20:50,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:50,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:20:50,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:51,195 INFO L124 PetriNetUnfolderBase]: 2906/5211 cut-off events. [2023-11-28 20:20:51,195 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-28 20:20:51,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9623 conditions, 5211 events. 2906/5211 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 38641 event pairs, 1880 based on Foata normal form. 0/5011 useless extension candidates. Maximal degree in co-relation 9612. Up to 3466 conditions per place. [2023-11-28 20:20:51,234 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-28 20:20:51,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 210 flow [2023-11-28 20:20:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-28 20:20:51,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-28 20:20:51,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-28 20:20:51,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-28 20:20:51,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:51,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-28 20:20:51,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 20:20:51,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:51,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:51,240 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 138 transitions. [2023-11-28 20:20:51,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 210 flow [2023-11-28 20:20:51,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:51,242 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-28 20:20:51,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-28 20:20:51,243 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-11-28 20:20:51,243 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-28 20:20:51,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-28 20:20:51,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:51,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:20:51,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:20:51,244 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:20:51,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash 412081640, now seen corresponding path program 1 times [2023-11-28 20:20:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188581703] [2023-11-28 20:20:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:51,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:51,303 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-28 20:20:51,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188581703] [2023-11-28 20:20:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188581703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:20:51,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27605956] [2023-11-28 20:20:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:51,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:51,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:51,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:20:51,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:51,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:20:51,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:51,884 INFO L124 PetriNetUnfolderBase]: 2903/5162 cut-off events. [2023-11-28 20:20:51,884 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-28 20:20:51,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9435 conditions, 5162 events. 2903/5162 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 38070 event pairs, 2288 based on Foata normal form. 4/4965 useless extension candidates. Maximal degree in co-relation 9425. Up to 3459 conditions per place. [2023-11-28 20:20:51,917 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-28 20:20:51,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-28 20:20:51,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-28 20:20:51,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-28 20:20:51,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-28 20:20:51,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-28 20:20:51,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:51,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-28 20:20:51,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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-28 20:20:51,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:51,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:51,923 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 140 transitions. [2023-11-28 20:20:51,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-28 20:20:51,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:51,929 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-28 20:20:51,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-28 20:20:51,931 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-11-28 20:20:51,931 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-28 20:20:51,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:51,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:51,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:20:51,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:20:51,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:51,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1308002411, now seen corresponding path program 1 times [2023-11-28 20:20:51,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:51,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268241014] [2023-11-28 20:20:51,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:51,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:51,984 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-28 20:20:51,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:51,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268241014] [2023-11-28 20:20:51,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268241014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:51,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:51,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:20:51,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863860288] [2023-11-28 20:20:51,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:51,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:51,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:51,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:52,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:20:52,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:52,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:52,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:20:52,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:52,714 INFO L124 PetriNetUnfolderBase]: 2920/5157 cut-off events. [2023-11-28 20:20:52,714 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-28 20:20:52,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9459 conditions, 5157 events. 2920/5157 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37713 event pairs, 1892 based on Foata normal form. 0/4979 useless extension candidates. Maximal degree in co-relation 9449. Up to 3460 conditions per place. [2023-11-28 20:20:52,776 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-28 20:20:52,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-28 20:20:52,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-28 20:20:52,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-28 20:20:52,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-28 20:20:52,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-28 20:20:52,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:52,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-28 20:20:52,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 20:20:52,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:52,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:52,781 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 138 transitions. [2023-11-28 20:20:52,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-28 20:20:52,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:52,785 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-28 20:20:52,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-28 20:20:52,786 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-28 20:20:52,786 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-28 20:20:52,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:52,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:52,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:52,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:20:52,787 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:20:52,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:52,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1308002412, now seen corresponding path program 1 times [2023-11-28 20:20:52,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847176052] [2023-11-28 20:20:52,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:52,858 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-28 20:20:52,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:52,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847176052] [2023-11-28 20:20:52,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847176052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:52,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:52,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:20:52,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470501093] [2023-11-28 20:20:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:52,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:52,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:52,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:52,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:20:52,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:52,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:52,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:20:52,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:53,495 INFO L124 PetriNetUnfolderBase]: 2903/5180 cut-off events. [2023-11-28 20:20:53,495 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-28 20:20:53,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9461 conditions, 5180 events. 2903/5180 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 38189 event pairs, 1356 based on Foata normal form. 12/5022 useless extension candidates. Maximal degree in co-relation 9451. Up to 3431 conditions per place. [2023-11-28 20:20:53,527 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-28 20:20:53,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-28 20:20:53,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-28 20:20:53,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-28 20:20:53,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-28 20:20:53,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-28 20:20:53,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:53,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-28 20:20:53,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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-28 20:20:53,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:53,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:53,532 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 140 transitions. [2023-11-28 20:20:53,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-28 20:20:53,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:53,536 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-28 20:20:53,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-28 20:20:53,537 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-11-28 20:20:53,538 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-28 20:20:53,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:53,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:53,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:53,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:20:53,539 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:20:53,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1538019259, now seen corresponding path program 1 times [2023-11-28 20:20:53,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:53,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394590494] [2023-11-28 20:20:53,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:53,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:53,584 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-28 20:20:53,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:53,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394590494] [2023-11-28 20:20:53,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394590494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:53,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:53,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:20:53,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917354270] [2023-11-28 20:20:53,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:53,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:53,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:53,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:53,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:53,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:20:53,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-28 20:20:53,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:53,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:20:53,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:54,175 INFO L124 PetriNetUnfolderBase]: 2978/5219 cut-off events. [2023-11-28 20:20:54,175 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-28 20:20:54,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9611 conditions, 5219 events. 2978/5219 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37910 event pairs, 920 based on Foata normal form. 0/5125 useless extension candidates. Maximal degree in co-relation 9601. Up to 3426 conditions per place. [2023-11-28 20:20:54,202 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-28 20:20:54,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 200 flow [2023-11-28 20:20:54,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-28 20:20:54,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-28 20:20:54,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-28 20:20:54,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-28 20:20:54,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:54,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-28 20:20:54,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 20:20:54,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:54,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:54,206 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 138 transitions. [2023-11-28 20:20:54,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 200 flow [2023-11-28 20:20:54,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:54,209 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-28 20:20:54,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-28 20:20:54,210 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2023-11-28 20:20:54,210 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-28 20:20:54,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-28 20:20:54,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:54,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:54,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:20:54,211 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:20:54,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1538019258, now seen corresponding path program 1 times [2023-11-28 20:20:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:54,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559120591] [2023-11-28 20:20:54,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:54,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:54,284 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-28 20:20:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559120591] [2023-11-28 20:20:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559120591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:54,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:54,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:20:54,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203834398] [2023-11-28 20:20:54,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:54,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:54,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:54,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:54,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:54,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:20:54,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-28 20:20:54,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:54,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:20:54,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:54,836 INFO L124 PetriNetUnfolderBase]: 2903/5048 cut-off events. [2023-11-28 20:20:54,836 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-28 20:20:54,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9353 conditions, 5048 events. 2903/5048 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 36242 event pairs, 1400 based on Foata normal form. 36/5002 useless extension candidates. Maximal degree in co-relation 9343. Up to 3315 conditions per place. [2023-11-28 20:20:54,858 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-28 20:20:54,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 196 flow [2023-11-28 20:20:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-28 20:20:54,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-28 20:20:54,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-28 20:20:54,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-28 20:20:54,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:54,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-28 20:20:54,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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-28 20:20:54,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:54,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:20:54,862 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 140 transitions. [2023-11-28 20:20:54,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 196 flow [2023-11-28 20:20:54,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:54,865 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 108 flow [2023-11-28 20:20:54,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=108, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-28 20:20:54,866 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-11-28 20:20:54,866 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 108 flow [2023-11-28 20:20:54,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-28 20:20:54,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:54,867 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] [2023-11-28 20:20:54,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:20:54,867 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:20:54,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash 583873074, now seen corresponding path program 1 times [2023-11-28 20:20:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:54,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522739881] [2023-11-28 20:20:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:55,570 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-28 20:20:55,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522739881] [2023-11-28 20:20:55,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522739881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:55,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:55,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:20:55,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972096539] [2023-11-28 20:20:55,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:55,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:20:55,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:55,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:20:55,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:20:55,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 65 [2023-11-28 20:20:55,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 108 flow. Second operand has 9 states, 9 states have (on average 31.77777777777778) internal successors, (286), 9 states have internal predecessors, (286), 0 states have call successors, (0), 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-28 20:20:55,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:55,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 65 [2023-11-28 20:20:55,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:56,614 INFO L124 PetriNetUnfolderBase]: 2920/4973 cut-off events. [2023-11-28 20:20:56,614 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-28 20:20:56,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9308 conditions, 4973 events. 2920/4973 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 34883 event pairs, 1148 based on Foata normal form. 144/5037 useless extension candidates. Maximal degree in co-relation 9297. Up to 3315 conditions per place. [2023-11-28 20:20:56,635 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 36 selfloop transitions, 4 changer transitions 11/72 dead transitions. [2023-11-28 20:20:56,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 258 flow [2023-11-28 20:20:56,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:20:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:20:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 262 transitions. [2023-11-28 20:20:56,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5758241758241758 [2023-11-28 20:20:56,637 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 262 transitions. [2023-11-28 20:20:56,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 262 transitions. [2023-11-28 20:20:56,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:56,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 262 transitions. [2023-11-28 20:20:56,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 0 states have call successors, (0), 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-28 20:20:56,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:20:56,640 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:20:56,640 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 108 flow. Second operand 7 states and 262 transitions. [2023-11-28 20:20:56,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 258 flow [2023-11-28 20:20:56,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:56,642 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 108 flow [2023-11-28 20:20:56,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2023-11-28 20:20:56,643 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-28 20:20:56,643 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 108 flow [2023-11-28 20:20:56,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.77777777777778) internal successors, (286), 9 states have internal predecessors, (286), 0 states have call successors, (0), 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-28 20:20:56,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:56,644 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] [2023-11-28 20:20:56,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:20:56,644 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:20:56,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 583874325, now seen corresponding path program 1 times [2023-11-28 20:20:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:56,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027612473] [2023-11-28 20:20:56,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:56,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:56,897 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-28 20:20:56,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:56,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027612473] [2023-11-28 20:20:56,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027612473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:56,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:56,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:20:56,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14888162] [2023-11-28 20:20:56,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:56,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:20:56,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:56,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:20:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:20:56,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2023-11-28 20:20:56,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 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-28 20:20:56,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:56,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2023-11-28 20:20:56,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:02,116 INFO L124 PetriNetUnfolderBase]: 38072/54446 cut-off events. [2023-11-28 20:21:02,116 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2023-11-28 20:21:02,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105942 conditions, 54446 events. 38072/54446 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 2312. Compared 387584 event pairs, 9478 based on Foata normal form. 0/53137 useless extension candidates. Maximal degree in co-relation 105931. Up to 16337 conditions per place. [2023-11-28 20:21:02,340 INFO L140 encePairwiseOnDemand]: 53/65 looper letters, 47 selfloop transitions, 8 changer transitions 103/173 dead transitions. [2023-11-28 20:21:02,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 173 transitions, 686 flow [2023-11-28 20:21:02,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:21:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 20:21:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 412 transitions. [2023-11-28 20:21:02,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7042735042735043 [2023-11-28 20:21:02,472 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 412 transitions. [2023-11-28 20:21:02,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 412 transitions. [2023-11-28 20:21:02,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:02,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 412 transitions. [2023-11-28 20:21:02,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 45.77777777777778) internal successors, (412), 9 states have internal predecessors, (412), 0 states have call successors, (0), 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-28 20:21:02,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 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-28 20:21:02,476 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 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-28 20:21:02,476 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 108 flow. Second operand 9 states and 412 transitions. [2023-11-28 20:21:02,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 173 transitions, 686 flow [2023-11-28 20:21:02,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 173 transitions, 676 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:21:02,480 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 211 flow [2023-11-28 20:21:02,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=211, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2023-11-28 20:21:02,481 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2023-11-28 20:21:02,481 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 211 flow [2023-11-28 20:21:02,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 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-28 20:21:02,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:02,482 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-28 20:21:02,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:21:02,482 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:21:02,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:02,482 INFO L85 PathProgramCache]: Analyzing trace with hash -835424588, now seen corresponding path program 1 times [2023-11-28 20:21:02,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:02,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5992612] [2023-11-28 20:21:02,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:02,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:02,670 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-28 20:21:02,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:02,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5992612] [2023-11-28 20:21:02,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5992612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:02,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:02,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:21:02,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196427583] [2023-11-28 20:21:02,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:02,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:21:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:02,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:21:02,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:21:02,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2023-11-28 20:21:02,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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-28 20:21:02,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:02,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2023-11-28 20:21:02,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:07,463 INFO L124 PetriNetUnfolderBase]: 23922/37599 cut-off events. [2023-11-28 20:21:07,463 INFO L125 PetriNetUnfolderBase]: For 45439/47375 co-relation queries the response was YES. [2023-11-28 20:21:07,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101742 conditions, 37599 events. 23922/37599 cut-off events. For 45439/47375 co-relation queries the response was YES. Maximal size of possible extension queue 1871. Compared 307720 event pairs, 6845 based on Foata normal form. 1345/38095 useless extension candidates. Maximal degree in co-relation 101723. Up to 23191 conditions per place. [2023-11-28 20:21:07,714 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 38 selfloop transitions, 5 changer transitions 51/117 dead transitions. [2023-11-28 20:21:07,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 117 transitions, 686 flow [2023-11-28 20:21:07,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:21:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:21:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 305 transitions. [2023-11-28 20:21:07,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6703296703296703 [2023-11-28 20:21:07,716 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 305 transitions. [2023-11-28 20:21:07,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 305 transitions. [2023-11-28 20:21:07,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:07,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 305 transitions. [2023-11-28 20:21:07,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 0 states have call successors, (0), 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-28 20:21:07,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:21:07,718 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:21:07,719 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 211 flow. Second operand 7 states and 305 transitions. [2023-11-28 20:21:07,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 117 transitions, 686 flow [2023-11-28 20:21:08,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 117 transitions, 608 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-11-28 20:21:08,030 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 254 flow [2023-11-28 20:21:08,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2023-11-28 20:21:08,031 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2023-11-28 20:21:08,031 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 254 flow [2023-11-28 20:21:08,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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-28 20:21:08,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:08,032 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-28 20:21:08,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:21:08,032 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:21:08,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1568234804, now seen corresponding path program 1 times [2023-11-28 20:21:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:08,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963157152] [2023-11-28 20:21:08,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:08,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:08,205 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-28 20:21:08,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:08,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963157152] [2023-11-28 20:21:08,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963157152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:08,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:08,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:21:08,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447550221] [2023-11-28 20:21:08,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:08,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:21:08,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:08,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:21:08,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:21:08,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2023-11-28 20:21:08,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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-28 20:21:08,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:08,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2023-11-28 20:21:08,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:12,586 INFO L124 PetriNetUnfolderBase]: 22023/34984 cut-off events. [2023-11-28 20:21:12,586 INFO L125 PetriNetUnfolderBase]: For 54687/55271 co-relation queries the response was YES. [2023-11-28 20:21:12,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95887 conditions, 34984 events. 22023/34984 cut-off events. For 54687/55271 co-relation queries the response was YES. Maximal size of possible extension queue 1725. Compared 289272 event pairs, 7711 based on Foata normal form. 1262/35585 useless extension candidates. Maximal degree in co-relation 95865. Up to 22026 conditions per place. [2023-11-28 20:21:12,870 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 44 selfloop transitions, 5 changer transitions 55/131 dead transitions. [2023-11-28 20:21:12,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 131 transitions, 759 flow [2023-11-28 20:21:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:21:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:21:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 312 transitions. [2023-11-28 20:21:12,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2023-11-28 20:21:12,872 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 312 transitions. [2023-11-28 20:21:12,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 312 transitions. [2023-11-28 20:21:12,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:12,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 312 transitions. [2023-11-28 20:21:12,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.57142857142857) internal successors, (312), 7 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-28 20:21:12,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:21:12,875 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:21:12,875 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 254 flow. Second operand 7 states and 312 transitions. [2023-11-28 20:21:12,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 131 transitions, 759 flow [2023-11-28 20:21:13,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 131 transitions, 746 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-28 20:21:13,203 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 318 flow [2023-11-28 20:21:13,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2023-11-28 20:21:13,203 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2023-11-28 20:21:13,204 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 318 flow [2023-11-28 20:21:13,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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-28 20:21:13,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:13,204 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-28 20:21:13,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 20:21:13,204 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:21:13,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1848774923, now seen corresponding path program 1 times [2023-11-28 20:21:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:13,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654537818] [2023-11-28 20:21:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:13,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:13,368 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-28 20:21:13,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654537818] [2023-11-28 20:21:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654537818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:13,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:13,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:21:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776457974] [2023-11-28 20:21:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:13,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:21:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:13,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:21:13,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:21:13,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2023-11-28 20:21:13,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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-28 20:21:13,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:13,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2023-11-28 20:21:13,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:17,299 INFO L124 PetriNetUnfolderBase]: 21031/33383 cut-off events. [2023-11-28 20:21:17,299 INFO L125 PetriNetUnfolderBase]: For 77763/78328 co-relation queries the response was YES. [2023-11-28 20:21:17,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99218 conditions, 33383 events. 21031/33383 cut-off events. For 77763/78328 co-relation queries the response was YES. Maximal size of possible extension queue 1625. Compared 269992 event pairs, 6081 based on Foata normal form. 960/33867 useless extension candidates. Maximal degree in co-relation 99192. Up to 21186 conditions per place. [2023-11-28 20:21:17,599 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 42 selfloop transitions, 5 changer transitions 55/133 dead transitions. [2023-11-28 20:21:17,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 133 transitions, 819 flow [2023-11-28 20:21:17,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:21:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:21:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 310 transitions. [2023-11-28 20:21:17,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6813186813186813 [2023-11-28 20:21:17,601 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 310 transitions. [2023-11-28 20:21:17,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 310 transitions. [2023-11-28 20:21:17,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:17,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 310 transitions. [2023-11-28 20:21:17,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.285714285714285) internal successors, (310), 7 states have internal predecessors, (310), 0 states have call successors, (0), 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-28 20:21:17,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:21:17,604 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:21:17,604 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 318 flow. Second operand 7 states and 310 transitions. [2023-11-28 20:21:17,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 133 transitions, 819 flow [2023-11-28 20:21:17,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 133 transitions, 802 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-28 20:21:17,694 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 378 flow [2023-11-28 20:21:17,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=378, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2023-11-28 20:21:17,694 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 8 predicate places. [2023-11-28 20:21:17,695 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 378 flow [2023-11-28 20:21:17,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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-28 20:21:17,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:17,695 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] [2023-11-28 20:21:17,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 20:21:17,695 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:21:17,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1498708137, now seen corresponding path program 1 times [2023-11-28 20:21:17,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:17,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317667040] [2023-11-28 20:21:17,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:17,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:17,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-28 20:21:17,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:17,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317667040] [2023-11-28 20:21:17,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317667040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:17,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:17,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:21:17,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113171625] [2023-11-28 20:21:17,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:17,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:21:17,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:17,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:21:17,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:21:17,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2023-11-28 20:21:17,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 378 flow. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 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-28 20:21:17,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:17,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2023-11-28 20:21:17,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:23,782 INFO L124 PetriNetUnfolderBase]: 28696/44459 cut-off events. [2023-11-28 20:21:23,782 INFO L125 PetriNetUnfolderBase]: For 140758/142468 co-relation queries the response was YES. [2023-11-28 20:21:23,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137483 conditions, 44459 events. 28696/44459 cut-off events. For 140758/142468 co-relation queries the response was YES. Maximal size of possible extension queue 2159. Compared 365751 event pairs, 10390 based on Foata normal form. 1344/44666 useless extension candidates. Maximal degree in co-relation 137453. Up to 16986 conditions per place. [2023-11-28 20:21:24,094 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 47 selfloop transitions, 6 changer transitions 51/135 dead transitions. [2023-11-28 20:21:24,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 135 transitions, 869 flow [2023-11-28 20:21:24,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:21:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:21:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 317 transitions. [2023-11-28 20:21:24,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6967032967032967 [2023-11-28 20:21:24,096 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 317 transitions. [2023-11-28 20:21:24,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 317 transitions. [2023-11-28 20:21:24,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:24,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 317 transitions. [2023-11-28 20:21:24,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 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-28 20:21:24,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:21:24,098 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:21:24,098 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 378 flow. Second operand 7 states and 317 transitions. [2023-11-28 20:21:24,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 135 transitions, 869 flow [2023-11-28 20:21:24,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 135 transitions, 836 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-28 20:21:24,204 INFO L231 Difference]: Finished difference. Result has 84 places, 64 transitions, 389 flow [2023-11-28 20:21:24,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2023-11-28 20:21:24,205 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 12 predicate places. [2023-11-28 20:21:24,205 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 389 flow [2023-11-28 20:21:24,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 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-28 20:21:24,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:24,205 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] [2023-11-28 20:21:24,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:21:24,206 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:21:24,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash -778915771, now seen corresponding path program 1 times [2023-11-28 20:21:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:24,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307468034] [2023-11-28 20:21:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:24,356 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-28 20:21:24,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:24,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307468034] [2023-11-28 20:21:24,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307468034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:24,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:24,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:21:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088901902] [2023-11-28 20:21:24,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:24,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:21:24,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:24,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:21:24,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:21:24,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2023-11-28 20:21:24,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 389 flow. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 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-28 20:21:24,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:24,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2023-11-28 20:21:24,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:33,362 INFO L124 PetriNetUnfolderBase]: 41039/63850 cut-off events. [2023-11-28 20:21:33,362 INFO L125 PetriNetUnfolderBase]: For 227724/228832 co-relation queries the response was YES. [2023-11-28 20:21:33,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191834 conditions, 63850 events. 41039/63850 cut-off events. For 227724/228832 co-relation queries the response was YES. Maximal size of possible extension queue 3112. Compared 556755 event pairs, 15713 based on Foata normal form. 1282/64163 useless extension candidates. Maximal degree in co-relation 191801. Up to 25006 conditions per place. [2023-11-28 20:21:33,983 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 45 selfloop transitions, 6 changer transitions 51/133 dead transitions. [2023-11-28 20:21:33,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 133 transitions, 880 flow [2023-11-28 20:21:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:21:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:21:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 315 transitions. [2023-11-28 20:21:33,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2023-11-28 20:21:33,986 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 315 transitions. [2023-11-28 20:21:33,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 315 transitions. [2023-11-28 20:21:33,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:33,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 315 transitions. [2023-11-28 20:21:33,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 0 states have call successors, (0), 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-28 20:21:33,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:21:33,989 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:21:33,989 INFO L175 Difference]: Start difference. First operand has 84 places, 64 transitions, 389 flow. Second operand 7 states and 315 transitions. [2023-11-28 20:21:33,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 133 transitions, 880 flow [2023-11-28 20:21:34,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 133 transitions, 830 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-28 20:21:34,731 INFO L231 Difference]: Finished difference. Result has 86 places, 64 transitions, 391 flow [2023-11-28 20:21:34,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=391, PETRI_PLACES=86, PETRI_TRANSITIONS=64} [2023-11-28 20:21:34,732 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 14 predicate places. [2023-11-28 20:21:34,732 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 64 transitions, 391 flow [2023-11-28 20:21:34,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 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-28 20:21:34,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:34,733 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] [2023-11-28 20:21:34,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 20:21:34,733 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:21:34,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:34,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1366466884, now seen corresponding path program 1 times [2023-11-28 20:21:34,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:34,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469170050] [2023-11-28 20:21:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:34,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:34,854 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-28 20:21:34,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:34,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469170050] [2023-11-28 20:21:34,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469170050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:34,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:34,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:21:34,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756070842] [2023-11-28 20:21:34,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:34,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:21:34,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:34,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:21:34,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:21:34,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-28 20:21:34,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 64 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 20:21:34,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:34,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-28 20:21:34,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:50,029 INFO L124 PetriNetUnfolderBase]: 87835/129699 cut-off events. [2023-11-28 20:21:50,029 INFO L125 PetriNetUnfolderBase]: For 218377/222300 co-relation queries the response was YES. [2023-11-28 20:21:50,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326365 conditions, 129699 events. 87835/129699 cut-off events. For 218377/222300 co-relation queries the response was YES. Maximal size of possible extension queue 4567. Compared 1049265 event pairs, 17243 based on Foata normal form. 5354/132978 useless extension candidates. Maximal degree in co-relation 326331. Up to 73890 conditions per place. [2023-11-28 20:21:50,989 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 57 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2023-11-28 20:21:50,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 98 transitions, 608 flow [2023-11-28 20:21:50,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:21:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 20:21:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2023-11-28 20:21:50,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7153846153846154 [2023-11-28 20:21:50,991 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 186 transitions. [2023-11-28 20:21:50,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 186 transitions. [2023-11-28 20:21:50,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:50,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 186 transitions. [2023-11-28 20:21:50,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 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-28 20:21:50,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 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-28 20:21:50,993 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 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-28 20:21:50,993 INFO L175 Difference]: Start difference. First operand has 86 places, 64 transitions, 391 flow. Second operand 4 states and 186 transitions. [2023-11-28 20:21:50,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 98 transitions, 608 flow [2023-11-28 20:21:51,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 98 transitions, 586 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-28 20:21:51,424 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 415 flow [2023-11-28 20:21:51,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2023-11-28 20:21:51,425 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 10 predicate places. [2023-11-28 20:21:51,425 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 415 flow [2023-11-28 20:21:51,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 20:21:51,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:51,425 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-28 20:21:51,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 20:21:51,426 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:21:51,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:51,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1638336132, now seen corresponding path program 1 times [2023-11-28 20:21:51,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:51,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207071472] [2023-11-28 20:21:51,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:51,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:51,611 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-28 20:21:51,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:51,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207071472] [2023-11-28 20:21:51,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207071472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:51,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:51,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:21:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089685815] [2023-11-28 20:21:51,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:51,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:21:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:51,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:21:51,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:21:51,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2023-11-28 20:21:51,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 415 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 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-28 20:21:51,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:51,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2023-11-28 20:21:51,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:08,339 INFO L124 PetriNetUnfolderBase]: 86346/135590 cut-off events. [2023-11-28 20:22:08,339 INFO L125 PetriNetUnfolderBase]: For 257861/263446 co-relation queries the response was YES. [2023-11-28 20:22:09,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374478 conditions, 135590 events. 86346/135590 cut-off events. For 257861/263446 co-relation queries the response was YES. Maximal size of possible extension queue 7147. Compared 1309400 event pairs, 43172 based on Foata normal form. 3092/127766 useless extension candidates. Maximal degree in co-relation 374445. Up to 53608 conditions per place. [2023-11-28 20:22:09,559 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 88 selfloop transitions, 13 changer transitions 0/137 dead transitions. [2023-11-28 20:22:09,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 137 transitions, 896 flow [2023-11-28 20:22:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:22:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:22:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 314 transitions. [2023-11-28 20:22:09,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6901098901098901 [2023-11-28 20:22:09,561 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 314 transitions. [2023-11-28 20:22:09,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 314 transitions. [2023-11-28 20:22:09,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:09,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 314 transitions. [2023-11-28 20:22:09,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.857142857142854) internal successors, (314), 7 states have internal predecessors, (314), 0 states have call successors, (0), 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-28 20:22:09,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:22:09,563 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:22:09,564 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 415 flow. Second operand 7 states and 314 transitions. [2023-11-28 20:22:09,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 137 transitions, 896 flow [2023-11-28 20:22:09,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 882 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-28 20:22:09,756 INFO L231 Difference]: Finished difference. Result has 92 places, 76 transitions, 543 flow [2023-11-28 20:22:09,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=543, PETRI_PLACES=92, PETRI_TRANSITIONS=76} [2023-11-28 20:22:09,756 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 20 predicate places. [2023-11-28 20:22:09,756 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 76 transitions, 543 flow [2023-11-28 20:22:09,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 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-28 20:22:09,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:09,757 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-28 20:22:09,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 20:22:09,757 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:22:09,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash 464902191, now seen corresponding path program 1 times [2023-11-28 20:22:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:09,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125326269] [2023-11-28 20:22:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:09,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:09,901 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-28 20:22:09,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:09,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125326269] [2023-11-28 20:22:09,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125326269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:09,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:09,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:22:09,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024867700] [2023-11-28 20:22:09,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:09,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:22:09,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:09,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:22:09,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:22:09,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-28 20:22:09,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 76 transitions, 543 flow. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:09,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:09,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-28 20:22:09,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:28,360 INFO L124 PetriNetUnfolderBase]: 109412/158846 cut-off events. [2023-11-28 20:22:28,361 INFO L125 PetriNetUnfolderBase]: For 192561/196493 co-relation queries the response was YES. [2023-11-28 20:22:29,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420806 conditions, 158846 events. 109412/158846 cut-off events. For 192561/196493 co-relation queries the response was YES. Maximal size of possible extension queue 6102. Compared 1270912 event pairs, 13343 based on Foata normal form. 7665/163511 useless extension candidates. Maximal degree in co-relation 420768. Up to 61629 conditions per place. [2023-11-28 20:22:29,532 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 74 selfloop transitions, 10 changer transitions 4/126 dead transitions. [2023-11-28 20:22:29,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 126 transitions, 869 flow [2023-11-28 20:22:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:22:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:22:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2023-11-28 20:22:29,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7292307692307692 [2023-11-28 20:22:29,534 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 237 transitions. [2023-11-28 20:22:29,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 237 transitions. [2023-11-28 20:22:29,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:29,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 237 transitions. [2023-11-28 20:22:29,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 47.4) internal successors, (237), 5 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-28 20:22:29,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 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-28 20:22:29,536 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 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-28 20:22:29,536 INFO L175 Difference]: Start difference. First operand has 92 places, 76 transitions, 543 flow. Second operand 5 states and 237 transitions. [2023-11-28 20:22:29,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 126 transitions, 869 flow [2023-11-28 20:22:31,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 126 transitions, 837 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-11-28 20:22:31,112 INFO L231 Difference]: Finished difference. Result has 97 places, 77 transitions, 530 flow [2023-11-28 20:22:31,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=530, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2023-11-28 20:22:31,112 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 25 predicate places. [2023-11-28 20:22:31,112 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 77 transitions, 530 flow [2023-11-28 20:22:31,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:31,113 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] [2023-11-28 20:22:31,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 20:22:31,113 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:22:31,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1386254074, now seen corresponding path program 1 times [2023-11-28 20:22:31,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:31,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516143312] [2023-11-28 20:22:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:31,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:31,285 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-28 20:22:31,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:31,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516143312] [2023-11-28 20:22:31,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516143312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:31,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:31,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:31,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172720831] [2023-11-28 20:22:31,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:31,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:31,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:31,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:31,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:31,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-28 20:22:31,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 77 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:31,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-28 20:22:31,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:46,095 INFO L124 PetriNetUnfolderBase]: 85600/123830 cut-off events. [2023-11-28 20:22:46,096 INFO L125 PetriNetUnfolderBase]: For 155685/158507 co-relation queries the response was YES. [2023-11-28 20:22:47,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359296 conditions, 123830 events. 85600/123830 cut-off events. For 155685/158507 co-relation queries the response was YES. Maximal size of possible extension queue 5191. Compared 970514 event pairs, 7377 based on Foata normal form. 5264/126314 useless extension candidates. Maximal degree in co-relation 359255. Up to 42364 conditions per place. [2023-11-28 20:22:47,148 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 87 selfloop transitions, 14 changer transitions 2/140 dead transitions. [2023-11-28 20:22:47,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 140 transitions, 940 flow [2023-11-28 20:22:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:22:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:22:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 286 transitions. [2023-11-28 20:22:47,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-28 20:22:47,150 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 286 transitions. [2023-11-28 20:22:47,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 286 transitions. [2023-11-28 20:22:47,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:47,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 286 transitions. [2023-11-28 20:22:47,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 0 states have call successors, (0), 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-28 20:22:47,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 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-28 20:22:47,153 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 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-28 20:22:47,153 INFO L175 Difference]: Start difference. First operand has 97 places, 77 transitions, 530 flow. Second operand 6 states and 286 transitions. [2023-11-28 20:22:47,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 140 transitions, 940 flow [2023-11-28 20:22:47,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 140 transitions, 912 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-28 20:22:47,427 INFO L231 Difference]: Finished difference. Result has 98 places, 81 transitions, 580 flow [2023-11-28 20:22:47,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=580, PETRI_PLACES=98, PETRI_TRANSITIONS=81} [2023-11-28 20:22:47,428 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 26 predicate places. [2023-11-28 20:22:47,428 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 81 transitions, 580 flow [2023-11-28 20:22:47,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:47,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:47,429 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, 1] [2023-11-28 20:22:47,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-28 20:22:47,429 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:22:47,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:47,429 INFO L85 PathProgramCache]: Analyzing trace with hash 198026015, now seen corresponding path program 1 times [2023-11-28 20:22:47,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:47,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799885071] [2023-11-28 20:22:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:47,709 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-28 20:22:47,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:47,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799885071] [2023-11-28 20:22:47,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799885071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:47,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:47,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:22:47,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463559769] [2023-11-28 20:22:47,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:47,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:22:47,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:47,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:22:47,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:22:47,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-28 20:22:47,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 81 transitions, 580 flow. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 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-28 20:22:47,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:47,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-28 20:22:47,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:01,323 INFO L124 PetriNetUnfolderBase]: 78520/113214 cut-off events. [2023-11-28 20:23:01,323 INFO L125 PetriNetUnfolderBase]: For 221648/224358 co-relation queries the response was YES. [2023-11-28 20:23:02,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353959 conditions, 113214 events. 78520/113214 cut-off events. For 221648/224358 co-relation queries the response was YES. Maximal size of possible extension queue 5180. Compared 885026 event pairs, 7229 based on Foata normal form. 2644/113078 useless extension candidates. Maximal degree in co-relation 353918. Up to 42364 conditions per place. [2023-11-28 20:23:02,088 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 73 selfloop transitions, 18 changer transitions 10/134 dead transitions. [2023-11-28 20:23:02,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 134 transitions, 918 flow [2023-11-28 20:23:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:23:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:23:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 313 transitions. [2023-11-28 20:23:02,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6879120879120879 [2023-11-28 20:23:02,090 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 313 transitions. [2023-11-28 20:23:02,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 313 transitions. [2023-11-28 20:23:02,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:02,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 313 transitions. [2023-11-28 20:23:02,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.714285714285715) internal successors, (313), 7 states have internal predecessors, (313), 0 states have call successors, (0), 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-28 20:23:02,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:23:02,093 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:23:02,093 INFO L175 Difference]: Start difference. First operand has 98 places, 81 transitions, 580 flow. Second operand 7 states and 313 transitions. [2023-11-28 20:23:02,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 134 transitions, 918 flow [2023-11-28 20:23:13,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 134 transitions, 818 flow, removed 42 selfloop flow, removed 12 redundant places. [2023-11-28 20:23:13,112 INFO L231 Difference]: Finished difference. Result has 93 places, 76 transitions, 490 flow [2023-11-28 20:23:13,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=490, PETRI_PLACES=93, PETRI_TRANSITIONS=76} [2023-11-28 20:23:13,113 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 21 predicate places. [2023-11-28 20:23:13,113 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 76 transitions, 490 flow [2023-11-28 20:23:13,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 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-28 20:23:13,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:13,113 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, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:13,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-28 20:23:13,114 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:13,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2130614008, now seen corresponding path program 1 times [2023-11-28 20:23:13,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:23:13,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43289950] [2023-11-28 20:23:13,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:13,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:23:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:14,001 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-28 20:23:14,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:23:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43289950] [2023-11-28 20:23:14,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43289950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:14,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:14,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:23:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868682579] [2023-11-28 20:23:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:14,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:23:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:23:14,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:23:14,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:23:14,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2023-11-28 20:23:14,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 76 transitions, 490 flow. Second operand has 10 states, 10 states have (on average 30.6) internal successors, (306), 10 states have internal predecessors, (306), 0 states have call successors, (0), 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-28 20:23:14,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:14,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2023-11-28 20:23:14,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:22,678 INFO L124 PetriNetUnfolderBase]: 46625/75864 cut-off events. [2023-11-28 20:23:22,678 INFO L125 PetriNetUnfolderBase]: For 176616/197283 co-relation queries the response was YES. [2023-11-28 20:23:23,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226364 conditions, 75864 events. 46625/75864 cut-off events. For 176616/197283 co-relation queries the response was YES. Maximal size of possible extension queue 5954. Compared 730847 event pairs, 9585 based on Foata normal form. 1238/68940 useless extension candidates. Maximal degree in co-relation 226330. Up to 30133 conditions per place. [2023-11-28 20:23:23,160 INFO L140 encePairwiseOnDemand]: 49/65 looper letters, 95 selfloop transitions, 41 changer transitions 67/233 dead transitions. [2023-11-28 20:23:23,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 233 transitions, 1711 flow [2023-11-28 20:23:23,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:23:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-28 20:23:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 466 transitions. [2023-11-28 20:23:23,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6517482517482518 [2023-11-28 20:23:23,162 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 466 transitions. [2023-11-28 20:23:23,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 466 transitions. [2023-11-28 20:23:23,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:23,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 466 transitions. [2023-11-28 20:23:23,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 42.36363636363637) internal successors, (466), 11 states have internal predecessors, (466), 0 states have call successors, (0), 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-28 20:23:23,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 65.0) internal successors, (780), 12 states have internal predecessors, (780), 0 states have call successors, (0), 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-28 20:23:23,165 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 65.0) internal successors, (780), 12 states have internal predecessors, (780), 0 states have call successors, (0), 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-28 20:23:23,165 INFO L175 Difference]: Start difference. First operand has 93 places, 76 transitions, 490 flow. Second operand 11 states and 466 transitions. [2023-11-28 20:23:23,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 233 transitions, 1711 flow [2023-11-28 20:23:33,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 233 transitions, 1506 flow, removed 82 selfloop flow, removed 10 redundant places. [2023-11-28 20:23:33,147 INFO L231 Difference]: Finished difference. Result has 101 places, 102 transitions, 721 flow [2023-11-28 20:23:33,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=721, PETRI_PLACES=101, PETRI_TRANSITIONS=102} [2023-11-28 20:23:33,147 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 29 predicate places. [2023-11-28 20:23:33,147 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 102 transitions, 721 flow [2023-11-28 20:23:33,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.6) internal successors, (306), 10 states have internal predecessors, (306), 0 states have call successors, (0), 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-28 20:23:33,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:33,148 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, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:33,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-28 20:23:33,148 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:33,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash -857813754, now seen corresponding path program 2 times [2023-11-28 20:23:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:23:33,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594626499] [2023-11-28 20:23:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:23:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:23:33,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:23:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:23:33,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:23:33,315 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:23:33,316 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-28 20:23:33,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-28 20:23:33,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-28 20:23:33,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-28 20:23:33,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-28 20:23:33,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-28 20:23:33,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-28 20:23:33,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-28 20:23:33,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-28 20:23:33,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-28 20:23:33,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-28 20:23:33,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-28 20:23:33,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-28 20:23:33,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-28 20:23:33,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-28 20:23:33,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-28 20:23:33,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-28 20:23:33,321 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:33,327 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 20:23:33,327 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:23:33,383 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 20:23:33,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 20:23:33,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 20:23:33,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-28 20:23:33,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:23:33,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:23:33,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:23:33 BasicIcfg [2023-11-28 20:23:33,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:23:33,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:23:33,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:23:33,419 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:23:33,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:46" (3/4) ... [2023-11-28 20:23:33,422 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:23:33,423 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:23:33,423 INFO L158 Benchmark]: Toolchain (without parser) took 168788.96ms. Allocated memory was 184.5MB in the beginning and 13.9GB in the end (delta: 13.7GB). Free memory was 147.4MB in the beginning and 11.0GB in the end (delta: -10.8GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2023-11-28 20:23:33,424 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:23:33,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.82ms. Allocated memory is still 184.5MB. Free memory was 146.9MB in the beginning and 122.7MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-28 20:23:33,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.88ms. Allocated memory is still 184.5MB. Free memory was 122.7MB in the beginning and 120.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:23:33,425 INFO L158 Benchmark]: Boogie Preprocessor took 57.55ms. Allocated memory is still 184.5MB. Free memory was 120.1MB in the beginning and 116.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:23:33,425 INFO L158 Benchmark]: RCFGBuilder took 751.16ms. Allocated memory is still 184.5MB. Free memory was 116.4MB in the beginning and 112.1MB in the end (delta: 4.3MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2023-11-28 20:23:33,425 INFO L158 Benchmark]: TraceAbstraction took 167411.40ms. Allocated memory was 184.5MB in the beginning and 13.9GB in the end (delta: 13.7GB). Free memory was 112.1MB in the beginning and 11.0GB in the end (delta: -10.8GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2023-11-28 20:23:33,426 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 13.9GB. Free memory was 11.0GB in the beginning and 11.0GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:23:33,428 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.31ms. Allocated memory is still 117.4MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.82ms. Allocated memory is still 184.5MB. Free memory was 146.9MB in the beginning and 122.7MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.88ms. Allocated memory is still 184.5MB. Free memory was 122.7MB in the beginning and 120.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.55ms. Allocated memory is still 184.5MB. Free memory was 120.1MB in the beginning and 116.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 751.16ms. Allocated memory is still 184.5MB. Free memory was 116.4MB in the beginning and 112.1MB in the end (delta: 4.3MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * TraceAbstraction took 167411.40ms. Allocated memory was 184.5MB in the beginning and 13.9GB in the end (delta: 13.7GB). Free memory was 112.1MB in the beginning and 11.0GB in the end (delta: -10.8GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 13.9GB. Free memory was 11.0GB in the beginning and 11.0GB in the end (delta: 1.0MB). 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: IdentifierExpression #t~pre11 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, t1513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, t1513={5:0}, t1514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1515; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, t1513={5:0}, t1514={6:0}, t1515={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1516; [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L782] 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) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 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 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 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_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L796] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L802] 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) [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] 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 [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] 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_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L816] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L762] 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) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 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 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 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_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=2, z=2] [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=2, z=2] [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=2, z=2] [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 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) [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] 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 [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] 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=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L879] 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=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L17] 0 __assert_fail ("0", "mix057_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 860]: 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 9 procedures, 97 locations, 16 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: 167.2s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 162.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1449 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1274 mSDsluCounter, 350 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3093 IncrementalHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 92 mSDtfsCounter, 3093 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=721occurred in iteration=22, InterpolantAutomatonStates: 118, 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.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 460 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 397 ConstructedInterpolants, 0 QuantifiedInterpolants, 2404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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-28 20:23:33,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:23:36,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:23:36,098 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 20:23:36,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:23:36,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:23:36,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:23:36,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:23:36,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:23:36,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:23:36,144 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:23:36,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:23:36,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:23:36,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:23:36,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:23:36,148 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:23:36,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:23:36,149 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:23:36,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:23:36,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:23:36,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:23:36,151 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:23:36,152 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:23:36,152 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:23:36,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:23:36,153 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:23:36,154 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:23:36,154 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:23:36,154 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:23:36,155 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:23:36,155 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:23:36,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:23:36,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:23:36,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:23:36,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:23:36,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:23:36,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:23:36,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:23:36,158 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:23:36,158 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:23:36,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:23:36,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:23:36,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:23:36,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:23:36,159 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:23:36,160 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_8ddba31b-1f8c-45db-93ce-aa4b05864805/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_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 -> 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 [2023-11-28 20:23:36,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:23:36,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:23:36,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:23:36,476 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:23:36,476 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:23:36,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 20:23:39,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:23:39,490 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:23:39,490 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/sv-benchmarks/c/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 20:23:39,507 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/data/c2764b0be/0771fe65853243cd82acaedfc762fe4c/FLAG863310698 [2023-11-28 20:23:39,522 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/data/c2764b0be/0771fe65853243cd82acaedfc762fe4c [2023-11-28 20:23:39,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:23:39,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:23:39,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:23:39,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:23:39,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:23:39,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:23:39" (1/1) ... [2023-11-28 20:23:39,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63484c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:39, skipping insertion in model container [2023-11-28 20:23:39,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:23:39" (1/1) ... [2023-11-28 20:23:39,594 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:23:39,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:23:39,986 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:23:40,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:23:40,097 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:23:40,098 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:23:40,105 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:23:40,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40 WrapperNode [2023-11-28 20:23:40,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:23:40,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:23:40,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:23:40,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:23:40,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,164 INFO L138 Inliner]: procedures = 180, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2023-11-28 20:23:40,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:23:40,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:23:40,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:23:40,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:23:40,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,201 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-28 20:23:40,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:23:40,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:23:40,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:23:40,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:23:40,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (1/1) ... [2023-11-28 20:23:40,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:23:40,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:23:40,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:23:40,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:23:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 20:23:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:23:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:23:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:23:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 20:23:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 20:23:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 20:23:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-28 20:23:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-28 20:23:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:23:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 20:23:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 20:23:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-28 20:23:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-28 20:23:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 20:23:40,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 20:23:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 20:23:40,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 20:23:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 20:23:40,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 20:23:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-28 20:23:40,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-28 20:23:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 20:23:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:23:40,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:23:40,313 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:23:40,486 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:23:40,489 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:23:40,881 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:23:41,094 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:23:41,095 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 20:23:41,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:41 BoogieIcfgContainer [2023-11-28 20:23:41,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:23:41,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:23:41,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:23:41,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:23:41,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:23:39" (1/3) ... [2023-11-28 20:23:41,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a794742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:23:41, skipping insertion in model container [2023-11-28 20:23:41,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:40" (2/3) ... [2023-11-28 20:23:41,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a794742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:23:41, skipping insertion in model container [2023-11-28 20:23:41,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:41" (3/3) ... [2023-11-28 20:23:41,104 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 20:23:41,123 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:23:41,123 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-28 20:23:41,123 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:23:41,181 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 20:23:41,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 146 flow [2023-11-28 20:23:41,249 INFO L124 PetriNetUnfolderBase]: 2/61 cut-off events. [2023-11-28 20:23:41,249 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:23:41,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 2/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2023-11-28 20:23:41,254 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 65 transitions, 146 flow [2023-11-28 20:23:41,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 134 flow [2023-11-28 20:23:41,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:23:41,276 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;@27588eb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:23:41,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-28 20:23:41,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:23:41,280 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 20:23:41,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:23:41,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:41,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:23:41,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:41,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:41,287 INFO L85 PathProgramCache]: Analyzing trace with hash 13882, now seen corresponding path program 1 times [2023-11-28 20:23:41,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:41,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737160373] [2023-11-28 20:23:41,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:41,299 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-28 20:23:41,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:41,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:41,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:41,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:23:41,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:41,516 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-28 20:23:41,528 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-28 20:23:41,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:41,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:41,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737160373] [2023-11-28 20:23:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737160373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:41,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:41,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:23:41,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666137575] [2023-11-28 20:23:41,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:41,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:41,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:41,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:41,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:23:41,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-28 20:23:41,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:41,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:23:41,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:42,970 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-28 20:23:42,970 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-28 20:23:42,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13210 conditions, 7283 events. 4217/7283 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54888 event pairs, 3179 based on Foata normal form. 360/7067 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-28 20:23:43,049 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-28 20:23:43,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 224 flow [2023-11-28 20:23:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-28 20:23:43,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-28 20:23:43,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-28 20:23:43,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-28 20:23:43,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:43,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-28 20:23:43,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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-28 20:23:43,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:43,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:43,077 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 134 flow. Second operand 3 states and 143 transitions. [2023-11-28 20:23:43,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 224 flow [2023-11-28 20:23:43,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:23:43,109 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-28 20:23:43,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-28 20:23:43,115 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-28 20:23:43,115 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-28 20:23:43,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-28 20:23:43,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:43,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:23:43,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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)] Ended with exit code 0 [2023-11-28 20:23:43,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:43,319 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:43,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash 13883, now seen corresponding path program 1 times [2023-11-28 20:23:43,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:43,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485638703] [2023-11-28 20:23:43,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:43,320 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-28 20:23:43,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:43,322 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:43,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:43,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:23:43,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:43,423 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-28 20:23:43,434 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-28 20:23:43,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:43,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:43,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485638703] [2023-11-28 20:23:43,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485638703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:43,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:43,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:23:43,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489273935] [2023-11-28 20:23:43,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:43,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:43,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:43,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:43,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:23:43,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-28 20:23:43,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:43,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:23:43,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:44,628 INFO L124 PetriNetUnfolderBase]: 4217/7282 cut-off events. [2023-11-28 20:23:44,628 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-28 20:23:44,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13386 conditions, 7282 events. 4217/7282 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54800 event pairs, 3179 based on Foata normal form. 1/6707 useless extension candidates. Maximal degree in co-relation 13375. Up to 4390 conditions per place. [2023-11-28 20:23:44,699 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-28 20:23:44,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-28 20:23:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-28 20:23:44,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-28 20:23:44,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-28 20:23:44,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-28 20:23:44,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:44,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-28 20:23:44,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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-28 20:23:44,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:44,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:44,707 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 143 transitions. [2023-11-28 20:23:44,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-28 20:23:44,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:44,730 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-28 20:23:44,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-28 20:23:44,732 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2023-11-28 20:23:44,732 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-28 20:23:44,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-28 20:23:44,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:44,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:23:44,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:44,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:44,933 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:44,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 413991643, now seen corresponding path program 1 times [2023-11-28 20:23:44,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:44,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236588334] [2023-11-28 20:23:44,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:44,936 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-28 20:23:44,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:44,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:44,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:45,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:23:45,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:45,040 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-28 20:23:45,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:45,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:45,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236588334] [2023-11-28 20:23:45,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236588334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:45,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:45,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:23:45,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826289497] [2023-11-28 20:23:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:45,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:45,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:45,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2023-11-28 20:23:45,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:45,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:45,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2023-11-28 20:23:45,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:45,762 INFO L124 PetriNetUnfolderBase]: 3311/5496 cut-off events. [2023-11-28 20:23:45,762 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-28 20:23:45,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10318 conditions, 5496 events. 3311/5496 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 39782 event pairs, 593 based on Foata normal form. 0/5440 useless extension candidates. Maximal degree in co-relation 10307. Up to 3661 conditions per place. [2023-11-28 20:23:45,787 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-28 20:23:45,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 260 flow [2023-11-28 20:23:45,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:45,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-28 20:23:45,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7897435897435897 [2023-11-28 20:23:45,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-28 20:23:45,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-28 20:23:45,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:45,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-28 20:23:45,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 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-28 20:23:45,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:45,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:45,793 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 154 transitions. [2023-11-28 20:23:45,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 260 flow [2023-11-28 20:23:45,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:45,798 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-28 20:23:45,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-28 20:23:45,799 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-28 20:23:45,800 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-28 20:23:45,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:45,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:45,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:23:45,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:46,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:46,003 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:46,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:46,004 INFO L85 PathProgramCache]: Analyzing trace with hash 413990249, now seen corresponding path program 1 times [2023-11-28 20:23:46,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:46,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059590802] [2023-11-28 20:23:46,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:46,004 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-28 20:23:46,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:46,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:46,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:46,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:23:46,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:46,083 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-28 20:23:46,090 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-28 20:23:46,090 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:46,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:46,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059590802] [2023-11-28 20:23:46,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059590802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:46,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:46,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:23:46,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737759120] [2023-11-28 20:23:46,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:46,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:46,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:46,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:46,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:46,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:23:46,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-28 20:23:46,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:46,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:23:46,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:46,721 INFO L124 PetriNetUnfolderBase]: 2906/5170 cut-off events. [2023-11-28 20:23:46,721 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-28 20:23:46,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9582 conditions, 5170 events. 2906/5170 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 38153 event pairs, 2290 based on Foata normal form. 0/4969 useless extension candidates. Maximal degree in co-relation 9571. Up to 3466 conditions per place. [2023-11-28 20:23:46,759 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-28 20:23:46,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 210 flow [2023-11-28 20:23:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-28 20:23:46,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-28 20:23:46,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-28 20:23:46,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-28 20:23:46,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:46,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-28 20:23:46,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 20:23:46,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:46,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:46,764 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 138 transitions. [2023-11-28 20:23:46,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 210 flow [2023-11-28 20:23:46,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:46,767 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-28 20:23:46,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-28 20:23:46,768 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-11-28 20:23:46,768 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-28 20:23:46,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-28 20:23:46,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:46,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:23:46,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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)] Forceful destruction successful, exit code 0 [2023-11-28 20:23:46,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:46,970 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:46,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash 413990250, now seen corresponding path program 1 times [2023-11-28 20:23:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:46,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887602962] [2023-11-28 20:23:46,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:46,971 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-28 20:23:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:46,972 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:46,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:47,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:23:47,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:47,067 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-28 20:23:47,078 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-28 20:23:47,078 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:47,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:47,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887602962] [2023-11-28 20:23:47,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887602962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:47,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:47,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:23:47,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213532161] [2023-11-28 20:23:47,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:47,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:47,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:47,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:47,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:23:47,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:47,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:47,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:23:47,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:47,745 INFO L124 PetriNetUnfolderBase]: 2903/5162 cut-off events. [2023-11-28 20:23:47,745 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-28 20:23:47,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9435 conditions, 5162 events. 2903/5162 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 38069 event pairs, 2288 based on Foata normal form. 4/4965 useless extension candidates. Maximal degree in co-relation 9425. Up to 3459 conditions per place. [2023-11-28 20:23:47,776 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-28 20:23:47,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-28 20:23:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-28 20:23:47,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-28 20:23:47,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-28 20:23:47,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-28 20:23:47,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:47,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-28 20:23:47,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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-28 20:23:47,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:47,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:47,781 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 140 transitions. [2023-11-28 20:23:47,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-28 20:23:47,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:47,791 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-28 20:23:47,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-28 20:23:47,792 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-11-28 20:23:47,792 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-28 20:23:47,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:47,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:47,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:47,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:47,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:47,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:47,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:47,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1962137237, now seen corresponding path program 1 times [2023-11-28 20:23:47,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:47,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425381426] [2023-11-28 20:23:47,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:47,997 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-28 20:23:47,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:47,998 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:48,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:48,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:23:48,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:48,097 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-28 20:23:48,104 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-28 20:23:48,104 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:48,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425381426] [2023-11-28 20:23:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425381426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:48,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:48,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:23:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563545711] [2023-11-28 20:23:48,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:48,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:48,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:48,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:48,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:23:48,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:48,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:48,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:23:48,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:48,881 INFO L124 PetriNetUnfolderBase]: 2920/5209 cut-off events. [2023-11-28 20:23:48,881 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-28 20:23:48,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9511 conditions, 5209 events. 2920/5209 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 38363 event pairs, 1356 based on Foata normal form. 0/5035 useless extension candidates. Maximal degree in co-relation 9501. Up to 3460 conditions per place. [2023-11-28 20:23:48,917 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-28 20:23:48,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-28 20:23:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-28 20:23:48,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-28 20:23:48,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-28 20:23:48,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-28 20:23:48,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:48,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-28 20:23:48,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 20:23:48,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:48,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:48,921 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 138 transitions. [2023-11-28 20:23:48,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-28 20:23:48,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:48,926 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-28 20:23:48,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-28 20:23:48,928 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-28 20:23:48,928 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-28 20:23:48,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:48,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:48,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:48,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:49,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:49,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:49,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1962137236, now seen corresponding path program 1 times [2023-11-28 20:23:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:49,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058760125] [2023-11-28 20:23:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:49,133 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-28 20:23:49,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:49,134 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:49,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:49,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:23:49,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:49,230 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-28 20:23:49,238 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-28 20:23:49,238 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:49,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:49,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058760125] [2023-11-28 20:23:49,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058760125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:49,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:49,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:23:49,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270304866] [2023-11-28 20:23:49,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:49,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:49,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:49,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:49,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:23:49,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:49,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:49,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:23:49,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:49,821 INFO L124 PetriNetUnfolderBase]: 2903/5128 cut-off events. [2023-11-28 20:23:49,821 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-28 20:23:49,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9409 conditions, 5128 events. 2903/5128 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37507 event pairs, 1884 based on Foata normal form. 12/4970 useless extension candidates. Maximal degree in co-relation 9399. Up to 3431 conditions per place. [2023-11-28 20:23:49,844 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-28 20:23:49,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-28 20:23:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-28 20:23:49,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-28 20:23:49,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-28 20:23:49,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-28 20:23:49,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:49,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-28 20:23:49,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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-28 20:23:49,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:49,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:49,847 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 140 transitions. [2023-11-28 20:23:49,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-28 20:23:49,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:49,850 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-28 20:23:49,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-28 20:23:49,851 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-11-28 20:23:49,851 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-28 20:23:49,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:49,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:49,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:49,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:50,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:50,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:50,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash 474904327, now seen corresponding path program 1 times [2023-11-28 20:23:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:50,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327892769] [2023-11-28 20:23:50,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:50,053 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-28 20:23:50,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:50,054 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:50,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:50,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:23:50,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:50,149 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-28 20:23:50,154 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-28 20:23:50,154 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:50,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:50,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327892769] [2023-11-28 20:23:50,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327892769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:50,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:50,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:23:50,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906623743] [2023-11-28 20:23:50,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:50,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:50,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:50,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:50,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-28 20:23:50,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-28 20:23:50,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:50,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-28 20:23:50,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:50,716 INFO L124 PetriNetUnfolderBase]: 2978/5219 cut-off events. [2023-11-28 20:23:50,716 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-28 20:23:50,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9611 conditions, 5219 events. 2978/5219 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37868 event pairs, 920 based on Foata normal form. 0/5121 useless extension candidates. Maximal degree in co-relation 9601. Up to 3426 conditions per place. [2023-11-28 20:23:50,734 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-28 20:23:50,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 200 flow [2023-11-28 20:23:50,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-28 20:23:50,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-28 20:23:50,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-28 20:23:50,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-28 20:23:50,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:50,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-28 20:23:50,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 20:23:50,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:50,738 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:50,738 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 138 transitions. [2023-11-28 20:23:50,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 200 flow [2023-11-28 20:23:50,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:50,741 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-28 20:23:50,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-28 20:23:50,742 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2023-11-28 20:23:50,742 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-28 20:23:50,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-28 20:23:50,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:50,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:50,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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)] Forceful destruction successful, exit code 0 [2023-11-28 20:23:50,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:50,943 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:50,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash 474904328, now seen corresponding path program 1 times [2023-11-28 20:23:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:50,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152959059] [2023-11-28 20:23:50,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:50,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-28 20:23:50,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:50,945 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:50,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:51,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:23:51,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:51,032 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-28 20:23:51,043 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-28 20:23:51,043 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:51,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:51,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152959059] [2023-11-28 20:23:51,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152959059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:51,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:51,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:23:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538120380] [2023-11-28 20:23:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:51,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:51,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:51,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:51,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:23:51,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-28 20:23:51,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:51,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:23:51,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:51,581 INFO L124 PetriNetUnfolderBase]: 2903/5108 cut-off events. [2023-11-28 20:23:51,582 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-28 20:23:51,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9413 conditions, 5108 events. 2903/5108 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37137 event pairs, 920 based on Foata normal form. 36/5062 useless extension candidates. Maximal degree in co-relation 9403. Up to 3315 conditions per place. [2023-11-28 20:23:51,603 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-28 20:23:51,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 196 flow [2023-11-28 20:23:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-28 20:23:51,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-28 20:23:51,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-28 20:23:51,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-28 20:23:51,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:51,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-28 20:23:51,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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-28 20:23:51,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:51,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 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-28 20:23:51,607 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 140 transitions. [2023-11-28 20:23:51,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 196 flow [2023-11-28 20:23:51,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:51,609 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 108 flow [2023-11-28 20:23:51,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=108, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-28 20:23:51,610 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-11-28 20:23:51,610 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 108 flow [2023-11-28 20:23:51,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-28 20:23:51,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:51,610 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] [2023-11-28 20:23:51,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:51,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:51,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:51,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1879658420, now seen corresponding path program 1 times [2023-11-28 20:23:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:51,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126706299] [2023-11-28 20:23:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:51,812 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-28 20:23:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:51,813 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:51,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:51,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:23:51,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:51,961 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-28 20:23:51,961 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:51,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:51,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126706299] [2023-11-28 20:23:51,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126706299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:51,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:51,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:23:51,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983971768] [2023-11-28 20:23:51,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:51,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:23:51,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:51,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:23:51,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:23:51,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-28 20:23:51,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 20:23:51,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:51,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-28 20:23:51,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:53,227 INFO L124 PetriNetUnfolderBase]: 9971/15461 cut-off events. [2023-11-28 20:23:53,228 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-28 20:23:53,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29686 conditions, 15461 events. 9971/15461 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 111863 event pairs, 1033 based on Foata normal form. 400/15785 useless extension candidates. Maximal degree in co-relation 29676. Up to 8761 conditions per place. [2023-11-28 20:23:53,279 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 54 selfloop transitions, 6 changer transitions 1/80 dead transitions. [2023-11-28 20:23:53,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 302 flow [2023-11-28 20:23:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:23:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 20:23:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2023-11-28 20:23:53,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7192307692307692 [2023-11-28 20:23:53,280 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 187 transitions. [2023-11-28 20:23:53,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 187 transitions. [2023-11-28 20:23:53,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:53,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 187 transitions. [2023-11-28 20:23:53,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:53,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 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-28 20:23:53,282 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 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-28 20:23:53,282 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 108 flow. Second operand 4 states and 187 transitions. [2023-11-28 20:23:53,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 302 flow [2023-11-28 20:23:53,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:53,290 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 146 flow [2023-11-28 20:23:53,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-11-28 20:23:53,291 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-28 20:23:53,291 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 146 flow [2023-11-28 20:23:53,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 20:23:53,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:53,292 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] [2023-11-28 20:23:53,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:53,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:53,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:53,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:53,492 INFO L85 PathProgramCache]: Analyzing trace with hash 344109089, now seen corresponding path program 1 times [2023-11-28 20:23:53,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:53,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567396076] [2023-11-28 20:23:53,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:53,493 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-28 20:23:53,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:53,494 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:53,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:53,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:23:53,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:53,647 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-28 20:23:53,648 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:53,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:53,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567396076] [2023-11-28 20:23:53,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567396076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:53,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:53,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:23:53,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257446940] [2023-11-28 20:23:53,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:53,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:23:53,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:53,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:23:53,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:23:53,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-28 20:23:53,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 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-28 20:23:53,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:53,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-28 20:23:53,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:54,767 INFO L124 PetriNetUnfolderBase]: 7427/11561 cut-off events. [2023-11-28 20:23:54,767 INFO L125 PetriNetUnfolderBase]: For 2544/2544 co-relation queries the response was YES. [2023-11-28 20:23:54,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25489 conditions, 11561 events. 7427/11561 cut-off events. For 2544/2544 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 79049 event pairs, 451 based on Foata normal form. 364/11855 useless extension candidates. Maximal degree in co-relation 25476. Up to 5521 conditions per place. [2023-11-28 20:23:54,817 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 69 selfloop transitions, 10 changer transitions 1/99 dead transitions. [2023-11-28 20:23:54,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 429 flow [2023-11-28 20:23:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:23:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:23:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2023-11-28 20:23:54,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7292307692307692 [2023-11-28 20:23:54,819 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 237 transitions. [2023-11-28 20:23:54,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 237 transitions. [2023-11-28 20:23:54,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:54,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 237 transitions. [2023-11-28 20:23:54,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 47.4) internal successors, (237), 5 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-28 20:23:54,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 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-28 20:23:54,822 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 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-28 20:23:54,822 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 146 flow. Second operand 5 states and 237 transitions. [2023-11-28 20:23:54,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 429 flow [2023-11-28 20:23:54,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 418 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:54,826 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 198 flow [2023-11-28 20:23:54,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-11-28 20:23:54,827 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-28 20:23:54,827 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 198 flow [2023-11-28 20:23:54,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 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-28 20:23:54,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:54,827 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] [2023-11-28 20:23:54,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:55,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:55,028 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:55,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:55,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1247161243, now seen corresponding path program 1 times [2023-11-28 20:23:55,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:55,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527494643] [2023-11-28 20:23:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:55,029 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-28 20:23:55,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:55,030 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:55,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:55,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:23:55,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:55,210 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-28 20:23:55,210 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:55,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:55,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527494643] [2023-11-28 20:23:55,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527494643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:55,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:55,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:23:55,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649028672] [2023-11-28 20:23:55,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:55,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:23:55,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:55,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:23:55,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:23:55,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-28 20:23:55,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 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-28 20:23:55,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:55,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-28 20:23:55,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:56,107 INFO L124 PetriNetUnfolderBase]: 4491/6877 cut-off events. [2023-11-28 20:23:56,107 INFO L125 PetriNetUnfolderBase]: For 4686/4686 co-relation queries the response was YES. [2023-11-28 20:23:56,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17111 conditions, 6877 events. 4491/6877 cut-off events. For 4686/4686 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 40779 event pairs, 289 based on Foata normal form. 244/7051 useless extension candidates. Maximal degree in co-relation 17096. Up to 1969 conditions per place. [2023-11-28 20:23:56,135 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 82 selfloop transitions, 14 changer transitions 1/116 dead transitions. [2023-11-28 20:23:56,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 116 transitions, 560 flow [2023-11-28 20:23:56,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:23:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:23:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2023-11-28 20:23:56,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2023-11-28 20:23:56,137 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 285 transitions. [2023-11-28 20:23:56,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 285 transitions. [2023-11-28 20:23:56,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:56,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 285 transitions. [2023-11-28 20:23:56,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.5) internal successors, (285), 6 states have internal predecessors, (285), 0 states have call successors, (0), 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-28 20:23:56,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 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-28 20:23:56,139 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 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-28 20:23:56,139 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 198 flow. Second operand 6 states and 285 transitions. [2023-11-28 20:23:56,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 116 transitions, 560 flow [2023-11-28 20:23:56,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 530 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-28 20:23:56,162 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 248 flow [2023-11-28 20:23:56,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-11-28 20:23:56,163 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2023-11-28 20:23:56,163 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 248 flow [2023-11-28 20:23:56,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 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-28 20:23:56,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:56,163 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, 1] [2023-11-28 20:23:56,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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)] Forceful destruction successful, exit code 0 [2023-11-28 20:23:56,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:56,364 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:56,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:56,364 INFO L85 PathProgramCache]: Analyzing trace with hash 824681319, now seen corresponding path program 1 times [2023-11-28 20:23:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:56,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814063068] [2023-11-28 20:23:56,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:56,365 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-28 20:23:56,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:56,366 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:56,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:56,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:23:56,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:56,565 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-28 20:23:56,565 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:56,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:56,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814063068] [2023-11-28 20:23:56,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814063068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:56,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:56,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:23:56,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213652851] [2023-11-28 20:23:56,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:56,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:23:56,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:56,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:23:56,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:23:56,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-28 20:23:56,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 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-28 20:23:56,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:56,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-28 20:23:56,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:57,335 INFO L124 PetriNetUnfolderBase]: 2927/4285 cut-off events. [2023-11-28 20:23:57,335 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2023-11-28 20:23:57,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11808 conditions, 4285 events. 2927/4285 cut-off events. For 4826/4826 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22544 event pairs, 231 based on Foata normal form. 96/4311 useless extension candidates. Maximal degree in co-relation 11792. Up to 1316 conditions per place. [2023-11-28 20:23:57,350 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 73 selfloop transitions, 18 changer transitions 1/111 dead transitions. [2023-11-28 20:23:57,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 111 transitions, 550 flow [2023-11-28 20:23:57,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:23:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:23:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 311 transitions. [2023-11-28 20:23:57,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6835164835164835 [2023-11-28 20:23:57,352 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 311 transitions. [2023-11-28 20:23:57,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 311 transitions. [2023-11-28 20:23:57,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:57,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 311 transitions. [2023-11-28 20:23:57,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.42857142857143) internal successors, (311), 7 states have internal predecessors, (311), 0 states have call successors, (0), 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-28 20:23:57,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:23:57,355 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:23:57,355 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 248 flow. Second operand 7 states and 311 transitions. [2023-11-28 20:23:57,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 111 transitions, 550 flow [2023-11-28 20:23:57,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 504 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-28 20:23:57,388 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 258 flow [2023-11-28 20:23:57,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2023-11-28 20:23:57,389 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2023-11-28 20:23:57,389 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 258 flow [2023-11-28 20:23:57,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 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-28 20:23:57,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:57,390 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, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:57,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:57,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:57,590 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:57,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:57,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1010758377, now seen corresponding path program 1 times [2023-11-28 20:23:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:57,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587515205] [2023-11-28 20:23:57,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:57,591 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-28 20:23:57,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:57,592 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:57,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:57,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-28 20:23:57,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:58,595 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1513~0#1.base_45| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1514~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1516~0#1.base_45| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1515~0#1.base_55| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1513~0#1.base_45| (_ bv1 1)))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t1514~0#1.base_49| (_ bv1 1)))) (and (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1513~0#1.base_45| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1514~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1515~0#1.base_55| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1516~0#1.base_45| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t1514~0#1.base_49|)) (= (_ bv0 1) (select (store .cse1 |v_ULTIMATE.start_main_~#t1515~0#1.base_55| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1516~0#1.base_45|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1513~0#1.base_45|) (_ bv0 1)) (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~#t1515~0#1.base_55|)))))) is different from true [2023-11-28 20:23:58,597 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-28 20:23:58,597 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:58,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:58,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587515205] [2023-11-28 20:23:58,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587515205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:58,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:58,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:23:58,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207468562] [2023-11-28 20:23:58,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:58,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:23:58,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:58,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:23:58,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-28 20:23:58,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 65 [2023-11-28 20:23:58,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 26.428571428571427) internal successors, (185), 7 states have internal predecessors, (185), 0 states have call successors, (0), 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-28 20:23:58,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:58,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 65 [2023-11-28 20:23:58,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:59,276 INFO L124 PetriNetUnfolderBase]: 1588/2728 cut-off events. [2023-11-28 20:23:59,276 INFO L125 PetriNetUnfolderBase]: For 1080/1165 co-relation queries the response was YES. [2023-11-28 20:23:59,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6169 conditions, 2728 events. 1588/2728 cut-off events. For 1080/1165 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16387 event pairs, 204 based on Foata normal form. 16/2586 useless extension candidates. Maximal degree in co-relation 6151. Up to 1876 conditions per place. [2023-11-28 20:23:59,289 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 43 selfloop transitions, 9 changer transitions 0/83 dead transitions. [2023-11-28 20:23:59,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 83 transitions, 408 flow [2023-11-28 20:23:59,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:23:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:23:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2023-11-28 20:23:59,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703296703296703 [2023-11-28 20:23:59,291 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 214 transitions. [2023-11-28 20:23:59,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 214 transitions. [2023-11-28 20:23:59,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:59,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 214 transitions. [2023-11-28 20:23:59,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 0 states have call successors, (0), 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-28 20:23:59,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:23:59,293 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 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-28 20:23:59,293 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 258 flow. Second operand 7 states and 214 transitions. [2023-11-28 20:23:59,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 83 transitions, 408 flow [2023-11-28 20:23:59,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 83 transitions, 312 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-28 20:23:59,301 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 203 flow [2023-11-28 20:23:59,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2023-11-28 20:23:59,302 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2023-11-28 20:23:59,302 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 203 flow [2023-11-28 20:23:59,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.428571428571427) internal successors, (185), 7 states have internal predecessors, (185), 0 states have call successors, (0), 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-28 20:23:59,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:59,303 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, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:59,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:59,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:59,503 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:23:59,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash -497587086, now seen corresponding path program 1 times [2023-11-28 20:23:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:59,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496142171] [2023-11-28 20:23:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:59,504 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-28 20:23:59,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:59,505 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:59,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:23:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:59,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-28 20:23:59,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:24:00,202 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-28 20:24:00,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:24:00,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:24:00,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496142171] [2023-11-28 20:24:00,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496142171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:00,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:00,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:24:00,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130875616] [2023-11-28 20:24:00,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:00,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:24:00,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:24:00,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:24:00,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:24:00,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-28 20:24:00,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 203 flow. Second operand has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 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-28 20:24:00,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:00,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-28 20:24:00,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:00,921 INFO L124 PetriNetUnfolderBase]: 2294/3759 cut-off events. [2023-11-28 20:24:00,921 INFO L125 PetriNetUnfolderBase]: For 1146/1376 co-relation queries the response was YES. [2023-11-28 20:24:00,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9150 conditions, 3759 events. 2294/3759 cut-off events. For 1146/1376 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22441 event pairs, 539 based on Foata normal form. 16/3575 useless extension candidates. Maximal degree in co-relation 9137. Up to 1499 conditions per place. [2023-11-28 20:24:00,956 INFO L140 encePairwiseOnDemand]: 56/65 looper letters, 78 selfloop transitions, 9 changer transitions 0/122 dead transitions. [2023-11-28 20:24:00,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 578 flow [2023-11-28 20:24:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:24:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 20:24:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 395 transitions. [2023-11-28 20:24:00,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2023-11-28 20:24:00,959 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 395 transitions. [2023-11-28 20:24:00,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 395 transitions. [2023-11-28 20:24:00,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:00,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 395 transitions. [2023-11-28 20:24:00,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 43.888888888888886) internal successors, (395), 9 states have internal predecessors, (395), 0 states have call successors, (0), 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-28 20:24:00,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 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-28 20:24:00,963 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 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-28 20:24:00,963 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 203 flow. Second operand 9 states and 395 transitions. [2023-11-28 20:24:00,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 578 flow [2023-11-28 20:24:00,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 548 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-28 20:24:00,967 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 240 flow [2023-11-28 20:24:00,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2023-11-28 20:24:00,968 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2023-11-28 20:24:00,968 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 240 flow [2023-11-28 20:24:00,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 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-28 20:24:00,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:00,969 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, 1, 1, 1, 1, 1, 1] [2023-11-28 20:24:00,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:24:01,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:24:01,169 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:24:01,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:01,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1943279556, now seen corresponding path program 2 times [2023-11-28 20:24:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:24:01,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633944375] [2023-11-28 20:24:01,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:24:01,170 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-28 20:24:01,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:24:01,171 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:24:01,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 (17)] Waiting until timeout for monitored process [2023-11-28 20:24:01,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 20:24:01,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:24:01,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:24:01,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:24:01,347 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-28 20:24:01,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:24:01,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:24:01,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633944375] [2023-11-28 20:24:01,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633944375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:01,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:01,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:24:01,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13949384] [2023-11-28 20:24:01,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:01,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:24:01,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:24:01,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:24:01,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:24:01,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-28 20:24:01,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:24:01,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:01,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-28 20:24:01,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:02,114 INFO L124 PetriNetUnfolderBase]: 4932/7981 cut-off events. [2023-11-28 20:24:02,114 INFO L125 PetriNetUnfolderBase]: For 3768/3946 co-relation queries the response was YES. [2023-11-28 20:24:02,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20216 conditions, 7981 events. 4932/7981 cut-off events. For 3768/3946 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 53413 event pairs, 1799 based on Foata normal form. 16/7631 useless extension candidates. Maximal degree in co-relation 20199. Up to 3299 conditions per place. [2023-11-28 20:24:02,161 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 64 selfloop transitions, 8 changer transitions 0/105 dead transitions. [2023-11-28 20:24:02,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 105 transitions, 528 flow [2023-11-28 20:24:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:24:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:24:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2023-11-28 20:24:02,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.676923076923077 [2023-11-28 20:24:02,163 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 220 transitions. [2023-11-28 20:24:02,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 220 transitions. [2023-11-28 20:24:02,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:02,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 220 transitions. [2023-11-28 20:24:02,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 44.0) internal successors, (220), 5 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-28 20:24:02,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 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-28 20:24:02,165 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 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-28 20:24:02,165 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 240 flow. Second operand 5 states and 220 transitions. [2023-11-28 20:24:02,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 105 transitions, 528 flow [2023-11-28 20:24:02,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 518 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 20:24:02,173 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 316 flow [2023-11-28 20:24:02,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2023-11-28 20:24:02,173 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 8 predicate places. [2023-11-28 20:24:02,173 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 316 flow [2023-11-28 20:24:02,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:24:02,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:02,174 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, 1, 1, 1, 1, 1, 1] [2023-11-28 20:24:02,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 (17)] Ended with exit code 0 [2023-11-28 20:24:02,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:24:02,374 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:24:02,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:02,375 INFO L85 PathProgramCache]: Analyzing trace with hash -441371830, now seen corresponding path program 3 times [2023-11-28 20:24:02,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:24:02,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586058846] [2023-11-28 20:24:02,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:24:02,375 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-28 20:24:02,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:24:02,376 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:24:02,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 (18)] Waiting until timeout for monitored process [2023-11-28 20:24:02,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-28 20:24:02,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:24:02,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:24:02,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:24:02,527 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-28 20:24:02,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:24:02,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:24:02,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586058846] [2023-11-28 20:24:02,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586058846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:02,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:02,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:24:02,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25820149] [2023-11-28 20:24:02,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:02,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:24:02,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:24:02,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:24:02,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:24:02,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-28 20:24:02,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:24:02,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:02,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-28 20:24:02,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:03,908 INFO L124 PetriNetUnfolderBase]: 9409/15274 cut-off events. [2023-11-28 20:24:03,908 INFO L125 PetriNetUnfolderBase]: For 6668/7358 co-relation queries the response was YES. [2023-11-28 20:24:03,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38878 conditions, 15274 events. 9409/15274 cut-off events. For 6668/7358 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 113666 event pairs, 4265 based on Foata normal form. 33/14341 useless extension candidates. Maximal degree in co-relation 38859. Up to 6577 conditions per place. [2023-11-28 20:24:03,999 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 73 selfloop transitions, 14 changer transitions 0/121 dead transitions. [2023-11-28 20:24:03,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 710 flow [2023-11-28 20:24:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:24:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:24:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2023-11-28 20:24:04,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6861538461538461 [2023-11-28 20:24:04,000 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 223 transitions. [2023-11-28 20:24:04,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 223 transitions. [2023-11-28 20:24:04,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:04,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 223 transitions. [2023-11-28 20:24:04,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 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-28 20:24:04,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 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-28 20:24:04,002 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 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-28 20:24:04,002 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 316 flow. Second operand 5 states and 223 transitions. [2023-11-28 20:24:04,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 710 flow [2023-11-28 20:24:04,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:24:04,033 INFO L231 Difference]: Finished difference. Result has 86 places, 89 transitions, 502 flow [2023-11-28 20:24:04,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=502, PETRI_PLACES=86, PETRI_TRANSITIONS=89} [2023-11-28 20:24:04,034 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 14 predicate places. [2023-11-28 20:24:04,034 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 89 transitions, 502 flow [2023-11-28 20:24:04,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:24:04,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:04,034 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, 1, 1, 1, 1, 1, 1] [2023-11-28 20:24:04,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 (18)] Ended with exit code 0 [2023-11-28 20:24:04,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:24:04,235 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:24:04,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash -670253648, now seen corresponding path program 4 times [2023-11-28 20:24:04,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:24:04,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178311746] [2023-11-28 20:24:04,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 20:24:04,235 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-28 20:24:04,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:24:04,236 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:24:04,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 (19)] Waiting until timeout for monitored process [2023-11-28 20:24:04,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 20:24:04,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:24:04,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:24:04,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:24:04,393 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-28 20:24:04,393 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:24:04,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:24:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178311746] [2023-11-28 20:24:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178311746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:04,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:04,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:24:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127841769] [2023-11-28 20:24:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:24:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:24:04,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:24:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:24:04,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-28 20:24:04,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 89 transitions, 502 flow. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:24:04,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:04,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-28 20:24:04,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:07,028 INFO L124 PetriNetUnfolderBase]: 18256/29275 cut-off events. [2023-11-28 20:24:07,028 INFO L125 PetriNetUnfolderBase]: For 17386/18541 co-relation queries the response was YES. [2023-11-28 20:24:07,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76146 conditions, 29275 events. 18256/29275 cut-off events. For 17386/18541 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 233741 event pairs, 7054 based on Foata normal form. 16/27317 useless extension candidates. Maximal degree in co-relation 76124. Up to 12062 conditions per place. [2023-11-28 20:24:07,216 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 84 selfloop transitions, 26 changer transitions 0/145 dead transitions. [2023-11-28 20:24:07,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 145 transitions, 1114 flow [2023-11-28 20:24:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:24:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:24:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2023-11-28 20:24:07,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.683076923076923 [2023-11-28 20:24:07,218 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 222 transitions. [2023-11-28 20:24:07,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 222 transitions. [2023-11-28 20:24:07,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:07,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 222 transitions. [2023-11-28 20:24:07,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 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-28 20:24:07,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 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-28 20:24:07,220 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 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-28 20:24:07,220 INFO L175 Difference]: Start difference. First operand has 86 places, 89 transitions, 502 flow. Second operand 5 states and 222 transitions. [2023-11-28 20:24:07,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 145 transitions, 1114 flow [2023-11-28 20:24:07,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 145 transitions, 1112 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:24:07,357 INFO L231 Difference]: Finished difference. Result has 92 places, 114 transitions, 936 flow [2023-11-28 20:24:07,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=936, PETRI_PLACES=92, PETRI_TRANSITIONS=114} [2023-11-28 20:24:07,357 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 20 predicate places. [2023-11-28 20:24:07,358 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 114 transitions, 936 flow [2023-11-28 20:24:07,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:24:07,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:07,358 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, 1, 1, 1, 1, 1, 1] [2023-11-28 20:24:07,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 (19)] Ended with exit code 0 [2023-11-28 20:24:07,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:24:07,558 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 20:24:07,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:07,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1614396856, now seen corresponding path program 5 times [2023-11-28 20:24:07,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:24:07,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539466001] [2023-11-28 20:24:07,559 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 20:24:07,559 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-28 20:24:07,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:24:07,560 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:24:07,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 (20)] Waiting until timeout for monitored process [2023-11-28 20:24:07,734 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 20:24:07,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-28 20:24:07,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:24:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:24:07,893 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-28 20:24:07,893 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:24:07,894 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-28 20:24:07,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-28 20:24:07,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-28 20:24:07,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-28 20:24:07,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-28 20:24:07,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-28 20:24:07,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-28 20:24:07,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-28 20:24:07,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-28 20:24:07,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-28 20:24:07,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-28 20:24:07,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-28 20:24:07,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-28 20:24:07,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-28 20:24:07,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-28 20:24:07,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-28 20:24:07,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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 (20)] Ended with exit code 0 [2023-11-28 20:24:08,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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-28 20:24:08,098 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:24:08,102 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 20:24:08,102 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:24:08,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 20:24:08,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 20:24:08,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 20:24:08,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-28 20:24:08,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:24:08,186 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:24:08,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:24:08 BasicIcfg [2023-11-28 20:24:08,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:24:08,198 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:24:08,199 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:24:08,199 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:24:08,199 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:41" (3/4) ... [2023-11-28 20:24:08,201 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:24:08,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:24:08,203 INFO L158 Benchmark]: Toolchain (without parser) took 28676.57ms. Allocated memory was 73.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 48.8MB in the beginning and 421.5MB in the end (delta: -372.7MB). Peak memory consumption was 855.4MB. Max. memory is 16.1GB. [2023-11-28 20:24:08,203 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 73.4MB. Free memory was 50.1MB in the beginning and 50.0MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:24:08,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.65ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 48.6MB in the beginning and 78.7MB in the end (delta: -30.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-11-28 20:24:08,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.34ms. Allocated memory is still 107.0MB. Free memory was 78.7MB in the beginning and 76.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:24:08,204 INFO L158 Benchmark]: Boogie Preprocessor took 61.78ms. Allocated memory is still 107.0MB. Free memory was 76.1MB in the beginning and 72.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:24:08,204 INFO L158 Benchmark]: RCFGBuilder took 867.92ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 76.3MB in the end (delta: -3.8MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2023-11-28 20:24:08,205 INFO L158 Benchmark]: TraceAbstraction took 27100.12ms. Allocated memory was 107.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 75.5MB in the beginning and 421.5MB in the end (delta: -346.0MB). Peak memory consumption was 849.0MB. Max. memory is 16.1GB. [2023-11-28 20:24:08,205 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 1.3GB. Free memory is still 421.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:24:08,207 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.29ms. Allocated memory is still 73.4MB. Free memory was 50.1MB in the beginning and 50.0MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 578.65ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 48.6MB in the beginning and 78.7MB in the end (delta: -30.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.34ms. Allocated memory is still 107.0MB. Free memory was 78.7MB in the beginning and 76.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.78ms. Allocated memory is still 107.0MB. Free memory was 76.1MB in the beginning and 72.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 867.92ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 76.3MB in the end (delta: -3.8MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27100.12ms. Allocated memory was 107.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 75.5MB in the beginning and 421.5MB in the end (delta: -346.0MB). Peak memory consumption was 849.0MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 1.3GB. Free memory is still 421.5MB. 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: IdentifierExpression #t~pre11 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, t1513={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, y=0, z=0] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, t1513={7:0}, t1514={5:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L861] 0 pthread_t t1515; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, t1513={7:0}, t1514={5:0}, t1515={11:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=1, z=0] [L782] 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) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 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 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 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_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=1, z=0] [L796] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=2, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=2, z=1] [L802] 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) [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] 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 [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] 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_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=2, z=1] [L863] 0 pthread_t t1516; [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1513={7:0}, t1514={5:0}, t1515={11:0}, t1516={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L816] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L762] 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) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 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 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 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_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=2, z=2] [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=2, z=2] [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=2, z=2] [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=2, z=2] [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t1513={7:0}, t1514={5:0}, t1515={11:0}, t1516={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 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) [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] 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 [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] 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=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t1513={7:0}, t1514={5:0}, t1515={11:0}, t1516={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t1513={7:0}, t1514={5:0}, t1515={11:0}, t1516={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L879] 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=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L17] 0 __assert_fail ("0", "mix057_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 862]: 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 9 procedures, 97 locations, 16 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: 26.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 934 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 782 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 82 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2352 IncrementalHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 24 mSDtfsCounter, 2352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=936occurred in iteration=18, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 358 ConstructedInterpolants, 1 QuantifiedInterpolants, 2737 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2478 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-28 20:24:08,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ddba31b-1f8c-45db-93ce-aa4b05864805/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