./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:46:09,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:46:09,481 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:46:09,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:46:09,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:46:09,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:46:09,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:46:09,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:46:09,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:46:09,514 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:46:09,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:46:09,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:46:09,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:46:09,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:46:09,517 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:46:09,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:46:09,518 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:46:09,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:46:09,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:46:09,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:46:09,521 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:46:09,521 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:46:09,522 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:46:09,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:46:09,523 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:46:09,523 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:46:09,524 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:46:09,524 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:46:09,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:46:09,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:46:09,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:46:09,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:46:09,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:46:09,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:46:09,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:46:09,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:46:09,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:46:09,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:46:09,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:46:09,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:46:09,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:46:09,528 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_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2023-11-29 05:46:09,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:46:09,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:46:09,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:46:09,778 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:46:09,778 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:46:09,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-29 05:46:12,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:46:12,798 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:46:12,799 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-29 05:46:12,815 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/data/ba4b409fc/a3c1141e045a4d6bb2e1ca0c30b462e3/FLAG256a2df9f [2023-11-29 05:46:12,828 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/data/ba4b409fc/a3c1141e045a4d6bb2e1ca0c30b462e3 [2023-11-29 05:46:12,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:46:12,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:46:12,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:46:12,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:46:12,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:46:12,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:46:12" (1/1) ... [2023-11-29 05:46:12,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4db67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:12, skipping insertion in model container [2023-11-29 05:46:12,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:46:12" (1/1) ... [2023-11-29 05:46:12,898 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:46:13,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:46:13,236 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:46:13,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:46:13,328 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:46:13,328 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:46:13,335 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:46:13,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13 WrapperNode [2023-11-29 05:46:13,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:46:13,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:46:13,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:46:13,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:46:13,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,390 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-29 05:46:13,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:46:13,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:46:13,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:46:13,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:46:13,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,427 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-29 05:46:13,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:46:13,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:46:13,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:46:13,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:46:13,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (1/1) ... [2023-11-29 05:46:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:46:13,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:46:13,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:46:13,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:46:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:46:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:46:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:46:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:46:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:46:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:46:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:46:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:46:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:46:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:46:13,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:46:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:46:13,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:46:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:46:13,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:46:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:46:13,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:46:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:46:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:46:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:46:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:46:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:46:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:46:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:46:13,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:46:13,539 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:46:13,691 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:46:13,693 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:46:14,019 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:46:14,175 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:46:14,176 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:46:14,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:14 BoogieIcfgContainer [2023-11-29 05:46:14,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:46:14,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:46:14,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:46:14,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:46:14,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:46:12" (1/3) ... [2023-11-29 05:46:14,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3e1ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:46:14, skipping insertion in model container [2023-11-29 05:46:14,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:13" (2/3) ... [2023-11-29 05:46:14,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3e1ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:46:14, skipping insertion in model container [2023-11-29 05:46:14,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:14" (3/3) ... [2023-11-29 05:46:14,184 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-29 05:46:14,200 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:46:14,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:46:14,201 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:46:14,254 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:46:14,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 146 flow [2023-11-29 05:46:14,343 INFO L124 PetriNetUnfolderBase]: 2/61 cut-off events. [2023-11-29 05:46:14,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:46:14,348 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 123 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-29 05:46:14,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 65 transitions, 146 flow [2023-11-29 05:46:14,354 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 134 flow [2023-11-29 05:46:14,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:46:14,372 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;@41545ba4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:46:14,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:46:14,376 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:46:14,376 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:46:14,376 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:46:14,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:14,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:46:14,378 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-29 05:46:14,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:14,384 INFO L85 PathProgramCache]: Analyzing trace with hash 14015, now seen corresponding path program 1 times [2023-11-29 05:46:14,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:14,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110235092] [2023-11-29 05:46:14,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110235092] [2023-11-29 05:46:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110235092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:14,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:14,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:46:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717329955] [2023-11-29 05:46:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:14,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:14,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:14,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:14,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:14,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 05:46:14,707 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-29 05:46:14,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:14,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 05:46:14,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:16,075 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-29 05:46:16,076 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 05:46:16,106 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 55050 event pairs, 3179 based on Foata normal form. 360/7051 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-29 05:46:16,174 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 05:46:16,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 224 flow [2023-11-29 05:46:16,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 05:46:16,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 05:46:16,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 05:46:16,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 05:46:16,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:16,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 05:46:16,198 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-29 05:46:16,203 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-29 05:46:16,203 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-29 05:46:16,206 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 134 flow. Second operand 3 states and 143 transitions. [2023-11-29 05:46:16,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 224 flow [2023-11-29 05:46:16,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:46:16,217 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:46:16,219 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-29 05:46:16,223 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-29 05:46:16,223 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:46:16,223 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-29 05:46:16,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:16,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:46:16,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:46:16,224 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-29 05:46:16,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash 14016, now seen corresponding path program 1 times [2023-11-29 05:46:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:16,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020826548] [2023-11-29 05:46:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:16,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020826548] [2023-11-29 05:46:16,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020826548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:16,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:16,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:46:16,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037268935] [2023-11-29 05:46:16,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:16,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:16,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:16,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:16,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:16,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 05:46:16,364 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-29 05:46:16,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:16,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 05:46:16,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:17,598 INFO L124 PetriNetUnfolderBase]: 4217/7282 cut-off events. [2023-11-29 05:46:17,599 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 05:46:17,622 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 54989 event pairs, 3179 based on Foata normal form. 1/6691 useless extension candidates. Maximal degree in co-relation 13375. Up to 4390 conditions per place. [2023-11-29 05:46:17,668 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 05:46:17,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-29 05:46:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 05:46:17,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 05:46:17,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 05:46:17,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 05:46:17,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:17,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 05:46:17,673 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-29 05:46:17,675 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-29 05:46:17,675 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-29 05:46:17,675 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 143 transitions. [2023-11-29 05:46:17,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-29 05:46:17,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:17,697 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 05:46:17,698 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-29 05:46:17,699 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2023-11-29 05:46:17,699 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 05:46:17,699 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-29 05:46:17,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:17,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:46:17,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:46:17,700 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:46:17,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:17,701 INFO L85 PathProgramCache]: Analyzing trace with hash 417954195, now seen corresponding path program 1 times [2023-11-29 05:46:17,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:17,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974114925] [2023-11-29 05:46:17,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:17,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:17,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:17,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974114925] [2023-11-29 05:46:17,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974114925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:17,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:17,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:17,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70243480] [2023-11-29 05:46:17,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:17,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:17,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:17,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:17,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 05:46:17,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 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-29 05:46:17,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:17,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 05:46:17,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:18,727 INFO L124 PetriNetUnfolderBase]: 4221/7281 cut-off events. [2023-11-29 05:46:18,727 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 05:46:18,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13394 conditions, 7281 events. 4221/7281 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 55552 event pairs, 2503 based on Foata normal form. 0/6701 useless extension candidates. Maximal degree in co-relation 13383. Up to 4393 conditions per place. [2023-11-29 05:46:18,774 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 36 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 05:46:18,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 220 flow [2023-11-29 05:46:18,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 05:46:18,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7230769230769231 [2023-11-29 05:46:18,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 05:46:18,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 05:46:18,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:18,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 05:46:18,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:18,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-29 05:46:18,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-29 05:46:18,780 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 141 transitions. [2023-11-29 05:46:18,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 220 flow [2023-11-29 05:46:18,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:18,802 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 05:46:18,802 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=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-29 05:46:18,803 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-29 05:46:18,803 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 05:46:18,803 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-29 05:46:18,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:18,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:46:18,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:46:18,804 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:46:18,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 417954196, now seen corresponding path program 1 times [2023-11-29 05:46:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:18,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874809218] [2023-11-29 05:46:18,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:18,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:18,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:18,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874809218] [2023-11-29 05:46:18,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874809218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:18,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:18,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119935889] [2023-11-29 05:46:18,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:18,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:18,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:18,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:18,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 05:46:18,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 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-29 05:46:18,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:18,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 05:46:18,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:19,790 INFO L124 PetriNetUnfolderBase]: 4217/7272 cut-off events. [2023-11-29 05:46:19,791 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-29 05:46:19,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13380 conditions, 7272 events. 4217/7272 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 55591 event pairs, 2503 based on Foata normal form. 5/6698 useless extension candidates. Maximal degree in co-relation 13370. Up to 4384 conditions per place. [2023-11-29 05:46:19,855 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 35 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 05:46:19,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 216 flow [2023-11-29 05:46:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 05:46:19,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 05:46:19,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 05:46:19,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 05:46:19,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:19,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 05:46:19,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-29 05:46:19,860 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-29 05:46:19,861 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-29 05:46:19,861 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 143 transitions. [2023-11-29 05:46:19,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 216 flow [2023-11-29 05:46:19,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:19,867 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 05:46:19,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-29 05:46:19,869 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2023-11-29 05:46:19,869 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 05:46:19,869 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-29 05:46:19,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:19,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:46:19,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:46:19,870 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:46:19,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:19,870 INFO L85 PathProgramCache]: Analyzing trace with hash 417955832, now seen corresponding path program 1 times [2023-11-29 05:46:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:19,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61727522] [2023-11-29 05:46:19,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:19,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:19,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:19,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61727522] [2023-11-29 05:46:19,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61727522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:19,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:19,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:46:19,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375628004] [2023-11-29 05:46:19,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:19,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:19,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:19,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:19,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2023-11-29 05:46:19,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 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-29 05:46:19,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:19,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2023-11-29 05:46:19,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:20,648 INFO L124 PetriNetUnfolderBase]: 3311/5494 cut-off events. [2023-11-29 05:46:20,648 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 05:46:20,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10319 conditions, 5494 events. 3311/5494 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 39888 event pairs, 593 based on Foata normal form. 0/5436 useless extension candidates. Maximal degree in co-relation 10309. Up to 3661 conditions per place. [2023-11-29 05:46:20,675 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 41 selfloop transitions, 2 changer transitions 2/73 dead transitions. [2023-11-29 05:46:20,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 258 flow [2023-11-29 05:46:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-29 05:46:20,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7897435897435897 [2023-11-29 05:46:20,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-29 05:46:20,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-29 05:46:20,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:20,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-29 05:46:20,678 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-29 05:46:20,680 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-29 05:46:20,680 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-29 05:46:20,680 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 154 transitions. [2023-11-29 05:46:20,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 258 flow [2023-11-29 05:46:20,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:20,685 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 116 flow [2023-11-29 05:46:20,685 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=116, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-29 05:46:20,686 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-11-29 05:46:20,686 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 116 flow [2023-11-29 05:46:20,686 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-29 05:46:20,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:20,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:20,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:46:20,687 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-29 05:46:20,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash 163662572, now seen corresponding path program 1 times [2023-11-29 05:46:20,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:20,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957458270] [2023-11-29 05:46:20,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:20,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:20,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:20,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957458270] [2023-11-29 05:46:20,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957458270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:20,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:20,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:20,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373362185] [2023-11-29 05:46:20,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:20,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:20,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:20,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:20,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:20,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 05:46:20,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 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-29 05:46:20,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:20,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 05:46:20,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:21,364 INFO L124 PetriNetUnfolderBase]: 2920/5157 cut-off events. [2023-11-29 05:46:21,364 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-29 05:46:21,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9593 conditions, 5157 events. 2920/5157 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37812 event pairs, 1892 based on Foata normal form. 0/4966 useless extension candidates. Maximal degree in co-relation 9582. Up to 3460 conditions per place. [2023-11-29 05:46:21,390 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:46:21,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 206 flow [2023-11-29 05:46:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 05:46:21,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-29 05:46:21,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 05:46:21,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 05:46:21,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:21,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 05:46:21,393 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-29 05:46:21,394 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-29 05:46:21,394 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-29 05:46:21,394 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 116 flow. Second operand 3 states and 138 transitions. [2023-11-29 05:46:21,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 206 flow [2023-11-29 05:46:21,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:21,397 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 05:46:21,397 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-29 05:46:21,398 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-29 05:46:21,398 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 05:46:21,399 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-29 05:46:21,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:21,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:21,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:46:21,399 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-29 05:46:21,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash 163662573, now seen corresponding path program 1 times [2023-11-29 05:46:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178339524] [2023-11-29 05:46:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:21,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178339524] [2023-11-29 05:46:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178339524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:21,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:21,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:21,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254199995] [2023-11-29 05:46:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:21,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:21,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 05:46:21,475 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-29 05:46:21,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:21,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 05:46:21,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:22,109 INFO L124 PetriNetUnfolderBase]: 2903/5180 cut-off events. [2023-11-29 05:46:22,109 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:46:22,122 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 38341 event pairs, 1356 based on Foata normal form. 12/5009 useless extension candidates. Maximal degree in co-relation 9451. Up to 3431 conditions per place. [2023-11-29 05:46:22,141 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:46:22,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-29 05:46:22,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-29 05:46:22,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-29 05:46:22,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-29 05:46:22,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-29 05:46:22,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:22,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-29 05:46:22,144 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-29 05:46:22,145 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-29 05:46:22,145 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-29 05:46:22,145 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 140 transitions. [2023-11-29 05:46:22,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-29 05:46:22,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:22,148 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 05:46:22,148 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-29 05:46:22,149 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-11-29 05:46:22,149 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 05:46:22,150 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-29 05:46:22,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:22,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:22,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:46:22,150 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-29 05:46:22,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash 884237190, now seen corresponding path program 1 times [2023-11-29 05:46:22,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:22,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301412003] [2023-11-29 05:46:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:22,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:22,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301412003] [2023-11-29 05:46:22,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301412003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:22,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:22,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:22,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919630217] [2023-11-29 05:46:22,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:22,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:22,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:22,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:22,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:22,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 05:46:22,234 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-29 05:46:22,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:22,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 05:46:22,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:22,960 INFO L124 PetriNetUnfolderBase]: 2978/5219 cut-off events. [2023-11-29 05:46:22,961 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:46:22,972 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 38007 event pairs, 920 based on Foata normal form. 0/5112 useless extension candidates. Maximal degree in co-relation 9601. Up to 3426 conditions per place. [2023-11-29 05:46:22,986 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 05:46:22,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 200 flow [2023-11-29 05:46:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 05:46:22,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-29 05:46:22,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 05:46:22,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 05:46:22,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:22,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 05:46:22,989 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-29 05:46:22,989 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-29 05:46:22,990 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-29 05:46:22,990 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 138 transitions. [2023-11-29 05:46:22,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 200 flow [2023-11-29 05:46:22,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:22,992 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 05:46:22,992 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-29 05:46:22,993 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2023-11-29 05:46:22,993 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 05:46:22,993 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-29 05:46:22,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:22,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:22,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:46:22,994 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-29 05:46:22,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:22,994 INFO L85 PathProgramCache]: Analyzing trace with hash 884237191, now seen corresponding path program 1 times [2023-11-29 05:46:22,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:22,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587277992] [2023-11-29 05:46:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:22,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:23,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:23,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587277992] [2023-11-29 05:46:23,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587277992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:23,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:23,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:23,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806251963] [2023-11-29 05:46:23,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:23,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:23,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:23,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:23,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 05:46:23,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-29 05:46:23,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:23,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 05:46:23,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:23,724 INFO L124 PetriNetUnfolderBase]: 2903/5048 cut-off events. [2023-11-29 05:46:23,724 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 05:46:23,733 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 36252 event pairs, 1400 based on Foata normal form. 36/5001 useless extension candidates. Maximal degree in co-relation 9343. Up to 3315 conditions per place. [2023-11-29 05:46:23,749 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-29 05:46:23,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 196 flow [2023-11-29 05:46:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-29 05:46:23,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-29 05:46:23,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-29 05:46:23,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-29 05:46:23,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:23,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-29 05:46:23,751 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-29 05:46:23,752 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-29 05:46:23,752 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-29 05:46:23,752 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 140 transitions. [2023-11-29 05:46:23,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 196 flow [2023-11-29 05:46:23,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:23,755 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 108 flow [2023-11-29 05:46:23,755 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-29 05:46:23,756 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-11-29 05:46:23,756 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 108 flow [2023-11-29 05:46:23,757 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-29 05:46:23,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:23,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] [2023-11-29 05:46:23,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:46:23,757 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-29 05:46:23,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1460147544, now seen corresponding path program 1 times [2023-11-29 05:46:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464703387] [2023-11-29 05:46:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:24,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464703387] [2023-11-29 05:46:24,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464703387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:24,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:24,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:46:24,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062879524] [2023-11-29 05:46:24,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:24,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:46:24,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:46:24,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:46:24,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 65 [2023-11-29 05:46:24,660 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-29 05:46:24,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:24,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 65 [2023-11-29 05:46:24,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:25,495 INFO L124 PetriNetUnfolderBase]: 2920/4973 cut-off events. [2023-11-29 05:46:25,495 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 05:46:25,506 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 35026 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-29 05:46:25,520 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 36 selfloop transitions, 4 changer transitions 11/72 dead transitions. [2023-11-29 05:46:25,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 258 flow [2023-11-29 05:46:25,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:46:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:46:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 262 transitions. [2023-11-29 05:46:25,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5758241758241758 [2023-11-29 05:46:25,523 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 262 transitions. [2023-11-29 05:46:25,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 262 transitions. [2023-11-29 05:46:25,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:25,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 262 transitions. [2023-11-29 05:46:25,524 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-29 05:46:25,526 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-29 05:46:25,526 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-29 05:46:25,526 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 108 flow. Second operand 7 states and 262 transitions. [2023-11-29 05:46:25,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 258 flow [2023-11-29 05:46:25,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:25,529 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 108 flow [2023-11-29 05:46:25,530 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-29 05:46:25,530 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-29 05:46:25,531 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 108 flow [2023-11-29 05:46:25,531 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-29 05:46:25,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:25,531 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-29 05:46:25,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:46:25,532 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-29 05:46:25,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1460146171, now seen corresponding path program 1 times [2023-11-29 05:46:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:25,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366782796] [2023-11-29 05:46:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:25,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366782796] [2023-11-29 05:46:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366782796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:25,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:25,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:46:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581920363] [2023-11-29 05:46:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:25,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:46:25,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:25,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:46:25,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:46:25,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 05:46:25,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 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-29 05:46:25,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:25,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 05:46:25,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:26,826 INFO L124 PetriNetUnfolderBase]: 8875/13637 cut-off events. [2023-11-29 05:46:26,826 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 05:46:26,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26064 conditions, 13637 events. 8875/13637 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 95880 event pairs, 1033 based on Foata normal form. 400/13952 useless extension candidates. Maximal degree in co-relation 26053. Up to 7301 conditions per place. [2023-11-29 05:46:26,883 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 53 selfloop transitions, 6 changer transitions 1/78 dead transitions. [2023-11-29 05:46:26,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 304 flow [2023-11-29 05:46:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:46:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:46:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2023-11-29 05:46:26,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7153846153846154 [2023-11-29 05:46:26,885 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 186 transitions. [2023-11-29 05:46:26,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 186 transitions. [2023-11-29 05:46:26,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:26,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 186 transitions. [2023-11-29 05:46:26,886 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-29 05:46:26,887 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-29 05:46:26,888 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-29 05:46:26,888 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 108 flow. Second operand 4 states and 186 transitions. [2023-11-29 05:46:26,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 304 flow [2023-11-29 05:46:26,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:46:26,890 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 143 flow [2023-11-29 05:46:26,890 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 05:46:26,891 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-11-29 05:46:26,891 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 143 flow [2023-11-29 05:46:26,891 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-29 05:46:26,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:26,891 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-29 05:46:26,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:46:26,892 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-29 05:46:26,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash 394265684, now seen corresponding path program 1 times [2023-11-29 05:46:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:26,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672505744] [2023-11-29 05:46:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:27,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:27,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672505744] [2023-11-29 05:46:27,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672505744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:27,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:27,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:46:27,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740679769] [2023-11-29 05:46:27,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:27,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:46:27,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:27,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:46:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:27,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 05:46:27,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 143 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-29 05:46:27,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:27,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 05:46:27,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:28,051 INFO L124 PetriNetUnfolderBase]: 6751/10397 cut-off events. [2023-11-29 05:46:28,051 INFO L125 PetriNetUnfolderBase]: For 2392/2392 co-relation queries the response was YES. [2023-11-29 05:46:28,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23333 conditions, 10397 events. 6751/10397 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 69175 event pairs, 451 based on Foata normal form. 364/10681 useless extension candidates. Maximal degree in co-relation 23320. Up to 4601 conditions per place. [2023-11-29 05:46:28,108 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 68 selfloop transitions, 10 changer transitions 1/97 dead transitions. [2023-11-29 05:46:28,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 97 transitions, 426 flow [2023-11-29 05:46:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:46:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:46:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2023-11-29 05:46:28,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7261538461538461 [2023-11-29 05:46:28,110 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 236 transitions. [2023-11-29 05:46:28,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 236 transitions. [2023-11-29 05:46:28,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:28,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 236 transitions. [2023-11-29 05:46:28,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:28,113 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-29 05:46:28,113 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-29 05:46:28,114 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 143 flow. Second operand 5 states and 236 transitions. [2023-11-29 05:46:28,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 97 transitions, 426 flow [2023-11-29 05:46:28,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 415 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:28,119 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 195 flow [2023-11-29 05:46:28,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-29 05:46:28,120 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2023-11-29 05:46:28,120 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 195 flow [2023-11-29 05:46:28,120 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-29 05:46:28,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:28,121 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-29 05:46:28,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:46:28,121 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-29 05:46:28,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:28,121 INFO L85 PathProgramCache]: Analyzing trace with hash -891220564, now seen corresponding path program 1 times [2023-11-29 05:46:28,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:28,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299330710] [2023-11-29 05:46:28,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:28,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299330710] [2023-11-29 05:46:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299330710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:28,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:28,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:46:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901929781] [2023-11-29 05:46:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:28,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:46:28,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:46:28,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:46:28,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 05:46:28,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 195 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-29 05:46:28,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:28,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 05:46:28,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:29,283 INFO L124 PetriNetUnfolderBase]: 4259/6453 cut-off events. [2023-11-29 05:46:29,283 INFO L125 PetriNetUnfolderBase]: For 4590/4590 co-relation queries the response was YES. [2023-11-29 05:46:29,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16375 conditions, 6453 events. 4259/6453 cut-off events. For 4590/4590 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 37738 event pairs, 289 based on Foata normal form. 244/6617 useless extension candidates. Maximal degree in co-relation 16360. Up to 1788 conditions per place. [2023-11-29 05:46:29,315 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 81 selfloop transitions, 14 changer transitions 1/114 dead transitions. [2023-11-29 05:46:29,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 114 transitions, 558 flow [2023-11-29 05:46:29,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:46:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:46:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 284 transitions. [2023-11-29 05:46:29,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7282051282051282 [2023-11-29 05:46:29,318 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 284 transitions. [2023-11-29 05:46:29,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 284 transitions. [2023-11-29 05:46:29,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:29,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 284 transitions. [2023-11-29 05:46:29,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:29,320 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-29 05:46:29,320 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-29 05:46:29,321 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 195 flow. Second operand 6 states and 284 transitions. [2023-11-29 05:46:29,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 114 transitions, 558 flow [2023-11-29 05:46:29,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 114 transitions, 528 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 05:46:29,350 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 245 flow [2023-11-29 05:46:29,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-11-29 05:46:29,351 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-29 05:46:29,351 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 245 flow [2023-11-29 05:46:29,351 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-29 05:46:29,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:29,352 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-29 05:46:29,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:46:29,352 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-29 05:46:29,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:29,352 INFO L85 PathProgramCache]: Analyzing trace with hash 667275226, now seen corresponding path program 1 times [2023-11-29 05:46:29,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:29,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396373992] [2023-11-29 05:46:29,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:29,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:29,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:29,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396373992] [2023-11-29 05:46:29,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396373992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:29,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:46:29,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915572371] [2023-11-29 05:46:29,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:29,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:46:29,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:29,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:46:29,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:46:29,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 05:46:29,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 245 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-29 05:46:29,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:29,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 05:46:29,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:30,254 INFO L124 PetriNetUnfolderBase]: 2895/4221 cut-off events. [2023-11-29 05:46:30,254 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2023-11-29 05:46:30,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11776 conditions, 4221 events. 2895/4221 cut-off events. For 4826/4826 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22100 event pairs, 231 based on Foata normal form. 96/4237 useless extension candidates. Maximal degree in co-relation 11760. Up to 1316 conditions per place. [2023-11-29 05:46:30,271 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 72 selfloop transitions, 18 changer transitions 1/109 dead transitions. [2023-11-29 05:46:30,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 109 transitions, 548 flow [2023-11-29 05:46:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:46:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:46:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 310 transitions. [2023-11-29 05:46:30,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6813186813186813 [2023-11-29 05:46:30,273 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 310 transitions. [2023-11-29 05:46:30,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 310 transitions. [2023-11-29 05:46:30,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:30,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 310 transitions. [2023-11-29 05:46:30,274 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-29 05:46:30,275 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-29 05:46:30,275 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-29 05:46:30,276 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 245 flow. Second operand 7 states and 310 transitions. [2023-11-29 05:46:30,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 109 transitions, 548 flow [2023-11-29 05:46:30,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 109 transitions, 502 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 05:46:30,307 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 255 flow [2023-11-29 05:46:30,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2023-11-29 05:46:30,308 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2023-11-29 05:46:30,308 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 255 flow [2023-11-29 05:46:30,308 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-29 05:46:30,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:30,308 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-29 05:46:30,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:46:30,308 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-29 05:46:30,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1856061798, now seen corresponding path program 1 times [2023-11-29 05:46:30,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:30,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722057865] [2023-11-29 05:46:30,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:31,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722057865] [2023-11-29 05:46:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722057865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:31,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:31,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:46:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372288249] [2023-11-29 05:46:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:31,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:46:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:46:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:46:31,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 05:46:31,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 255 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-29 05:46:31,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:31,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 05:46:31,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:32,181 INFO L124 PetriNetUnfolderBase]: 2125/3553 cut-off events. [2023-11-29 05:46:32,182 INFO L125 PetriNetUnfolderBase]: For 2120/2292 co-relation queries the response was YES. [2023-11-29 05:46:32,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8451 conditions, 3553 events. 2125/3553 cut-off events. For 2120/2292 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 22447 event pairs, 419 based on Foata normal form. 16/3343 useless extension candidates. Maximal degree in co-relation 8434. Up to 1087 conditions per place. [2023-11-29 05:46:32,205 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 56 selfloop transitions, 5 changer transitions 16/111 dead transitions. [2023-11-29 05:46:32,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 111 transitions, 539 flow [2023-11-29 05:46:32,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:46:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:46:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 393 transitions. [2023-11-29 05:46:32,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2023-11-29 05:46:32,209 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 393 transitions. [2023-11-29 05:46:32,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 393 transitions. [2023-11-29 05:46:32,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:32,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 393 transitions. [2023-11-29 05:46:32,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 43.666666666666664) internal successors, (393), 9 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:32,213 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-29 05:46:32,213 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-29 05:46:32,213 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 255 flow. Second operand 9 states and 393 transitions. [2023-11-29 05:46:32,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 111 transitions, 539 flow [2023-11-29 05:46:32,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 111 transitions, 433 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-29 05:46:32,242 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 182 flow [2023-11-29 05:46:32,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=182, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2023-11-29 05:46:32,243 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 1 predicate places. [2023-11-29 05:46:32,243 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 182 flow [2023-11-29 05:46:32,243 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-29 05:46:32,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:32,244 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-29 05:46:32,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:46:32,244 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-29 05:46:32,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:32,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1290587772, now seen corresponding path program 2 times [2023-11-29 05:46:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:32,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52651220] [2023-11-29 05:46:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:32,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:32,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52651220] [2023-11-29 05:46:32,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52651220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:32,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:32,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:46:32,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146922860] [2023-11-29 05:46:32,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:32,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:46:32,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:32,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:46:32,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:32,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 05:46:32,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:32,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:32,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 05:46:32,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:33,818 INFO L124 PetriNetUnfolderBase]: 6699/10689 cut-off events. [2023-11-29 05:46:33,818 INFO L125 PetriNetUnfolderBase]: For 1802/1802 co-relation queries the response was YES. [2023-11-29 05:46:33,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23115 conditions, 10689 events. 6699/10689 cut-off events. For 1802/1802 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 72207 event pairs, 2812 based on Foata normal form. 16/10237 useless extension candidates. Maximal degree in co-relation 23099. Up to 6238 conditions per place. [2023-11-29 05:46:33,877 INFO L140 encePairwiseOnDemand]: 56/65 looper letters, 41 selfloop transitions, 7 changer transitions 13/91 dead transitions. [2023-11-29 05:46:33,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 390 flow [2023-11-29 05:46:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:46:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:46:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2023-11-29 05:46:33,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2023-11-29 05:46:33,879 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 215 transitions. [2023-11-29 05:46:33,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 215 transitions. [2023-11-29 05:46:33,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:33,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 215 transitions. [2023-11-29 05:46:33,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:33,882 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-29 05:46:33,882 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-29 05:46:33,882 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 182 flow. Second operand 5 states and 215 transitions. [2023-11-29 05:46:33,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 390 flow [2023-11-29 05:46:33,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 370 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-29 05:46:33,903 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 226 flow [2023-11-29 05:46:33,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2023-11-29 05:46:33,904 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2023-11-29 05:46:33,904 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 226 flow [2023-11-29 05:46:33,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:33,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:33,905 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-29 05:46:33,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:46:33,905 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-29 05:46:33,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:33,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1352055234, now seen corresponding path program 3 times [2023-11-29 05:46:33,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:33,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031609471] [2023-11-29 05:46:33,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:46:33,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:46:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:46:34,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:46:34,038 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:46:34,039 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:46:34,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:46:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:46:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:46:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:46:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:46:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:46:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:46:34,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:46:34,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:46:34,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:46:34,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:46:34,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:46:34,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:46:34,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:46:34,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:46:34,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:46:34,043 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:34,049 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:46:34,050 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:46:34,115 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:46:34,119 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:46:34,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:46:34,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:46:34,135 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:46:34,136 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:46:34,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:46:34 BasicIcfg [2023-11-29 05:46:34,150 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:46:34,151 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:46:34,151 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:46:34,151 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:46:34,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:14" (3/4) ... [2023-11-29 05:46:34,153 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:46:34,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:46:34,154 INFO L158 Benchmark]: Toolchain (without parser) took 21323.14ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 121.3MB in the beginning and 1.0GB in the end (delta: -890.3MB). Peak memory consumption was 581.2MB. Max. memory is 16.1GB. [2023-11-29 05:46:34,155 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 113.2MB. Free memory was 87.4MB in the beginning and 87.4MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:46:34,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.73ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 97.1MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 05:46:34,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.02ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 94.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:46:34,156 INFO L158 Benchmark]: Boogie Preprocessor took 84.02ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 136.9MB in the end (delta: -42.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-11-29 05:46:34,156 INFO L158 Benchmark]: RCFGBuilder took 700.71ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 81.3MB in the end (delta: 55.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2023-11-29 05:46:34,157 INFO L158 Benchmark]: TraceAbstraction took 19971.50ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 80.5MB in the beginning and 1.0GB in the end (delta: -932.2MB). Peak memory consumption was 537.7MB. Max. memory is 16.1GB. [2023-11-29 05:46:34,157 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:46:34,159 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.21ms. Allocated memory is still 113.2MB. Free memory was 87.4MB in the beginning and 87.4MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.73ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 97.1MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.02ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 94.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.02ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 136.9MB in the end (delta: -42.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * RCFGBuilder took 700.71ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 81.3MB in the end (delta: 55.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19971.50ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 80.5MB in the beginning and 1.0GB in the end (delta: -932.2MB). Peak memory consumption was 537.7MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L863] 0 pthread_t t1354; [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=0, z=0] [L865] 0 pthread_t t1355; [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z=0] [L786] 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) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 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 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 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_p1_EAX=0, __unbuffered_p2_EAX=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=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L806] 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) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 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 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 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_p1_EAX=0, __unbuffered_p2_EAX=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] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 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) [L828] 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)) [L829] 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)) [L830] 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)) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=1] [L766] 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) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 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 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 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_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=1] [L839] 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) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 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 [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 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_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 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) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 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 [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 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_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L883] 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_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 866]: 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: 19.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 971 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 798 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2054 IncrementalHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 41 mSDtfsCounter, 2054 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=14, InterpolantAutomatonStates: 70, 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.1s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 1765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 05:46:34,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:46:36,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:46:36,419 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 05:46:36,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:46:36,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:46:36,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:46:36,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:46:36,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:46:36,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:46:36,466 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:46:36,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:46:36,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:46:36,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:46:36,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:46:36,470 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:46:36,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:46:36,471 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:46:36,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:46:36,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:46:36,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:46:36,473 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:46:36,473 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:46:36,474 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:46:36,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:46:36,475 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:46:36,475 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:46:36,476 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:46:36,476 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:46:36,477 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:46:36,477 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:46:36,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:46:36,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:46:36,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:46:36,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:46:36,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:46:36,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:46:36,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:46:36,480 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:46:36,480 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:46:36,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:46:36,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:46:36,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:46:36,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:46:36,481 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:46:36,481 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2023-11-29 05:46:36,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:46:36,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:46:36,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:46:36,823 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:46:36,824 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:46:36,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-29 05:46:39,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:46:39,971 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:46:39,972 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-29 05:46:39,989 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/data/f6399b428/720a9e367e714b7aa3c07d4c9fb0242b/FLAG838823221 [2023-11-29 05:46:40,002 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/data/f6399b428/720a9e367e714b7aa3c07d4c9fb0242b [2023-11-29 05:46:40,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:46:40,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:46:40,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:46:40,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:46:40,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:46:40,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc88785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40, skipping insertion in model container [2023-11-29 05:46:40,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,063 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:46:40,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:46:40,444 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:46:40,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:46:40,538 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:46:40,538 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:46:40,544 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:46:40,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40 WrapperNode [2023-11-29 05:46:40,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:46:40,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:46:40,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:46:40,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:46:40,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,602 INFO L138 Inliner]: procedures = 180, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-29 05:46:40,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:46:40,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:46:40,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:46:40,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:46:40,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,640 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-29 05:46:40,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:46:40,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:46:40,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:46:40,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:46:40,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (1/1) ... [2023-11-29 05:46:40,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:46:40,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:46:40,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:46:40,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:46:40,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:46:40,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:46:40,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:46:40,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:46:40,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:46:40,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:46:40,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:46:40,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 05:46:40,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 05:46:40,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:46:40,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:46:40,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:46:40,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 05:46:40,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 05:46:40,745 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:46:40,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:46:40,745 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:46:40,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:46:40,746 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:46:40,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:46:40,746 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:46:40,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:46:40,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:46:40,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:46:40,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:46:40,748 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:46:40,945 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:46:40,947 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:46:41,396 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:46:41,660 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:46:41,660 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:46:41,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:41 BoogieIcfgContainer [2023-11-29 05:46:41,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:46:41,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:46:41,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:46:41,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:46:41,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:46:40" (1/3) ... [2023-11-29 05:46:41,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295545c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:46:41, skipping insertion in model container [2023-11-29 05:46:41,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:40" (2/3) ... [2023-11-29 05:46:41,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295545c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:46:41, skipping insertion in model container [2023-11-29 05:46:41,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:41" (3/3) ... [2023-11-29 05:46:41,669 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-29 05:46:41,689 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:46:41,689 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:46:41,689 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:46:41,774 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:46:41,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 146 flow [2023-11-29 05:46:41,847 INFO L124 PetriNetUnfolderBase]: 2/61 cut-off events. [2023-11-29 05:46:41,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:46:41,852 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 121 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-29 05:46:41,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 65 transitions, 146 flow [2023-11-29 05:46:41,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 134 flow [2023-11-29 05:46:41,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:46:41,875 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;@35115a59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:46:41,876 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:46:41,879 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:46:41,880 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:46:41,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:46:41,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:41,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:46:41,882 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-29 05:46:41,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash 14079, now seen corresponding path program 1 times [2023-11-29 05:46:41,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:41,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595416925] [2023-11-29 05:46:41,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:41,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:41,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:41,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:41,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:46:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:42,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:46:42,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:42,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:46:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:42,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:42,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:42,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595416925] [2023-11-29 05:46:42,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595416925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:42,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:42,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:46:42,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590733959] [2023-11-29 05:46:42,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:42,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:42,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:42,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:42,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:42,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 05:46:42,257 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-29 05:46:42,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:42,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 05:46:42,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:43,815 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-29 05:46:43,816 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 05:46:43,842 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 55038 event pairs, 3179 based on Foata normal form. 360/7062 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-29 05:46:43,904 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 05:46:43,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 224 flow [2023-11-29 05:46:43,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 05:46:43,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 05:46:43,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 05:46:43,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 05:46:43,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:43,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 05:46:43,925 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-29 05:46:43,929 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-29 05:46:43,930 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-29 05:46:43,932 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 134 flow. Second operand 3 states and 143 transitions. [2023-11-29 05:46:43,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 224 flow [2023-11-29 05:46:43,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:46:43,942 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:46:43,944 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-29 05:46:43,948 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-29 05:46:43,949 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:46:43,949 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-29 05:46:43,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:43,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:46:43,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:46:44,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:44,152 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-29 05:46:44,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash 14080, now seen corresponding path program 1 times [2023-11-29 05:46:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:44,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865219065] [2023-11-29 05:46:44,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:44,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:44,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:44,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:44,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:46:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:44,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:46:44,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:44,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:46:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:44,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:44,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865219065] [2023-11-29 05:46:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865219065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:44,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:44,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:46:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792820072] [2023-11-29 05:46:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:44,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:44,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:44,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:44,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:44,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 05:46:44,400 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-29 05:46:44,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:44,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 05:46:44,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:45,663 INFO L124 PetriNetUnfolderBase]: 4217/7282 cut-off events. [2023-11-29 05:46:45,664 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 05:46:45,687 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 55037 event pairs, 3179 based on Foata normal form. 1/6702 useless extension candidates. Maximal degree in co-relation 13375. Up to 4390 conditions per place. [2023-11-29 05:46:45,741 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 05:46:45,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-29 05:46:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 05:46:45,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 05:46:45,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 05:46:45,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 05:46:45,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:45,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 05:46:45,747 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-29 05:46:45,749 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-29 05:46:45,749 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-29 05:46:45,749 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 143 transitions. [2023-11-29 05:46:45,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-29 05:46:45,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:45,770 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 05:46:45,770 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-29 05:46:45,771 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2023-11-29 05:46:45,771 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 05:46:45,771 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-29 05:46:45,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:45,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:46:45,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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)] Ended with exit code 0 [2023-11-29 05:46:45,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:45,973 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-29 05:46:45,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash 419866364, now seen corresponding path program 1 times [2023-11-29 05:46:45,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:45,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291741590] [2023-11-29 05:46:45,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:45,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:45,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:45,976 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:45,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 05:46:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:46,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:46:46,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:46,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-29 05:46:46,079 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:46,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291741590] [2023-11-29 05:46:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291741590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:46,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:46,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:46:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084858047] [2023-11-29 05:46:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:46,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:46,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:46,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:46,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2023-11-29 05:46:46,083 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-29 05:46:46,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:46,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2023-11-29 05:46:46,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:46,921 INFO L124 PetriNetUnfolderBase]: 3311/5496 cut-off events. [2023-11-29 05:46:46,922 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-29 05:46:46,934 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 39814 event pairs, 593 based on Foata normal form. 0/5439 useless extension candidates. Maximal degree in co-relation 10307. Up to 3661 conditions per place. [2023-11-29 05:46:46,957 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-29 05:46:46,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 260 flow [2023-11-29 05:46:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-29 05:46:46,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7897435897435897 [2023-11-29 05:46:46,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-29 05:46:46,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-29 05:46:46,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:46,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-29 05:46:46,961 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-29 05:46:46,962 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-29 05:46:46,963 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-29 05:46:46,964 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 154 transitions. [2023-11-29 05:46:46,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 260 flow [2023-11-29 05:46:46,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:46,968 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-29 05:46:46,968 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-29 05:46:46,969 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-29 05:46:46,969 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-29 05:46:46,970 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-29 05:46:46,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:46,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:46:46,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 05:46:47,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:47,171 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-29 05:46:47,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:47,171 INFO L85 PathProgramCache]: Analyzing trace with hash 419864727, now seen corresponding path program 1 times [2023-11-29 05:46:47,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:47,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692201531] [2023-11-29 05:46:47,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:47,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:47,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:47,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:47,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 05:46:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:47,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:46:47,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:47,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:46:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:47,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:47,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692201531] [2023-11-29 05:46:47,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692201531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:47,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204807047] [2023-11-29 05:46:47,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:47,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:47,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:47,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:47,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:47,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 05:46:47,304 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-29 05:46:47,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:47,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 05:46:47,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:48,087 INFO L124 PetriNetUnfolderBase]: 2906/5170 cut-off events. [2023-11-29 05:46:48,087 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-29 05:46:48,108 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 38399 event pairs, 2290 based on Foata normal form. 0/4967 useless extension candidates. Maximal degree in co-relation 9571. Up to 3466 conditions per place. [2023-11-29 05:46:48,135 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 05:46:48,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 210 flow [2023-11-29 05:46:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 05:46:48,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-29 05:46:48,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 05:46:48,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 05:46:48,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:48,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 05:46:48,139 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-29 05:46:48,140 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-29 05:46:48,141 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-29 05:46:48,141 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 138 transitions. [2023-11-29 05:46:48,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 210 flow [2023-11-29 05:46:48,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:48,144 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 05:46:48,144 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-29 05:46:48,145 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-11-29 05:46:48,145 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 05:46:48,145 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-29 05:46:48,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:48,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:46:48,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 05:46:48,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:48,347 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-29 05:46:48,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:48,347 INFO L85 PathProgramCache]: Analyzing trace with hash 419864728, now seen corresponding path program 1 times [2023-11-29 05:46:48,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:48,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388490649] [2023-11-29 05:46:48,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:48,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:48,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:48,349 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:48,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 05:46:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:48,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:46:48,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:48,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:46:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:48,464 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:48,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:48,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388490649] [2023-11-29 05:46:48,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388490649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:48,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:48,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:48,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931911537] [2023-11-29 05:46:48,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:48,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:48,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:48,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:48,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:48,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 05:46:48,503 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-29 05:46:48,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:48,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 05:46:48,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:49,086 INFO L124 PetriNetUnfolderBase]: 2903/5162 cut-off events. [2023-11-29 05:46:49,086 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 05:46:49,096 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 38275 event pairs, 2288 based on Foata normal form. 4/4963 useless extension candidates. Maximal degree in co-relation 9425. Up to 3459 conditions per place. [2023-11-29 05:46:49,112 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 05:46:49,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-29 05:46:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-29 05:46:49,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-29 05:46:49,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-29 05:46:49,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-29 05:46:49,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:49,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-29 05:46:49,114 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-29 05:46:49,115 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-29 05:46:49,116 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-29 05:46:49,116 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 140 transitions. [2023-11-29 05:46:49,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-29 05:46:49,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:49,122 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 05:46:49,123 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-29 05:46:49,123 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-11-29 05:46:49,124 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 05:46:49,124 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-29 05:46:49,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:49,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:49,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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)] Ended with exit code 0 [2023-11-29 05:46:49,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:49,327 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-29 05:46:49,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:49,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1245750444, now seen corresponding path program 1 times [2023-11-29 05:46:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:49,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614836863] [2023-11-29 05:46:49,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:49,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:49,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:49,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:49,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 05:46:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:49,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:46:49,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:49,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:46:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:49,418 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:49,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:49,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614836863] [2023-11-29 05:46:49,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614836863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:49,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:49,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:49,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550069099] [2023-11-29 05:46:49,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:49,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:49,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:49,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:49,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:49,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 05:46:49,450 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-29 05:46:49,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:49,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 05:46:49,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:50,106 INFO L124 PetriNetUnfolderBase]: 2920/5209 cut-off events. [2023-11-29 05:46:50,106 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 05:46:50,116 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 38588 event pairs, 1356 based on Foata normal form. 0/5031 useless extension candidates. Maximal degree in co-relation 9501. Up to 3460 conditions per place. [2023-11-29 05:46:50,134 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:46:50,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-29 05:46:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 05:46:50,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-29 05:46:50,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 05:46:50,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 05:46:50,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:50,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 05:46:50,137 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-29 05:46:50,137 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-29 05:46:50,138 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-29 05:46:50,138 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 138 transitions. [2023-11-29 05:46:50,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-29 05:46:50,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:50,142 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 05:46:50,142 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-29 05:46:50,143 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-29 05:46:50,143 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 05:46:50,144 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-29 05:46:50,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:50,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:50,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 05:46:50,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:50,345 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-29 05:46:50,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1245750445, now seen corresponding path program 1 times [2023-11-29 05:46:50,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:50,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380574060] [2023-11-29 05:46:50,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:50,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:50,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:50,347 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:50,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 05:46:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:50,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:46:50,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:50,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:46:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:50,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:50,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:50,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380574060] [2023-11-29 05:46:50,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380574060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:50,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:50,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:50,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139411076] [2023-11-29 05:46:50,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:50,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:50,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:50,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:50,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:50,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 05:46:50,512 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-29 05:46:50,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:50,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 05:46:50,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:51,192 INFO L124 PetriNetUnfolderBase]: 2903/5128 cut-off events. [2023-11-29 05:46:51,192 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:46:51,204 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 37786 event pairs, 1884 based on Foata normal form. 12/4966 useless extension candidates. Maximal degree in co-relation 9399. Up to 3431 conditions per place. [2023-11-29 05:46:51,221 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:46:51,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-29 05:46:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-29 05:46:51,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-29 05:46:51,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-29 05:46:51,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-29 05:46:51,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:51,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-29 05:46:51,224 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-29 05:46:51,224 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-29 05:46:51,224 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-29 05:46:51,224 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 140 transitions. [2023-11-29 05:46:51,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-29 05:46:51,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:51,227 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 05:46:51,228 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-29 05:46:51,228 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-11-29 05:46:51,228 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 05:46:51,229 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-29 05:46:51,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:51,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:51,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 05:46:51,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:51,429 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:46:51,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash -660495613, now seen corresponding path program 1 times [2023-11-29 05:46:51,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:51,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270247644] [2023-11-29 05:46:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:51,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:51,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:51,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:51,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 05:46:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:51,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:46:51,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:51,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:46:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:51,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:51,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:51,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270247644] [2023-11-29 05:46:51,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270247644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:51,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:51,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:51,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320780317] [2023-11-29 05:46:51,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:51,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:51,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:51,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:51,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:51,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 05:46:51,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 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-29 05:46:51,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:51,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 05:46:51,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:52,170 INFO L124 PetriNetUnfolderBase]: 2903/5144 cut-off events. [2023-11-29 05:46:52,171 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:46:52,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9425 conditions, 5144 events. 2903/5144 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37841 event pairs, 920 based on Foata normal form. 36/5058 useless extension candidates. Maximal degree in co-relation 9415. Up to 3315 conditions per place. [2023-11-29 05:46:52,198 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 05:46:52,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 198 flow [2023-11-29 05:46:52,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-29 05:46:52,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-29 05:46:52,200 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-29 05:46:52,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-29 05:46:52,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:52,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-29 05:46:52,201 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-29 05:46:52,201 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-29 05:46:52,201 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-29 05:46:52,201 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 140 transitions. [2023-11-29 05:46:52,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 198 flow [2023-11-29 05:46:52,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:52,204 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 05:46:52,204 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-29 05:46:52,204 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2023-11-29 05:46:52,204 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 05:46:52,205 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-29 05:46:52,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:52,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:52,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 05:46:52,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:52,408 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:46:52,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash -660495614, now seen corresponding path program 1 times [2023-11-29 05:46:52,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:52,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981191788] [2023-11-29 05:46:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:52,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:52,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:52,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:52,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 05:46:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:52,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:46:52,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:52,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:46:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:52,529 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:52,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:52,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981191788] [2023-11-29 05:46:52,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981191788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:52,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:52,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:52,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992949434] [2023-11-29 05:46:52,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:52,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:52,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:52,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:52,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:52,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 05:46:52,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 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-29 05:46:52,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:52,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 05:46:52,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:53,097 INFO L124 PetriNetUnfolderBase]: 2978/5183 cut-off events. [2023-11-29 05:46:53,097 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 05:46:53,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9599 conditions, 5183 events. 2978/5183 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37709 event pairs, 920 based on Foata normal form. 0/5085 useless extension candidates. Maximal degree in co-relation 9589. Up to 3426 conditions per place. [2023-11-29 05:46:53,118 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-29 05:46:53,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 198 flow [2023-11-29 05:46:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 05:46:53,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-29 05:46:53,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 05:46:53,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 05:46:53,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:53,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 05:46:53,120 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-29 05:46:53,120 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-29 05:46:53,121 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-29 05:46:53,121 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 138 transitions. [2023-11-29 05:46:53,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 198 flow [2023-11-29 05:46:53,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:53,122 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 108 flow [2023-11-29 05:46:53,123 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-29 05:46:53,123 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-11-29 05:46:53,123 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 108 flow [2023-11-29 05:46:53,123 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-29 05:46:53,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:53,123 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-29 05:46:53,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 05:46:53,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:53,324 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-29 05:46:53,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1506983262, now seen corresponding path program 1 times [2023-11-29 05:46:53,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:53,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694031003] [2023-11-29 05:46:53,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:53,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:53,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:53,326 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:53,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 05:46:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:53,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:46:53,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:53,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:53,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:53,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694031003] [2023-11-29 05:46:53,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694031003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:53,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:53,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:46:53,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74152354] [2023-11-29 05:46:53,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:53,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:46:53,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:53,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:46:53,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:46:53,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 05:46:53,516 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-29 05:46:53,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:53,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 05:46:53,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:54,852 INFO L124 PetriNetUnfolderBase]: 9971/15461 cut-off events. [2023-11-29 05:46:54,853 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-29 05:46:54,883 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 111726 event pairs, 1033 based on Foata normal form. 400/15783 useless extension candidates. Maximal degree in co-relation 29676. Up to 8761 conditions per place. [2023-11-29 05:46:54,923 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 54 selfloop transitions, 6 changer transitions 1/80 dead transitions. [2023-11-29 05:46:54,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 302 flow [2023-11-29 05:46:54,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:46:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:46:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2023-11-29 05:46:54,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7192307692307692 [2023-11-29 05:46:54,925 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 187 transitions. [2023-11-29 05:46:54,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 187 transitions. [2023-11-29 05:46:54,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:54,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 187 transitions. [2023-11-29 05:46:54,925 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-29 05:46:54,926 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-29 05:46:54,926 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-29 05:46:54,926 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 108 flow. Second operand 4 states and 187 transitions. [2023-11-29 05:46:54,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 302 flow [2023-11-29 05:46:54,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:54,934 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 146 flow [2023-11-29 05:46:54,934 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-29 05:46:54,934 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-29 05:46:54,935 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 146 flow [2023-11-29 05:46:54,935 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-29 05:46:54,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:54,935 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-29 05:46:54,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 05:46:55,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:55,136 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-29 05:46:55,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2110871617, now seen corresponding path program 1 times [2023-11-29 05:46:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775101862] [2023-11-29 05:46:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:55,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:55,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:55,137 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:55,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 05:46:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:55,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:46:55,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:55,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:55,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:55,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775101862] [2023-11-29 05:46:55,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775101862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:55,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:55,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:46:55,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87880559] [2023-11-29 05:46:55,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:55,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:46:55,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:55,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:46:55,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:55,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 05:46:55,299 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-29 05:46:55,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:55,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 05:46:55,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:56,308 INFO L124 PetriNetUnfolderBase]: 7427/11561 cut-off events. [2023-11-29 05:46:56,309 INFO L125 PetriNetUnfolderBase]: For 2544/2544 co-relation queries the response was YES. [2023-11-29 05:46:56,327 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 79199 event pairs, 451 based on Foata normal form. 364/11853 useless extension candidates. Maximal degree in co-relation 25476. Up to 5521 conditions per place. [2023-11-29 05:46:56,353 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 69 selfloop transitions, 10 changer transitions 1/99 dead transitions. [2023-11-29 05:46:56,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 429 flow [2023-11-29 05:46:56,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:46:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:46:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2023-11-29 05:46:56,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7292307692307692 [2023-11-29 05:46:56,355 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 237 transitions. [2023-11-29 05:46:56,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 237 transitions. [2023-11-29 05:46:56,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:56,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 237 transitions. [2023-11-29 05:46:56,356 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-29 05:46:56,356 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-29 05:46:56,356 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-29 05:46:56,356 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 146 flow. Second operand 5 states and 237 transitions. [2023-11-29 05:46:56,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 429 flow [2023-11-29 05:46:56,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 418 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:46:56,360 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 198 flow [2023-11-29 05:46:56,360 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-29 05:46:56,361 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-29 05:46:56,361 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 198 flow [2023-11-29 05:46:56,361 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-29 05:46:56,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:56,361 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-29 05:46:56,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:46:56,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:56,562 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-29 05:46:56,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:56,562 INFO L85 PathProgramCache]: Analyzing trace with hash -476375031, now seen corresponding path program 1 times [2023-11-29 05:46:56,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:56,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546482467] [2023-11-29 05:46:56,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:56,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:56,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:56,564 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:56,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 05:46:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:56,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:46:56,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:56,742 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:56,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546482467] [2023-11-29 05:46:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546482467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:56,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:46:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020681502] [2023-11-29 05:46:56,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:56,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:46:56,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:56,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:46:56,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:46:56,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 05:46:56,753 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-29 05:46:56,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:56,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 05:46:56,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:57,716 INFO L124 PetriNetUnfolderBase]: 4491/6877 cut-off events. [2023-11-29 05:46:57,716 INFO L125 PetriNetUnfolderBase]: For 4686/4686 co-relation queries the response was YES. [2023-11-29 05:46:57,731 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 40893 event pairs, 289 based on Foata normal form. 244/7049 useless extension candidates. Maximal degree in co-relation 17096. Up to 1969 conditions per place. [2023-11-29 05:46:57,752 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 82 selfloop transitions, 14 changer transitions 1/116 dead transitions. [2023-11-29 05:46:57,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 116 transitions, 560 flow [2023-11-29 05:46:57,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:46:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:46:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2023-11-29 05:46:57,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2023-11-29 05:46:57,755 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 285 transitions. [2023-11-29 05:46:57,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 285 transitions. [2023-11-29 05:46:57,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:57,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 285 transitions. [2023-11-29 05:46:57,756 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-29 05:46:57,757 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-29 05:46:57,757 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-29 05:46:57,757 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 198 flow. Second operand 6 states and 285 transitions. [2023-11-29 05:46:57,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 116 transitions, 560 flow [2023-11-29 05:46:57,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 530 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 05:46:57,776 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 248 flow [2023-11-29 05:46:57,777 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-29 05:46:57,777 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2023-11-29 05:46:57,777 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 248 flow [2023-11-29 05:46:57,778 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-29 05:46:57,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:57,778 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-29 05:46:57,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 05:46:57,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:57,979 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-29 05:46:57,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2060324987, now seen corresponding path program 1 times [2023-11-29 05:46:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637510744] [2023-11-29 05:46:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:57,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:57,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:57,981 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:57,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 05:46:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:58,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:46:58,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:58,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-29 05:46:58,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:58,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637510744] [2023-11-29 05:46:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637510744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:58,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:58,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:46:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346657050] [2023-11-29 05:46:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:58,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:46:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:58,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:46:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:46:58,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 05:46:58,216 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-29 05:46:58,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:58,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 05:46:58,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:58,948 INFO L124 PetriNetUnfolderBase]: 2927/4285 cut-off events. [2023-11-29 05:46:58,948 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2023-11-29 05:46:58,958 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 22562 event pairs, 231 based on Foata normal form. 96/4309 useless extension candidates. Maximal degree in co-relation 11792. Up to 1316 conditions per place. [2023-11-29 05:46:58,970 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 73 selfloop transitions, 18 changer transitions 1/111 dead transitions. [2023-11-29 05:46:58,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 111 transitions, 550 flow [2023-11-29 05:46:58,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:46:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:46:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 311 transitions. [2023-11-29 05:46:58,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6835164835164835 [2023-11-29 05:46:58,972 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 311 transitions. [2023-11-29 05:46:58,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 311 transitions. [2023-11-29 05:46:58,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:58,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 311 transitions. [2023-11-29 05:46:58,973 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-29 05:46:58,974 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-29 05:46:58,974 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-29 05:46:58,974 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 248 flow. Second operand 7 states and 311 transitions. [2023-11-29 05:46:58,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 111 transitions, 550 flow [2023-11-29 05:46:59,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 504 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 05:46:59,003 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 258 flow [2023-11-29 05:46:59,004 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-29 05:46:59,004 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2023-11-29 05:46:59,004 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 258 flow [2023-11-29 05:46:59,005 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-29 05:46:59,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:59,005 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-29 05:46:59,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 05:46:59,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:59,205 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-29 05:46:59,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:59,206 INFO L85 PathProgramCache]: Analyzing trace with hash -976741501, now seen corresponding path program 1 times [2023-11-29 05:46:59,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:59,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380761435] [2023-11-29 05:46:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:59,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:59,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:59,207 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:59,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 05:46:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:59,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:46:59,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:00,168 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1354~0#1.base_59| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1353~0#1.base_63| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1356~0#1.base_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1355~0#1.base_51| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1353~0#1.base_63| (_ bv1 1)))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t1354~0#1.base_59| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t1355~0#1.base_51|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1353~0#1.base_63| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1354~0#1.base_59| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1355~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1356~0#1.base_43| (_ bv0 1))) (= (select .cse1 |v_ULTIMATE.start_main_~#t1354~0#1.base_59|) (_ bv0 1)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t1355~0#1.base_51| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1356~0#1.base_43|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1353~0#1.base_63|)))))) is different from true [2023-11-29 05:47:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:00,170 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:47:00,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:47:00,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380761435] [2023-11-29 05:47:00,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380761435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:00,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:00,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:47:00,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33493390] [2023-11-29 05:47:00,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:00,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:47:00,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:47:00,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:47:00,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-29 05:47:00,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 65 [2023-11-29 05:47:00,283 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-29 05:47:00,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:00,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 65 [2023-11-29 05:47:00,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:00,930 INFO L124 PetriNetUnfolderBase]: 1588/2728 cut-off events. [2023-11-29 05:47:00,931 INFO L125 PetriNetUnfolderBase]: For 1080/1165 co-relation queries the response was YES. [2023-11-29 05:47:00,939 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 16469 event pairs, 204 based on Foata normal form. 16/2582 useless extension candidates. Maximal degree in co-relation 6151. Up to 1876 conditions per place. [2023-11-29 05:47:00,947 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 43 selfloop transitions, 9 changer transitions 0/83 dead transitions. [2023-11-29 05:47:00,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 83 transitions, 408 flow [2023-11-29 05:47:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:47:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:47:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2023-11-29 05:47:00,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703296703296703 [2023-11-29 05:47:00,949 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 214 transitions. [2023-11-29 05:47:00,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 214 transitions. [2023-11-29 05:47:00,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:00,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 214 transitions. [2023-11-29 05:47:00,950 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-29 05:47:00,951 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-29 05:47:00,952 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-29 05:47:00,952 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 258 flow. Second operand 7 states and 214 transitions. [2023-11-29 05:47:00,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 83 transitions, 408 flow [2023-11-29 05:47:00,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 83 transitions, 312 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 05:47:00,959 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 203 flow [2023-11-29 05:47:00,960 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-29 05:47:00,960 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2023-11-29 05:47:00,960 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 203 flow [2023-11-29 05:47:00,961 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-29 05:47:00,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:00,961 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-29 05:47:00,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 05:47:01,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:01,161 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-29 05:47:01,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:01,162 INFO L85 PathProgramCache]: Analyzing trace with hash 398972510, now seen corresponding path program 1 times [2023-11-29 05:47:01,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:47:01,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334686912] [2023-11-29 05:47:01,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:01,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:01,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:47:01,164 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:47:01,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 05:47:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:01,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 05:47:01,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:01,884 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:47:01,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:47:01,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334686912] [2023-11-29 05:47:01,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334686912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:01,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:01,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:47:01,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622272239] [2023-11-29 05:47:01,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:01,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:47:01,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:47:01,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:47:01,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:47:01,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 05:47:01,901 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-29 05:47:01,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:01,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 05:47:01,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:02,649 INFO L124 PetriNetUnfolderBase]: 2294/3759 cut-off events. [2023-11-29 05:47:02,649 INFO L125 PetriNetUnfolderBase]: For 1146/1376 co-relation queries the response was YES. [2023-11-29 05:47:02,658 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 22626 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-29 05:47:02,669 INFO L140 encePairwiseOnDemand]: 56/65 looper letters, 78 selfloop transitions, 9 changer transitions 0/122 dead transitions. [2023-11-29 05:47:02,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 578 flow [2023-11-29 05:47:02,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:47:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:47:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 395 transitions. [2023-11-29 05:47:02,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2023-11-29 05:47:02,671 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 395 transitions. [2023-11-29 05:47:02,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 395 transitions. [2023-11-29 05:47:02,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:02,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 395 transitions. [2023-11-29 05:47:02,673 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-29 05:47:02,675 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-29 05:47:02,675 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-29 05:47:02,675 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 203 flow. Second operand 9 states and 395 transitions. [2023-11-29 05:47:02,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 578 flow [2023-11-29 05:47:02,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 548 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:47:02,680 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 240 flow [2023-11-29 05:47:02,680 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-29 05:47:02,681 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2023-11-29 05:47:02,681 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 240 flow [2023-11-29 05:47:02,681 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-29 05:47:02,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:02,681 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-29 05:47:02,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 05:47:02,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:02,886 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-29 05:47:02,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash -60136546, now seen corresponding path program 2 times [2023-11-29 05:47:02,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:47:02,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242185889] [2023-11-29 05:47:02,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:47:02,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:02,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:47:02,888 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:47:02,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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-29 05:47:03,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:47:03,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:47:03,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:47:03,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:03,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:47:03,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:47:03,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242185889] [2023-11-29 05:47:03,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242185889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:03,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:03,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:47:03,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431612140] [2023-11-29 05:47:03,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:03,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:47:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:47:03,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:47:03,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:47:03,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-29 05:47:03,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:03,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:03,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-29 05:47:03,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:03,920 INFO L124 PetriNetUnfolderBase]: 4988/8003 cut-off events. [2023-11-29 05:47:03,920 INFO L125 PetriNetUnfolderBase]: For 3695/3975 co-relation queries the response was YES. [2023-11-29 05:47:03,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20280 conditions, 8003 events. 4988/8003 cut-off events. For 3695/3975 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 52739 event pairs, 998 based on Foata normal form. 16/7583 useless extension candidates. Maximal degree in co-relation 20263. Up to 3160 conditions per place. [2023-11-29 05:47:03,959 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 70 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2023-11-29 05:47:03,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 561 flow [2023-11-29 05:47:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:47:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:47:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 259 transitions. [2023-11-29 05:47:03,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6641025641025641 [2023-11-29 05:47:03,960 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 259 transitions. [2023-11-29 05:47:03,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 259 transitions. [2023-11-29 05:47:03,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:03,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 259 transitions. [2023-11-29 05:47:03,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 6 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:03,962 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-29 05:47:03,962 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-29 05:47:03,962 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 240 flow. Second operand 6 states and 259 transitions. [2023-11-29 05:47:03,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 561 flow [2023-11-29 05:47:03,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 111 transitions, 548 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:47:03,968 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 317 flow [2023-11-29 05:47:03,968 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=6, PETRI_FLOW=317, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2023-11-29 05:47:03,969 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 10 predicate places. [2023-11-29 05:47:03,969 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 317 flow [2023-11-29 05:47:03,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:03,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:03,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-29 05:47:03,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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-29 05:47:04,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:04,170 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-29 05:47:04,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash -476382, now seen corresponding path program 3 times [2023-11-29 05:47:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:47:04,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779709310] [2023-11-29 05:47:04,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:47:04,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:04,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:47:04,172 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:47:04,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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-29 05:47:04,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 05:47:04,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:47:04,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:47:04,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:04,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:47:04,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:47:04,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779709310] [2023-11-29 05:47:04,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779709310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:04,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:04,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:47:04,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427568784] [2023-11-29 05:47:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:04,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:47:04,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:47:04,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:47:04,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:47:04,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-29 05:47:04,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 317 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-29 05:47:04,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:04,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-29 05:47:04,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:05,724 INFO L124 PetriNetUnfolderBase]: 9409/15274 cut-off events. [2023-11-29 05:47:05,725 INFO L125 PetriNetUnfolderBase]: For 6730/7420 co-relation queries the response was YES. [2023-11-29 05:47:05,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38835 conditions, 15274 events. 9409/15274 cut-off events. For 6730/7420 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 114227 event pairs, 4265 based on Foata normal form. 33/14321 useless extension candidates. Maximal degree in co-relation 38815. Up to 6577 conditions per place. [2023-11-29 05:47:05,810 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 73 selfloop transitions, 14 changer transitions 0/121 dead transitions. [2023-11-29 05:47:05,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 121 transitions, 711 flow [2023-11-29 05:47:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:47:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:47:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2023-11-29 05:47:05,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6861538461538461 [2023-11-29 05:47:05,812 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 223 transitions. [2023-11-29 05:47:05,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 223 transitions. [2023-11-29 05:47:05,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:05,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 223 transitions. [2023-11-29 05:47:05,813 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-29 05:47:05,814 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-29 05:47:05,814 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-29 05:47:05,814 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 317 flow. Second operand 5 states and 223 transitions. [2023-11-29 05:47:05,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 121 transitions, 711 flow [2023-11-29 05:47:05,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:05,840 INFO L231 Difference]: Finished difference. Result has 88 places, 89 transitions, 504 flow [2023-11-29 05:47:05,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=81, 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=504, PETRI_PLACES=88, PETRI_TRANSITIONS=89} [2023-11-29 05:47:05,840 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 16 predicate places. [2023-11-29 05:47:05,840 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 504 flow [2023-11-29 05:47:05,841 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-29 05:47:05,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:05,841 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-29 05:47:05,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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-29 05:47:06,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:06,041 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-29 05:47:06,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash -504326876, now seen corresponding path program 4 times [2023-11-29 05:47:06,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:47:06,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461372101] [2023-11-29 05:47:06,042 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:47:06,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:06,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:47:06,043 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:47:06,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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-29 05:47:06,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:47:06,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:47:06,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:47:06,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:06,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:47:06,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:47:06,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461372101] [2023-11-29 05:47:06,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461372101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:06,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:06,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:47:06,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198672450] [2023-11-29 05:47:06,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:06,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:47:06,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:47:06,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:47:06,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:47:06,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-29 05:47:06,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:06,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:06,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-29 05:47:06,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:09,396 INFO L124 PetriNetUnfolderBase]: 18344/29695 cut-off events. [2023-11-29 05:47:09,397 INFO L125 PetriNetUnfolderBase]: For 17740/19082 co-relation queries the response was YES. [2023-11-29 05:47:09,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77521 conditions, 29695 events. 18344/29695 cut-off events. For 17740/19082 co-relation queries the response was YES. Maximal size of possible extension queue 1838. Compared 239091 event pairs, 3582 based on Foata normal form. 16/27936 useless extension candidates. Maximal degree in co-relation 77498. Up to 11791 conditions per place. [2023-11-29 05:47:09,617 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 94 selfloop transitions, 26 changer transitions 0/155 dead transitions. [2023-11-29 05:47:09,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 155 transitions, 1169 flow [2023-11-29 05:47:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:47:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:47:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2023-11-29 05:47:09,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.676923076923077 [2023-11-29 05:47:09,619 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 264 transitions. [2023-11-29 05:47:09,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 264 transitions. [2023-11-29 05:47:09,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:09,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 264 transitions. [2023-11-29 05:47:09,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:09,621 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-29 05:47:09,621 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-29 05:47:09,621 INFO L175 Difference]: Start difference. First operand has 88 places, 89 transitions, 504 flow. Second operand 6 states and 264 transitions. [2023-11-29 05:47:09,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 155 transitions, 1169 flow [2023-11-29 05:47:09,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 155 transitions, 1167 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:09,758 INFO L231 Difference]: Finished difference. Result has 96 places, 114 transitions, 939 flow [2023-11-29 05:47:09,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=87, 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=6, PETRI_FLOW=939, PETRI_PLACES=96, PETRI_TRANSITIONS=114} [2023-11-29 05:47:09,758 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 24 predicate places. [2023-11-29 05:47:09,758 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 114 transitions, 939 flow [2023-11-29 05:47:09,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:09,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:09,759 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-29 05:47:09,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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-29 05:47:09,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:09,959 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-29 05:47:09,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash -393685810, now seen corresponding path program 5 times [2023-11-29 05:47:09,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:47:09,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368868574] [2023-11-29 05:47:09,960 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:47:09,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:09,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:47:09,961 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:47:09,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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-29 05:47:10,112 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:47:10,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 05:47:10,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:47:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:47:10,291 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 05:47:10,291 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:47:10,292 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:47:10,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:47:10,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:47:10,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:47:10,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:47:10,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:47:10,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:47:10,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:47:10,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:47:10,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:47:10,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:47:10,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:47:10,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:47:10,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:47:10,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:47:10,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:47:10,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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-29 05:47:10,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:10,497 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:10,502 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:47:10,502 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:47:10,566 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:47:10,570 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:47:10,572 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:47:10,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:47:10,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:47:10,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:47:10,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:47:10 BasicIcfg [2023-11-29 05:47:10,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:47:10,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:47:10,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:47:10,604 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:47:10,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:41" (3/4) ... [2023-11-29 05:47:10,606 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:47:10,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:47:10,608 INFO L158 Benchmark]: Toolchain (without parser) took 30601.11ms. Allocated memory was 77.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 52.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 404.5MB. Max. memory is 16.1GB. [2023-11-29 05:47:10,608 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 77.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:47:10,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.24ms. Allocated memory is still 77.6MB. Free memory was 52.5MB in the beginning and 46.0MB in the end (delta: 6.5MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2023-11-29 05:47:10,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.31ms. Allocated memory is still 77.6MB. Free memory was 46.0MB in the beginning and 43.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:47:10,609 INFO L158 Benchmark]: Boogie Preprocessor took 65.00ms. Allocated memory is still 77.6MB. Free memory was 43.2MB in the beginning and 39.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:47:10,609 INFO L158 Benchmark]: RCFGBuilder took 991.25ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 39.2MB in the beginning and 41.6MB in the end (delta: -2.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-11-29 05:47:10,610 INFO L158 Benchmark]: TraceAbstraction took 28939.48ms. Allocated memory was 100.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 40.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 366.1MB. Max. memory is 16.1GB. [2023-11-29 05:47:10,610 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 1.5GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:47:10,612 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 77.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.24ms. Allocated memory is still 77.6MB. Free memory was 52.5MB in the beginning and 46.0MB in the end (delta: 6.5MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.31ms. Allocated memory is still 77.6MB. Free memory was 46.0MB in the beginning and 43.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.00ms. Allocated memory is still 77.6MB. Free memory was 43.2MB in the beginning and 39.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 991.25ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 39.2MB in the beginning and 41.6MB in the end (delta: -2.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 28939.48ms. Allocated memory was 100.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 40.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 366.1MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 1.5GB. Free memory is still 1.1GB. 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, t1353={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L863] 0 pthread_t t1354; [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, t1353={3:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, y=0, z=0] [L865] 0 pthread_t t1355; [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, t1353={3:0}, t1354={6:0}, t1355={-2147483646:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, t1353={3:0}, t1354={6:0}, t1355={-2147483646:0}, t1356={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 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) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 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 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 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_p1_EAX=0, __unbuffered_p2_EAX=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] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 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) [L828] 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)) [L829] 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)) [L830] 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)) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=1] [L806] 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) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 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 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 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_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=1] [L766] 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) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 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 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 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_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=1] [L839] 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) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 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 [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 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_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={3:0}, t1354={6:0}, t1355={-2147483646:0}, t1356={7:0}, weak$$choice2=0, x=2, y=1, z=1] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 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) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 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 [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 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_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={3:0}, t1354={6:0}, t1355={-2147483646:0}, t1356={7:0}, weak$$choice2=0, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={3:0}, t1354={6:0}, t1355={-2147483646:0}, t1356={7:0}, weak$$choice2=0, x=2, y=1, z=1] [L883] 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_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 866]: 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: 28.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 978 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 821 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 82 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2497 IncrementalHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 32 mSDtfsCounter, 2497 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=939occurred in iteration=18, InterpolantAutomatonStates: 82, 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, 1.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 358 ConstructedInterpolants, 1 QuantifiedInterpolants, 2773 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2514 ConjunctsInSsa, 103 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-29 05:47:10,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_507cc23e-1bbc-4d1b-a6bd-b2afae1eac34/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample