./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026.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_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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 a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:21:03,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:21:03,498 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:21:03,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:21:03,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:21:03,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:21:03,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:21:03,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:21:03,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:21:03,529 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:21:03,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:21:03,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:21:03,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:21:03,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:21:03,532 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:21:03,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:21:03,533 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:21:03,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:21:03,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:21:03,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:21:03,535 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:21:03,536 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:21:03,536 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:21:03,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:21:03,537 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:21:03,537 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:21:03,538 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:21:03,538 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:21:03,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:21:03,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:21:03,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:21:03,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:21:03,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:21:03,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:21:03,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:21:03,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:21:03,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:21:03,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:21:03,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:21:03,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:21:03,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:21:03,544 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_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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 -> a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 [2023-11-29 05:21:03,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:21:03,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:21:03,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:21:03,788 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:21:03,789 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:21:03,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2023-11-29 05:21:06,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:21:06,825 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:21:06,826 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2023-11-29 05:21:06,842 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/data/5e6d2927b/f453e5cb10064b90b4b4f688fcb7fa6a/FLAG17c80e0b3 [2023-11-29 05:21:06,857 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/data/5e6d2927b/f453e5cb10064b90b4b4f688fcb7fa6a [2023-11-29 05:21:06,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:21:06,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:21:06,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:21:06,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:21:06,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:21:06,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:21:06" (1/1) ... [2023-11-29 05:21:06,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3fe229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:06, skipping insertion in model container [2023-11-29 05:21:06,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:21:06" (1/1) ... [2023-11-29 05:21:06,921 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:21:07,294 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:21:07,306 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:21:07,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:21:07,401 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:21:07,401 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:21:07,409 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:21:07,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07 WrapperNode [2023-11-29 05:21:07,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:21:07,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:21:07,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:21:07,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:21:07,419 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:21:07" (1/1) ... [2023-11-29 05:21:07,437 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:21:07" (1/1) ... [2023-11-29 05:21:07,460 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-29 05:21:07,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:21:07,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:21:07,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:21:07,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:21:07,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07" (1/1) ... [2023-11-29 05:21:07,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07" (1/1) ... [2023-11-29 05:21:07,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07" (1/1) ... [2023-11-29 05:21:07,495 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:21:07,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07" (1/1) ... [2023-11-29 05:21:07,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07" (1/1) ... [2023-11-29 05:21:07,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07" (1/1) ... [2023-11-29 05:21:07,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07" (1/1) ... [2023-11-29 05:21:07,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07" (1/1) ... [2023-11-29 05:21:07,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07" (1/1) ... [2023-11-29 05:21:07,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:21:07,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:21:07,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:21:07,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:21:07,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07" (1/1) ... [2023-11-29 05:21:07,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:21:07,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:21:07,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:21:07,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:21:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:21:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:21:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:21:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:21:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:21:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:21:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:21:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:21:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:21:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:21:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:21:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:21:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:21:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:21:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:21:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:21:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:21:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:21:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:21:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:21:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:21:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:21:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:21:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:21:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:21:07,588 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:21:07,737 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:21:07,739 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:21:08,065 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:21:08,240 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:21:08,240 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:21:08,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:21:08 BoogieIcfgContainer [2023-11-29 05:21:08,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:21:08,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:21:08,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:21:08,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:21:08,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:21:06" (1/3) ... [2023-11-29 05:21:08,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc40496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:21:08, skipping insertion in model container [2023-11-29 05:21:08,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:21:07" (2/3) ... [2023-11-29 05:21:08,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc40496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:21:08, skipping insertion in model container [2023-11-29 05:21:08,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:21:08" (3/3) ... [2023-11-29 05:21:08,249 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026.oepc.i [2023-11-29 05:21:08,269 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:21:08,269 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:21:08,269 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:21:08,323 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:21:08,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 05:21:08,382 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-29 05:21:08,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:21:08,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 124 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-29 05:21:08,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 05:21:08,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-29 05:21:08,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:21:08,408 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;@a059c89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:21:08,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:21:08,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:21:08,411 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:21:08,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:21:08,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:08,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:21:08,413 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:21:08,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:08,417 INFO L85 PathProgramCache]: Analyzing trace with hash 14179, now seen corresponding path program 1 times [2023-11-29 05:21:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613670486] [2023-11-29 05:21:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:08,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:21:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:08,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613670486] [2023-11-29 05:21:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613670486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:08,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:08,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:21:08,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321352431] [2023-11-29 05:21:08,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:08,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:21:08,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:08,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:21:08,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:21:08,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:21:08,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 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:21:08,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:08,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:21:08,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:09,874 INFO L124 PetriNetUnfolderBase]: 4217/7238 cut-off events. [2023-11-29 05:21:09,875 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 05:21:09,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13165 conditions, 7238 events. 4217/7238 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 53752 event pairs, 3179 based on Foata normal form. 360/6957 useless extension candidates. Maximal degree in co-relation 13150. Up to 4391 conditions per place. [2023-11-29 05:21:09,958 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 05:21:09,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 226 flow [2023-11-29 05:21:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:21:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:21:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:21:09,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:21:09,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:21:09,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:21:09,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:09,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:21:09,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:21:09,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:09,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:09,984 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:21:09,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 226 flow [2023-11-29 05:21:09,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:21:09,994 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 05:21:09,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 05:21:10,000 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 05:21:10,000 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 05:21:10,001 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:21:10,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:10,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:21:10,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:21:10,001 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:21:10,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash 14180, now seen corresponding path program 1 times [2023-11-29 05:21:10,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:10,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202118489] [2023-11-29 05:21:10,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:10,102 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:21:10,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:10,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202118489] [2023-11-29 05:21:10,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202118489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:10,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:10,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:21:10,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692294879] [2023-11-29 05:21:10,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:10,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:21:10,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:10,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:21:10,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:21:10,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:21:10,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 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:21:10,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:10,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:21:10,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:11,326 INFO L124 PetriNetUnfolderBase]: 4217/7237 cut-off events. [2023-11-29 05:21:11,326 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 05:21:11,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13341 conditions, 7237 events. 4217/7237 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 53760 event pairs, 3179 based on Foata normal form. 1/6597 useless extension candidates. Maximal degree in co-relation 13330. Up to 4390 conditions per place. [2023-11-29 05:21:11,399 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 05:21:11,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 222 flow [2023-11-29 05:21:11,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:21:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:21:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:21:11,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:21:11,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:21:11,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:21:11,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:11,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:21:11,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:21:11,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:11,405 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:11,405 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:21:11,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 222 flow [2023-11-29 05:21:11,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:21:11,417 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:21:11,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:21:11,418 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 05:21:11,418 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:21:11,418 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:21:11,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:11,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:21:11,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:21:11,419 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:21:11,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash 422848411, now seen corresponding path program 1 times [2023-11-29 05:21:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:11,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30278321] [2023-11-29 05:21:11,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:11,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:11,536 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:21:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:11,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30278321] [2023-11-29 05:21:11,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30278321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:11,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:11,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:21:11,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574699974] [2023-11-29 05:21:11,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:11,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:21:11,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:11,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:21:11,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:21:11,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:21:11,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:11,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:11,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:21:11,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:12,371 INFO L124 PetriNetUnfolderBase]: 3311/5478 cut-off events. [2023-11-29 05:21:12,372 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-29 05:21:12,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 5478 events. 3311/5478 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39077 event pairs, 593 based on Foata normal form. 0/5400 useless extension candidates. Maximal degree in co-relation 10289. Up to 3661 conditions per place. [2023-11-29 05:21:12,413 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 41 selfloop transitions, 2 changer transitions 2/76 dead transitions. [2023-11-29 05:21:12,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 262 flow [2023-11-29 05:21:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:21:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:21:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-29 05:21:12,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7929292929292929 [2023-11-29 05:21:12,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-29 05:21:12,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-29 05:21:12,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:12,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-29 05:21:12,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:12,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:12,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:12,418 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 157 transitions. [2023-11-29 05:21:12,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 262 flow [2023-11-29 05:21:12,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:21:12,422 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 122 flow [2023-11-29 05:21:12,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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=122, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-29 05:21:12,424 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 05:21:12,424 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 122 flow [2023-11-29 05:21:12,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:12,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:12,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:21:12,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:21:12,425 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:21:12,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:12,425 INFO L85 PathProgramCache]: Analyzing trace with hash 422847131, now seen corresponding path program 1 times [2023-11-29 05:21:12,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542704538] [2023-11-29 05:21:12,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:12,468 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:21:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542704538] [2023-11-29 05:21:12,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542704538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:12,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:12,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:21:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181586074] [2023-11-29 05:21:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:12,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:21:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:12,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:21:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:21:12,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:21:12,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 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:21:12,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:12,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:21:12,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:13,036 INFO L124 PetriNetUnfolderBase]: 2906/5175 cut-off events. [2023-11-29 05:21:13,037 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-29 05:21:13,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9587 conditions, 5175 events. 2906/5175 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 37793 event pairs, 1880 based on Foata normal form. 0/4923 useless extension candidates. Maximal degree in co-relation 9576. Up to 3466 conditions per place. [2023-11-29 05:21:13,061 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 05:21:13,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-29 05:21:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:21:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:21:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 05:21:13,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 05:21:13,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 05:21:13,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 05:21:13,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:13,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 05:21:13,064 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:21:13,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:13,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:13,066 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 141 transitions. [2023-11-29 05:21:13,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-29 05:21:13,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:21:13,068 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 05:21:13,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:21:13,069 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-29 05:21:13,069 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 05:21:13,069 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:21:13,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:13,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:21:13,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:21:13,070 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:21:13,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash 422847132, now seen corresponding path program 1 times [2023-11-29 05:21:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:13,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637035763] [2023-11-29 05:21:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:21:13,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:13,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637035763] [2023-11-29 05:21:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637035763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:13,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:13,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:21:13,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560888872] [2023-11-29 05:21:13,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:13,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:21:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:13,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:21:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:21:13,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:21:13,146 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.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:13,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:13,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:21:13,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:13,821 INFO L124 PetriNetUnfolderBase]: 2903/5168 cut-off events. [2023-11-29 05:21:13,821 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 05:21:13,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9441 conditions, 5168 events. 2903/5168 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 37655 event pairs, 1880 based on Foata normal form. 4/4920 useless extension candidates. Maximal degree in co-relation 9431. Up to 3459 conditions per place. [2023-11-29 05:21:13,853 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 05:21:13,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 206 flow [2023-11-29 05:21:13,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:21:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:21:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 05:21:13,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 05:21:13,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 05:21:13,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 05:21:13,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:13,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 05:21:13,855 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:21:13,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:13,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:13,857 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 143 transitions. [2023-11-29 05:21:13,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 206 flow [2023-11-29 05:21:13,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:21:13,861 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 05:21:13,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:21:13,862 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 05:21:13,862 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 05:21:13,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:13,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:13,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:21:13,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:21:13,863 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:21:13,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash -99761962, now seen corresponding path program 1 times [2023-11-29 05:21:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:13,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775261436] [2023-11-29 05:21:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:13,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:13,908 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:21:13,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:13,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775261436] [2023-11-29 05:21:13,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775261436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:13,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:13,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:21:13,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392676461] [2023-11-29 05:21:13,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:13,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:21:13,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:13,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:21:13,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:21:13,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:21:13,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 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:21:13,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:13,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:21:13,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:14,498 INFO L124 PetriNetUnfolderBase]: 2920/5121 cut-off events. [2023-11-29 05:21:14,498 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 05:21:14,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9423 conditions, 5121 events. 2920/5121 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 36967 event pairs, 1892 based on Foata normal form. 0/4891 useless extension candidates. Maximal degree in co-relation 9413. Up to 3460 conditions per place. [2023-11-29 05:21:14,526 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 05:21:14,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 206 flow [2023-11-29 05:21:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:21:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:21:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 05:21:14,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 05:21:14,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 05:21:14,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 05:21:14,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:14,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 05:21:14,528 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:21:14,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:14,529 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:14,529 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 141 transitions. [2023-11-29 05:21:14,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 206 flow [2023-11-29 05:21:14,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:21:14,533 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 05:21:14,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:21:14,534 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 05:21:14,534 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 05:21:14,534 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:21:14,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:14,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:21:14,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:21:14,535 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:21:14,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:14,535 INFO L85 PathProgramCache]: Analyzing trace with hash -99761961, now seen corresponding path program 1 times [2023-11-29 05:21:14,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:14,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60001154] [2023-11-29 05:21:14,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:14,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:14,593 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:21:14,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:14,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60001154] [2023-11-29 05:21:14,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60001154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:14,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:14,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:21:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205216742] [2023-11-29 05:21:14,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:14,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:21:14,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:14,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:21:14,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:21:14,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:21:14,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:14,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:14,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:21:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:15,114 INFO L124 PetriNetUnfolderBase]: 2903/5092 cut-off events. [2023-11-29 05:21:15,114 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:21:15,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9373 conditions, 5092 events. 2903/5092 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 36674 event pairs, 1884 based on Foata normal form. 12/4886 useless extension candidates. Maximal degree in co-relation 9363. Up to 3431 conditions per place. [2023-11-29 05:21:15,139 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:21:15,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 202 flow [2023-11-29 05:21:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:21:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:21:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 05:21:15,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 05:21:15,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 05:21:15,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 05:21:15,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:15,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 05:21:15,142 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:21:15,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:15,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:15,143 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-29 05:21:15,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 202 flow [2023-11-29 05:21:15,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:21:15,147 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 05:21:15,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:21:15,148 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-29 05:21:15,148 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 05:21:15,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:15,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:15,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:21:15,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:21:15,149 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:21:15,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash 109193433, now seen corresponding path program 1 times [2023-11-29 05:21:15,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:15,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213433715] [2023-11-29 05:21:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:15,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:15,200 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:21:15,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:15,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213433715] [2023-11-29 05:21:15,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213433715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:21:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624690708] [2023-11-29 05:21:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:15,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:21:15,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:15,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:21:15,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:21:15,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:21:15,220 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.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:21:15,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:15,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:21:15,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:15,716 INFO L124 PetriNetUnfolderBase]: 2978/5123 cut-off events. [2023-11-29 05:21:15,717 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:21:15,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 5123 events. 2978/5123 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 36271 event pairs, 1424 based on Foata normal form. 0/4969 useless extension candidates. Maximal degree in co-relation 9505. Up to 3426 conditions per place. [2023-11-29 05:21:15,737 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:21:15,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 202 flow [2023-11-29 05:21:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:21:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:21:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 05:21:15,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 05:21:15,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 05:21:15,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 05:21:15,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:15,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 05:21:15,740 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:21:15,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:15,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:15,741 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-29 05:21:15,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 202 flow [2023-11-29 05:21:15,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:21:15,742 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 05:21:15,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:21:15,743 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-29 05:21:15,743 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 05:21:15,743 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:21:15,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:15,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:21:15,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:21:15,744 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:21:15,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash 109193434, now seen corresponding path program 1 times [2023-11-29 05:21:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:15,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710668421] [2023-11-29 05:21:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:15,817 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:21:15,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:15,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710668421] [2023-11-29 05:21:15,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710668421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:15,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:15,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:21:15,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872708246] [2023-11-29 05:21:15,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:15,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:21:15,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:15,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:21:15,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:21:15,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:21:15,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:15,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:15,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:21:15,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:16,391 INFO L124 PetriNetUnfolderBase]: 2903/5072 cut-off events. [2023-11-29 05:21:16,391 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 05:21:16,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 5072 events. 2903/5072 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36428 event pairs, 920 based on Foata normal form. 36/4974 useless extension candidates. Maximal degree in co-relation 9367. Up to 3315 conditions per place. [2023-11-29 05:21:16,411 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 05:21:16,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 198 flow [2023-11-29 05:21:16,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:21:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:21:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 05:21:16,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 05:21:16,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 05:21:16,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 05:21:16,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:16,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 05:21:16,413 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:21:16,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:16,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:21:16,414 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 143 transitions. [2023-11-29 05:21:16,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 198 flow [2023-11-29 05:21:16,415 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:21:16,416 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 05:21:16,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:21:16,417 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-29 05:21:16,417 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 05:21:16,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:16,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:16,418 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:21:16,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:21:16,418 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:21:16,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash -591535221, now seen corresponding path program 1 times [2023-11-29 05:21:16,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:16,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873980192] [2023-11-29 05:21:16,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:16,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:17,105 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:21:17,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:17,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873980192] [2023-11-29 05:21:17,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873980192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:17,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:17,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:21:17,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111603893] [2023-11-29 05:21:17,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:17,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:21:17,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:17,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:21:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:21:17,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2023-11-29 05:21:17,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 32.77777777777778) internal successors, (295), 9 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have 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:21:17,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:17,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2023-11-29 05:21:17,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:17,994 INFO L124 PetriNetUnfolderBase]: 2920/4939 cut-off events. [2023-11-29 05:21:17,995 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 05:21:18,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9274 conditions, 4939 events. 2920/4939 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 34245 event pairs, 546 based on Foata normal form. 144/4969 useless extension candidates. Maximal degree in co-relation 9263. Up to 3315 conditions per place. [2023-11-29 05:21:18,013 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 36 selfloop transitions, 4 changer transitions 11/73 dead transitions. [2023-11-29 05:21:18,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 260 flow [2023-11-29 05:21:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:21:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:21:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 269 transitions. [2023-11-29 05:21:18,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5822510822510822 [2023-11-29 05:21:18,015 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 269 transitions. [2023-11-29 05:21:18,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 269 transitions. [2023-11-29 05:21:18,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:18,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 269 transitions. [2023-11-29 05:21:18,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 38.42857142857143) internal successors, (269), 7 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:18,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:21:18,017 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:21:18,017 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 7 states and 269 transitions. [2023-11-29 05:21:18,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 260 flow [2023-11-29 05:21:18,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:21:18,019 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 110 flow [2023-11-29 05:21:18,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-11-29 05:21:18,020 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 05:21:18,020 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 110 flow [2023-11-29 05:21:18,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.77777777777778) internal successors, (295), 9 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have 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:21:18,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:18,020 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:21:18,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:21:18,021 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:21:18,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:18,021 INFO L85 PathProgramCache]: Analyzing trace with hash -591533723, now seen corresponding path program 1 times [2023-11-29 05:21:18,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:18,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052213970] [2023-11-29 05:21:18,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:18,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:18,248 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:21:18,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052213970] [2023-11-29 05:21:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052213970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:18,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:18,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:21:18,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305863529] [2023-11-29 05:21:18,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:18,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:21:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:18,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:21:18,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:21:18,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2023-11-29 05:21:18,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have 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:21:18,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:18,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2023-11-29 05:21:18,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:21,660 INFO L124 PetriNetUnfolderBase]: 27273/39373 cut-off events. [2023-11-29 05:21:21,661 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2023-11-29 05:21:21,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76590 conditions, 39373 events. 27273/39373 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 1840. Compared 283561 event pairs, 6785 based on Foata normal form. 0/38397 useless extension candidates. Maximal degree in co-relation 76579. Up to 15294 conditions per place. [2023-11-29 05:21:21,820 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 48 selfloop transitions, 7 changer transitions 96/168 dead transitions. [2023-11-29 05:21:21,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 168 transitions, 666 flow [2023-11-29 05:21:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:21:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:21:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 423 transitions. [2023-11-29 05:21:21,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 05:21:21,822 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 423 transitions. [2023-11-29 05:21:21,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 423 transitions. [2023-11-29 05:21:21,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:21,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 423 transitions. [2023-11-29 05:21:21,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 47.0) internal successors, (423), 9 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have 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:21:21,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:21:21,825 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:21:21,825 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 110 flow. Second operand 9 states and 423 transitions. [2023-11-29 05:21:21,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 168 transitions, 666 flow [2023-11-29 05:21:21,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 168 transitions, 654 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:21:21,828 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 199 flow [2023-11-29 05:21:21,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=199, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-11-29 05:21:21,829 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 05:21:21,829 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 199 flow [2023-11-29 05:21:21,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have 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:21:21,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:21,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:21:21,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:21:21,829 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:21:21,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:21,830 INFO L85 PathProgramCache]: Analyzing trace with hash 878477508, now seen corresponding path program 1 times [2023-11-29 05:21:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012465781] [2023-11-29 05:21:21,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:21,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:21:21,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012465781] [2023-11-29 05:21:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012465781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:21,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:21,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:21:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495171175] [2023-11-29 05:21:21,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:21,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:21:21,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:21,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:21:21,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:21:21,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:21:21,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have 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:21:21,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:21,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:21:21,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:24,764 INFO L124 PetriNetUnfolderBase]: 14561/23105 cut-off events. [2023-11-29 05:21:24,764 INFO L125 PetriNetUnfolderBase]: For 17204/18241 co-relation queries the response was YES. [2023-11-29 05:21:24,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59592 conditions, 23105 events. 14561/23105 cut-off events. For 17204/18241 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 181431 event pairs, 3780 based on Foata normal form. 781/23013 useless extension candidates. Maximal degree in co-relation 59573. Up to 12061 conditions per place. [2023-11-29 05:21:24,913 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 34 selfloop transitions, 3 changer transitions 43/105 dead transitions. [2023-11-29 05:21:24,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 105 transitions, 523 flow [2023-11-29 05:21:24,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:21:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:21:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 314 transitions. [2023-11-29 05:21:24,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6796536796536796 [2023-11-29 05:21:24,916 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 314 transitions. [2023-11-29 05:21:24,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 314 transitions. [2023-11-29 05:21:24,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:24,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 314 transitions. [2023-11-29 05:21:24,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.857142857142854) internal successors, (314), 7 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:24,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:21:24,918 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:21:24,918 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 199 flow. Second operand 7 states and 314 transitions. [2023-11-29 05:21:24,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 105 transitions, 523 flow [2023-11-29 05:21:25,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 105 transitions, 473 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-29 05:21:25,106 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 188 flow [2023-11-29 05:21:25,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-11-29 05:21:25,107 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 05:21:25,107 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 188 flow [2023-11-29 05:21:25,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have 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:21:25,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:25,108 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] [2023-11-29 05:21:25,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:21:25,108 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:21:25,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash 429804698, now seen corresponding path program 1 times [2023-11-29 05:21:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:25,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728356072] [2023-11-29 05:21:25,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:25,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:25,288 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:21:25,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:25,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728356072] [2023-11-29 05:21:25,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728356072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:25,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:25,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:21:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950559119] [2023-11-29 05:21:25,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:25,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:21:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:25,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:21:25,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:21:25,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 05:21:25,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have 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:21:25,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:25,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 05:21:25,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:29,788 INFO L124 PetriNetUnfolderBase]: 28197/41976 cut-off events. [2023-11-29 05:21:29,788 INFO L125 PetriNetUnfolderBase]: For 20803/26436 co-relation queries the response was YES. [2023-11-29 05:21:29,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97127 conditions, 41976 events. 28197/41976 cut-off events. For 20803/26436 co-relation queries the response was YES. Maximal size of possible extension queue 1750. Compared 306947 event pairs, 4604 based on Foata normal form. 1727/42387 useless extension candidates. Maximal degree in co-relation 97105. Up to 22862 conditions per place. [2023-11-29 05:21:30,156 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 57 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2023-11-29 05:21:30,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 405 flow [2023-11-29 05:21:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:21:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:21:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2023-11-29 05:21:30,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2023-11-29 05:21:30,158 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 190 transitions. [2023-11-29 05:21:30,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 190 transitions. [2023-11-29 05:21:30,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:30,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 190 transitions. [2023-11-29 05:21:30,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:21:30,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:30,159 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:30,159 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 188 flow. Second operand 4 states and 190 transitions. [2023-11-29 05:21:30,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 405 flow [2023-11-29 05:21:30,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 86 transitions, 387 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-11-29 05:21:30,435 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 216 flow [2023-11-29 05:21:30,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-11-29 05:21:30,436 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-29 05:21:30,436 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 216 flow [2023-11-29 05:21:30,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have 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:21:30,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:30,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:21:30,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:21:30,437 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:21:30,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash 67933092, now seen corresponding path program 1 times [2023-11-29 05:21:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:30,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388998433] [2023-11-29 05:21:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:30,638 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:21:30,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:30,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388998433] [2023-11-29 05:21:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388998433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:30,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:30,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:21:30,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258257397] [2023-11-29 05:21:30,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:30,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:21:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:30,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:21:30,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:21:30,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 05:21:30,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:30,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:30,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 05:21:30,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:34,055 INFO L124 PetriNetUnfolderBase]: 22470/33603 cut-off events. [2023-11-29 05:21:34,056 INFO L125 PetriNetUnfolderBase]: For 17177/21745 co-relation queries the response was YES. [2023-11-29 05:21:34,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85606 conditions, 33603 events. 22470/33603 cut-off events. For 17177/21745 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 237691 event pairs, 2818 based on Foata normal form. 1502/34069 useless extension candidates. Maximal degree in co-relation 85588. Up to 12185 conditions per place. [2023-11-29 05:21:34,267 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 74 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2023-11-29 05:21:34,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 107 transitions, 539 flow [2023-11-29 05:21:34,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:21:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:21:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2023-11-29 05:21:34,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 05:21:34,269 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 242 transitions. [2023-11-29 05:21:34,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 242 transitions. [2023-11-29 05:21:34,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:34,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 242 transitions. [2023-11-29 05:21:34,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:21:34,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have 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:21:34,273 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have 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:21:34,273 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 216 flow. Second operand 5 states and 242 transitions. [2023-11-29 05:21:34,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 107 transitions, 539 flow [2023-11-29 05:21:34,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:21:34,278 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 281 flow [2023-11-29 05:21:34,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-29 05:21:34,279 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2023-11-29 05:21:34,279 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 281 flow [2023-11-29 05:21:34,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:34,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:34,279 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] [2023-11-29 05:21:34,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:21:34,279 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:21:34,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1897256495, now seen corresponding path program 1 times [2023-11-29 05:21:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:34,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324949652] [2023-11-29 05:21:34,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:34,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:34,992 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:21:34,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:34,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324949652] [2023-11-29 05:21:34,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324949652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:34,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:34,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:21:34,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431475028] [2023-11-29 05:21:34,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:34,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:21:34,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:34,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:21:34,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:21:35,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:21:35,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 281 flow. Second operand has 8 states, 8 states have (on average 37.25) internal successors, (298), 8 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have 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:21:35,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:35,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:21:35,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:39,370 INFO L124 PetriNetUnfolderBase]: 24182/40515 cut-off events. [2023-11-29 05:21:39,370 INFO L125 PetriNetUnfolderBase]: For 30395/40717 co-relation queries the response was YES. [2023-11-29 05:21:39,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106117 conditions, 40515 events. 24182/40515 cut-off events. For 30395/40717 co-relation queries the response was YES. Maximal size of possible extension queue 2367. Compared 366326 event pairs, 7868 based on Foata normal form. 721/38139 useless extension candidates. Maximal degree in co-relation 106096. Up to 16191 conditions per place. [2023-11-29 05:21:39,779 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 89 selfloop transitions, 16 changer transitions 12/154 dead transitions. [2023-11-29 05:21:39,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 154 transitions, 793 flow [2023-11-29 05:21:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:21:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 05:21:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 501 transitions. [2023-11-29 05:21:39,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6900826446280992 [2023-11-29 05:21:39,782 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 501 transitions. [2023-11-29 05:21:39,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 501 transitions. [2023-11-29 05:21:39,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:39,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 501 transitions. [2023-11-29 05:21:39,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 45.54545454545455) internal successors, (501), 11 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have 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:21:39,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 66.0) internal successors, (792), 12 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have 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:21:39,787 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 66.0) internal successors, (792), 12 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have 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:21:39,787 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 281 flow. Second operand 11 states and 501 transitions. [2023-11-29 05:21:39,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 154 transitions, 793 flow [2023-11-29 05:21:39,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 154 transitions, 778 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-29 05:21:39,799 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 399 flow [2023-11-29 05:21:39,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=399, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2023-11-29 05:21:39,800 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2023-11-29 05:21:39,800 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 399 flow [2023-11-29 05:21:39,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.25) internal successors, (298), 8 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have 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:21:39,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:39,801 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] [2023-11-29 05:21:39,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:21:39,801 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:21:39,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash 138864975, now seen corresponding path program 2 times [2023-11-29 05:21:39,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:39,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171669473] [2023-11-29 05:21:39,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:39,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:40,038 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:21:40,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:40,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171669473] [2023-11-29 05:21:40,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171669473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:40,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:21:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005401689] [2023-11-29 05:21:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:40,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:21:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:40,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:21:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:21:40,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 05:21:40,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 399 flow. Second operand has 6 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:40,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:40,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 05:21:40,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:45,738 INFO L124 PetriNetUnfolderBase]: 34585/51070 cut-off events. [2023-11-29 05:21:45,739 INFO L125 PetriNetUnfolderBase]: For 94844/103729 co-relation queries the response was YES. [2023-11-29 05:21:45,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168187 conditions, 51070 events. 34585/51070 cut-off events. For 94844/103729 co-relation queries the response was YES. Maximal size of possible extension queue 2155. Compared 370665 event pairs, 3184 based on Foata normal form. 2097/51856 useless extension candidates. Maximal degree in co-relation 168158. Up to 17384 conditions per place. [2023-11-29 05:21:46,058 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 112 selfloop transitions, 14 changer transitions 22/171 dead transitions. [2023-11-29 05:21:46,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 171 transitions, 1184 flow [2023-11-29 05:21:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:21:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:21:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2023-11-29 05:21:46,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:21:46,060 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 292 transitions. [2023-11-29 05:21:46,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 292 transitions. [2023-11-29 05:21:46,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:46,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 292 transitions. [2023-11-29 05:21:46,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have 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:21:46,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:21:46,063 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:21:46,063 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 399 flow. Second operand 6 states and 292 transitions. [2023-11-29 05:21:46,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 171 transitions, 1184 flow [2023-11-29 05:21:46,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 171 transitions, 1177 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 05:21:46,192 INFO L231 Difference]: Finished difference. Result has 89 places, 74 transitions, 419 flow [2023-11-29 05:21:46,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=419, PETRI_PLACES=89, PETRI_TRANSITIONS=74} [2023-11-29 05:21:46,192 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 16 predicate places. [2023-11-29 05:21:46,192 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 74 transitions, 419 flow [2023-11-29 05:21:46,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:21:46,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:46,193 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] [2023-11-29 05:21:46,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:21:46,193 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:21:46,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:46,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1526466823, now seen corresponding path program 1 times [2023-11-29 05:21:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230774085] [2023-11-29 05:21:46,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:46,676 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:21:46,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230774085] [2023-11-29 05:21:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230774085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:46,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:46,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:21:46,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042935095] [2023-11-29 05:21:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:46,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:21:46,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:46,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:21:46,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:21:46,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 05:21:46,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 74 transitions, 419 flow. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have 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:21:46,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:46,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 05:21:46,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:50,943 INFO L124 PetriNetUnfolderBase]: 22616/33431 cut-off events. [2023-11-29 05:21:50,943 INFO L125 PetriNetUnfolderBase]: For 96390/103082 co-relation queries the response was YES. [2023-11-29 05:21:51,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122235 conditions, 33431 events. 22616/33431 cut-off events. For 96390/103082 co-relation queries the response was YES. Maximal size of possible extension queue 1560. Compared 235385 event pairs, 2478 based on Foata normal form. 746/33086 useless extension candidates. Maximal degree in co-relation 122205. Up to 12964 conditions per place. [2023-11-29 05:21:51,165 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 99 selfloop transitions, 18 changer transitions 0/140 dead transitions. [2023-11-29 05:21:51,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 140 transitions, 933 flow [2023-11-29 05:21:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:21:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:21:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 320 transitions. [2023-11-29 05:21:51,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6926406926406926 [2023-11-29 05:21:51,167 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 320 transitions. [2023-11-29 05:21:51,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 320 transitions. [2023-11-29 05:21:51,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:51,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 320 transitions. [2023-11-29 05:21:51,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.714285714285715) internal successors, (320), 7 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have 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:21:51,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:21:51,170 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:21:51,170 INFO L175 Difference]: Start difference. First operand has 89 places, 74 transitions, 419 flow. Second operand 7 states and 320 transitions. [2023-11-29 05:21:51,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 140 transitions, 933 flow [2023-11-29 05:21:52,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 140 transitions, 884 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-11-29 05:21:52,643 INFO L231 Difference]: Finished difference. Result has 86 places, 74 transitions, 429 flow [2023-11-29 05:21:52,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=86, PETRI_TRANSITIONS=74} [2023-11-29 05:21:52,644 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 13 predicate places. [2023-11-29 05:21:52,644 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 74 transitions, 429 flow [2023-11-29 05:21:52,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have 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:21:52,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:52,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:52,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:21:52,645 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:21:52,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash -249620963, now seen corresponding path program 1 times [2023-11-29 05:21:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:52,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385103048] [2023-11-29 05:21:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:52,977 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:21:52,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:52,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385103048] [2023-11-29 05:21:52,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385103048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:21:52,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:21:52,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:21:52,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633311739] [2023-11-29 05:21:52,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:21:52,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:21:52,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:52,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:21:52,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:21:52,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-29 05:21:52,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 74 transitions, 429 flow. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:21:52,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:52,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-29 05:21:52,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:57,151 INFO L124 PetriNetUnfolderBase]: 25187/39671 cut-off events. [2023-11-29 05:21:57,151 INFO L125 PetriNetUnfolderBase]: For 79407/92762 co-relation queries the response was YES. [2023-11-29 05:21:57,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128911 conditions, 39671 events. 25187/39671 cut-off events. For 79407/92762 co-relation queries the response was YES. Maximal size of possible extension queue 2595. Compared 334062 event pairs, 4124 based on Foata normal form. 690/36372 useless extension candidates. Maximal degree in co-relation 128883. Up to 14156 conditions per place. [2023-11-29 05:21:57,609 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 88 selfloop transitions, 14 changer transitions 43/177 dead transitions. [2023-11-29 05:21:57,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 177 transitions, 1168 flow [2023-11-29 05:21:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:21:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:21:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 352 transitions. [2023-11-29 05:21:57,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 05:21:57,612 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 352 transitions. [2023-11-29 05:21:57,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 352 transitions. [2023-11-29 05:21:57,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:57,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 352 transitions. [2023-11-29 05:21:57,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 44.0) internal successors, (352), 8 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have 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:21:57,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have 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:21:57,616 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have 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:21:57,617 INFO L175 Difference]: Start difference. First operand has 86 places, 74 transitions, 429 flow. Second operand 8 states and 352 transitions. [2023-11-29 05:21:57,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 177 transitions, 1168 flow [2023-11-29 05:21:59,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 177 transitions, 1053 flow, removed 46 selfloop flow, removed 7 redundant places. [2023-11-29 05:21:59,852 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 420 flow [2023-11-29 05:21:59,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=420, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2023-11-29 05:21:59,853 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 17 predicate places. [2023-11-29 05:21:59,853 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 420 flow [2023-11-29 05:21:59,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:21:59,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:59,853 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, 1] [2023-11-29 05:21:59,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:21:59,854 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:21:59,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash -716759313, now seen corresponding path program 2 times [2023-11-29 05:21:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:59,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376488822] [2023-11-29 05:21:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:59,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:22:00,186 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:22:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:22:00,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376488822] [2023-11-29 05:22:00,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376488822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:22:00,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:22:00,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:22:00,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745190846] [2023-11-29 05:22:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:22:00,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:22:00,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:22:00,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:22:00,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:22:00,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-29 05:22:00,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 420 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:22:00,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:22:00,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-29 05:22:00,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:22:04,968 INFO L124 PetriNetUnfolderBase]: 24549/42618 cut-off events. [2023-11-29 05:22:04,968 INFO L125 PetriNetUnfolderBase]: For 59637/69516 co-relation queries the response was YES. [2023-11-29 05:22:05,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126347 conditions, 42618 events. 24549/42618 cut-off events. For 59637/69516 co-relation queries the response was YES. Maximal size of possible extension queue 3137. Compared 415090 event pairs, 6830 based on Foata normal form. 763/38433 useless extension candidates. Maximal degree in co-relation 126318. Up to 14623 conditions per place. [2023-11-29 05:22:05,210 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 63 selfloop transitions, 3 changer transitions 15/126 dead transitions. [2023-11-29 05:22:05,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 126 transitions, 776 flow [2023-11-29 05:22:05,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:22:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:22:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2023-11-29 05:22:05,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6616161616161617 [2023-11-29 05:22:05,211 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 262 transitions. [2023-11-29 05:22:05,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 262 transitions. [2023-11-29 05:22:05,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:22:05,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 262 transitions. [2023-11-29 05:22:05,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 43.666666666666664) internal successors, (262), 6 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:22:05,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:22:05,214 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:22:05,214 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 420 flow. Second operand 6 states and 262 transitions. [2023-11-29 05:22:05,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 126 transitions, 776 flow [2023-11-29 05:22:09,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 126 transitions, 770 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-29 05:22:09,210 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 439 flow [2023-11-29 05:22:09,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2023-11-29 05:22:09,210 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 22 predicate places. [2023-11-29 05:22:09,210 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 439 flow [2023-11-29 05:22:09,210 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:22:09,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:22:09,211 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, 1] [2023-11-29 05:22:09,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:22:09,211 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:22:09,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:22:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash 92729853, now seen corresponding path program 3 times [2023-11-29 05:22:09,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:22:09,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826432618] [2023-11-29 05:22:09,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:22:09,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:22:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:22:09,937 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:22:09,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:22:09,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826432618] [2023-11-29 05:22:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826432618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:22:09,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:22:09,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:22:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266103028] [2023-11-29 05:22:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:22:09,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:22:09,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:22:09,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:22:09,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:22:09,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:22:09,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 439 flow. Second operand has 9 states, 9 states have (on average 37.22222222222222) internal successors, (335), 9 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have 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:22:09,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:22:09,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:22:09,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:22:16,217 INFO L124 PetriNetUnfolderBase]: 30495/54743 cut-off events. [2023-11-29 05:22:16,217 INFO L125 PetriNetUnfolderBase]: For 77501/89355 co-relation queries the response was YES. [2023-11-29 05:22:16,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159435 conditions, 54743 events. 30495/54743 cut-off events. For 77501/89355 co-relation queries the response was YES. Maximal size of possible extension queue 4434. Compared 576260 event pairs, 7605 based on Foata normal form. 1050/50080 useless extension candidates. Maximal degree in co-relation 159403. Up to 15958 conditions per place. [2023-11-29 05:22:16,552 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 62 selfloop transitions, 11 changer transitions 18/140 dead transitions. [2023-11-29 05:22:16,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 140 transitions, 859 flow [2023-11-29 05:22:16,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:22:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:22:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 399 transitions. [2023-11-29 05:22:16,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6717171717171717 [2023-11-29 05:22:16,554 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 399 transitions. [2023-11-29 05:22:16,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 399 transitions. [2023-11-29 05:22:16,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:22:16,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 399 transitions. [2023-11-29 05:22:16,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.333333333333336) internal successors, (399), 9 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have 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:22:16,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:22:16,558 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:22:16,558 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 439 flow. Second operand 9 states and 399 transitions. [2023-11-29 05:22:16,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 140 transitions, 859 flow [2023-11-29 05:22:24,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 140 transitions, 852 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 05:22:24,724 INFO L231 Difference]: Finished difference. Result has 104 places, 86 transitions, 526 flow [2023-11-29 05:22:24,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=526, PETRI_PLACES=104, PETRI_TRANSITIONS=86} [2023-11-29 05:22:24,725 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 31 predicate places. [2023-11-29 05:22:24,725 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 526 flow [2023-11-29 05:22:24,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.22222222222222) internal successors, (335), 9 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have 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:22:24,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:22:24,725 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, 1] [2023-11-29 05:22:24,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:22:24,726 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:22:24,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:22:24,726 INFO L85 PathProgramCache]: Analyzing trace with hash -553298957, now seen corresponding path program 4 times [2023-11-29 05:22:24,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:22:24,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666484044] [2023-11-29 05:22:24,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:22:24,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:22:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:22:25,805 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:22:25,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:22:25,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666484044] [2023-11-29 05:22:25,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666484044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:22:25,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:22:25,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:22:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001029890] [2023-11-29 05:22:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:22:25,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:22:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:22:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:22:25,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:22:25,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:22:25,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 526 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:22:25,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:22:25,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:22:25,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:22:35,689 INFO L124 PetriNetUnfolderBase]: 46226/82464 cut-off events. [2023-11-29 05:22:35,689 INFO L125 PetriNetUnfolderBase]: For 154341/179033 co-relation queries the response was YES. [2023-11-29 05:22:36,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254821 conditions, 82464 events. 46226/82464 cut-off events. For 154341/179033 co-relation queries the response was YES. Maximal size of possible extension queue 7004. Compared 909692 event pairs, 18382 based on Foata normal form. 1702/74126 useless extension candidates. Maximal degree in co-relation 254784. Up to 33870 conditions per place. [2023-11-29 05:22:36,228 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 86 selfloop transitions, 14 changer transitions 13/162 dead transitions. [2023-11-29 05:22:36,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 162 transitions, 1144 flow [2023-11-29 05:22:36,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:22:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:22:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 369 transitions. [2023-11-29 05:22:36,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6988636363636364 [2023-11-29 05:22:36,230 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 369 transitions. [2023-11-29 05:22:36,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 369 transitions. [2023-11-29 05:22:36,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:22:36,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 369 transitions. [2023-11-29 05:22:36,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have 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:22:36,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have 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:22:36,233 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have 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:22:36,233 INFO L175 Difference]: Start difference. First operand has 104 places, 86 transitions, 526 flow. Second operand 8 states and 369 transitions. [2023-11-29 05:22:36,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 162 transitions, 1144 flow [2023-11-29 05:23:01,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 162 transitions, 1121 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-29 05:23:01,327 INFO L231 Difference]: Finished difference. Result has 112 places, 99 transitions, 698 flow [2023-11-29 05:23:01,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=698, PETRI_PLACES=112, PETRI_TRANSITIONS=99} [2023-11-29 05:23:01,328 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 39 predicate places. [2023-11-29 05:23:01,328 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 99 transitions, 698 flow [2023-11-29 05:23:01,328 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:23:01,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:01,328 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, 1] [2023-11-29 05:23:01,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:23:01,329 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:23:01,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:01,329 INFO L85 PathProgramCache]: Analyzing trace with hash -912485751, now seen corresponding path program 5 times [2023-11-29 05:23:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:23:01,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093869798] [2023-11-29 05:23:01,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:01,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:23:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:23:01,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:23:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:23:01,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:23:01,475 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:23:01,476 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:23:01,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:23:01,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:23:01,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:23:01,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:23:01,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:23:01,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:23:01,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:23:01,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:23:01,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:23:01,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:23:01,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:23:01,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:23:01,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:23:01,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:23:01,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:23:01,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:23:01,480 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:23:01,486 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:23:01,487 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:23:01,560 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:23:01,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:23:01,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:23:01,564 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:23:01,581 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:23:01,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:23:01,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:23:01 BasicIcfg [2023-11-29 05:23:01,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:23:01,598 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:23:01,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:23:01,599 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:23:01,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:21:08" (3/4) ... [2023-11-29 05:23:01,601 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:23:01,602 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:23:01,603 INFO L158 Benchmark]: Toolchain (without parser) took 114741.38ms. Allocated memory was 174.1MB in the beginning and 8.5GB in the end (delta: 8.3GB). Free memory was 127.3MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2023-11-29 05:23:01,603 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 59.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:23:01,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.55ms. Allocated memory is still 174.1MB. Free memory was 126.9MB in the beginning and 102.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 05:23:01,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.55ms. Allocated memory is still 174.1MB. Free memory was 102.7MB in the beginning and 100.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:23:01,604 INFO L158 Benchmark]: Boogie Preprocessor took 58.93ms. Allocated memory is still 174.1MB. Free memory was 100.0MB in the beginning and 95.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:23:01,604 INFO L158 Benchmark]: RCFGBuilder took 720.35ms. Allocated memory is still 174.1MB. Free memory was 95.8MB in the beginning and 98.4MB in the end (delta: -2.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-11-29 05:23:01,604 INFO L158 Benchmark]: TraceAbstraction took 113354.24ms. Allocated memory was 174.1MB in the beginning and 8.5GB in the end (delta: 8.3GB). Free memory was 97.5MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2023-11-29 05:23:01,605 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 8.5GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:23:01,607 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.20ms. Allocated memory is still 109.1MB. Free memory is still 59.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.55ms. Allocated memory is still 174.1MB. Free memory was 126.9MB in the beginning and 102.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.55ms. Allocated memory is still 174.1MB. Free memory was 102.7MB in the beginning and 100.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.93ms. Allocated memory is still 174.1MB. Free memory was 100.0MB in the beginning and 95.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 720.35ms. Allocated memory is still 174.1MB. Free memory was 95.8MB in the beginning and 98.4MB in the end (delta: -2.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 113354.24ms. Allocated memory was 174.1MB in the beginning and 8.5GB in the end (delta: 8.3GB). Free memory was 97.5MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 8.5GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t681; [L867] FCALL, FORK 0 pthread_create(&t681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, t681={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t682; [L869] FCALL, FORK 0 pthread_create(&t682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t681={5:0}, t682={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t683; [L871] FCALL, FORK 0 pthread_create(&t683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t681={5:0}, t682={6:0}, t683={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t684; [L873] FCALL, FORK 0 pthread_create(&t684, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 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) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L844] 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) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 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 [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L768] 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) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 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 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L788] 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) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 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 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L808] 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) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 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 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 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 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L888] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L17] 0 __assert_fail ("0", "mix026.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 871]: 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: 873]: 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: 869]: 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, 99 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: 113.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 106.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1327 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1157 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3688 IncrementalHoareTripleChecker+Invalid, 3787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 50 mSDtfsCounter, 3688 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=698occurred in iteration=21, InterpolantAutomatonStates: 114, 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, 5.4s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 421 ConstructedInterpolants, 0 QuantifiedInterpolants, 3026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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:23:01,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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 a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:23:04,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:23:04,130 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 05:23:04,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:23:04,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:23:04,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:23:04,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:23:04,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:23:04,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:23:04,175 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:23:04,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:23:04,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:23:04,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:23:04,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:23:04,178 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:23:04,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:23:04,180 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:23:04,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:23:04,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:23:04,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:23:04,182 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:23:04,182 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:23:04,183 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:23:04,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:23:04,184 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:23:04,184 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:23:04,185 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:23:04,185 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:23:04,186 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:23:04,186 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:23:04,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:23:04,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:23:04,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:23:04,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:23:04,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:23:04,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:23:04,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:23:04,189 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:23:04,189 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:23:04,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:23:04,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:23:04,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:23:04,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:23:04,190 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:23:04,190 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_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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 -> a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 [2023-11-29 05:23:04,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:23:04,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:23:04,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:23:04,520 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:23:04,520 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:23:04,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2023-11-29 05:23:07,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:23:07,617 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:23:07,618 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2023-11-29 05:23:07,634 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/data/56973ec15/479b19c0920f403f9acfef63b6058ce7/FLAG3d92a9fa1 [2023-11-29 05:23:07,648 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/data/56973ec15/479b19c0920f403f9acfef63b6058ce7 [2023-11-29 05:23:07,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:23:07,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:23:07,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:23:07,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:23:07,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:23:07,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:23:07" (1/1) ... [2023-11-29 05:23:07,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31895ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:07, skipping insertion in model container [2023-11-29 05:23:07,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:23:07" (1/1) ... [2023-11-29 05:23:07,707 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:23:08,090 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:23:08,107 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:23:08,162 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:23:08,200 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:23:08,200 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:23:08,208 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:23:08,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08 WrapperNode [2023-11-29 05:23:08,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:23:08,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:23:08,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:23:08,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:23:08,218 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:23:08" (1/1) ... [2023-11-29 05:23:08,238 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:23:08" (1/1) ... [2023-11-29 05:23:08,265 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-29 05:23:08,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:23:08,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:23:08,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:23:08,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:23:08,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08" (1/1) ... [2023-11-29 05:23:08,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08" (1/1) ... [2023-11-29 05:23:08,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08" (1/1) ... [2023-11-29 05:23:08,301 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:23:08,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08" (1/1) ... [2023-11-29 05:23:08,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08" (1/1) ... [2023-11-29 05:23:08,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08" (1/1) ... [2023-11-29 05:23:08,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08" (1/1) ... [2023-11-29 05:23:08,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08" (1/1) ... [2023-11-29 05:23:08,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08" (1/1) ... [2023-11-29 05:23:08,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:23:08,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:23:08,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:23:08,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:23:08,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08" (1/1) ... [2023-11-29 05:23:08,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:23:08,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:23:08,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:08,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:23:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:23:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:23:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:23:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:23:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:23:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:23:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 05:23:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 05:23:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:23:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:23:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:23:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 05:23:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 05:23:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:23:08,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:23:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:23:08,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:23:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:23:08,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:23:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:23:08,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:23:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:23:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:23:08,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:23:08,417 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:23:08,586 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:23:08,589 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:23:08,990 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:23:09,205 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:23:09,205 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:23:09,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:23:09 BoogieIcfgContainer [2023-11-29 05:23:09,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:23:09,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:23:09,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:23:09,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:23:09,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:23:07" (1/3) ... [2023-11-29 05:23:09,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a80369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:23:09, skipping insertion in model container [2023-11-29 05:23:09,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:23:08" (2/3) ... [2023-11-29 05:23:09,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a80369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:23:09, skipping insertion in model container [2023-11-29 05:23:09,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:23:09" (3/3) ... [2023-11-29 05:23:09,251 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026.oepc.i [2023-11-29 05:23:09,275 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:23:09,275 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:23:09,275 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:23:09,359 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:23:09,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 05:23:09,431 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-29 05:23:09,432 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:23:09,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-29 05:23:09,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 05:23:09,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-29 05:23:09,452 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:23:09,459 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;@69f786f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:23:09,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:23:09,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:23:09,463 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:23:09,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:23:09,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:09,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:23:09,465 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:23:09,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash 14243, now seen corresponding path program 1 times [2023-11-29 05:23:09,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:09,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175452070] [2023-11-29 05:23:09,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:09,485 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:23:09,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:09,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:09,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:09,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:23:09,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:09,687 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:23:09,700 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:23:09,700 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:09,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175452070] [2023-11-29 05:23:09,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175452070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:09,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:09,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:23:09,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687068072] [2023-11-29 05:23:09,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:09,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:23:09,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:09,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:23:09,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:23:09,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:23:09,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 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:23:09,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:09,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:23:09,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:11,098 INFO L124 PetriNetUnfolderBase]: 4217/7238 cut-off events. [2023-11-29 05:23:11,098 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 05:23:11,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13165 conditions, 7238 events. 4217/7238 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53787 event pairs, 3179 based on Foata normal form. 360/6971 useless extension candidates. Maximal degree in co-relation 13150. Up to 4391 conditions per place. [2023-11-29 05:23:11,187 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 05:23:11,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 226 flow [2023-11-29 05:23:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:23:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:23:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:23:11,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:23:11,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:23:11,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:23:11,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:11,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:23:11,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:23:11,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:11,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:11,221 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:23:11,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 226 flow [2023-11-29 05:23:11,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:23:11,233 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 05:23:11,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 05:23:11,240 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 05:23:11,240 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 05:23:11,240 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:23:11,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:11,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:23:11,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:11,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:11,442 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:23:11,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:11,443 INFO L85 PathProgramCache]: Analyzing trace with hash 14244, now seen corresponding path program 1 times [2023-11-29 05:23:11,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:11,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048216140] [2023-11-29 05:23:11,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:11,444 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:23:11,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:11,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:11,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:11,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:23:11,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:11,545 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:23:11,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:23:11,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:11,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:11,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048216140] [2023-11-29 05:23:11,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048216140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:11,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:11,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:23:11,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769676408] [2023-11-29 05:23:11,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:11,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:23:11,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:11,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:23:11,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:23:11,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:23:11,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 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:23:11,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:11,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:23:11,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:12,615 INFO L124 PetriNetUnfolderBase]: 4217/7237 cut-off events. [2023-11-29 05:23:12,615 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 05:23:12,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13341 conditions, 7237 events. 4217/7237 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53786 event pairs, 3179 based on Foata normal form. 1/6611 useless extension candidates. Maximal degree in co-relation 13330. Up to 4390 conditions per place. [2023-11-29 05:23:12,673 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 05:23:12,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 222 flow [2023-11-29 05:23:12,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:23:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:23:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:23:12,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:23:12,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:23:12,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:23:12,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:12,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:23:12,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:23:12,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:12,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:12,680 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:23:12,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 222 flow [2023-11-29 05:23:12,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:23:12,690 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:23:12,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:23:12,691 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 05:23:12,691 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:23:12,691 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:23:12,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:12,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:23:12,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:12,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:12,892 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:23:12,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash 424749975, now seen corresponding path program 1 times [2023-11-29 05:23:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:12,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457898350] [2023-11-29 05:23:12,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:12,894 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:23:12,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:12,895 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:12,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:12,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:23:12,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:12,999 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:23:13,005 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:23:13,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:13,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457898350] [2023-11-29 05:23:13,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457898350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:13,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:13,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:23:13,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777026318] [2023-11-29 05:23:13,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:13,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:23:13,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:13,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:23:13,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:23:13,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:23:13,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 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:23:13,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:13,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:23:13,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:14,179 INFO L124 PetriNetUnfolderBase]: 4221/7200 cut-off events. [2023-11-29 05:23:14,179 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 05:23:14,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13313 conditions, 7200 events. 4221/7200 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53494 event pairs, 3251 based on Foata normal form. 0/6583 useless extension candidates. Maximal degree in co-relation 13302. Up to 4393 conditions per place. [2023-11-29 05:23:14,230 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 05:23:14,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 222 flow [2023-11-29 05:23:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:23:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:23:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 05:23:14,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-29 05:23:14,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 05:23:14,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 05:23:14,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:14,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 05:23:14,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have 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:23:14,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:14,236 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:14,236 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 144 transitions. [2023-11-29 05:23:14,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 222 flow [2023-11-29 05:23:14,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:23:14,244 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 05:23:14,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:23:14,245 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 05:23:14,246 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 05:23:14,246 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:23:14,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:14,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:23:14,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:14,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:14,447 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:23:14,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash 424749976, now seen corresponding path program 1 times [2023-11-29 05:23:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:14,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972820346] [2023-11-29 05:23:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:14,449 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:23:14,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:14,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:14,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:14,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:23:14,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:14,575 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:23:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:23:14,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:14,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972820346] [2023-11-29 05:23:14,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972820346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:14,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:14,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:23:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094124664] [2023-11-29 05:23:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:14,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:23:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:23:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:23:14,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:23:14,630 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.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:14,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:14,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:23:14,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:15,486 INFO L124 PetriNetUnfolderBase]: 4217/7179 cut-off events. [2023-11-29 05:23:15,486 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-29 05:23:15,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13287 conditions, 7179 events. 4217/7179 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53750 event pairs, 3247 based on Foata normal form. 5/6575 useless extension candidates. Maximal degree in co-relation 13277. Up to 4384 conditions per place. [2023-11-29 05:23:15,541 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 05:23:15,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 218 flow [2023-11-29 05:23:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:23:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:23:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:23:15,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:23:15,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:23:15,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:23:15,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:15,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:23:15,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:23:15,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:15,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:15,547 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:23:15,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 218 flow [2023-11-29 05:23:15,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:23:15,556 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 05:23:15,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:23:15,557 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-29 05:23:15,557 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 05:23:15,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:15,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:15,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:23:15,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:15,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:15,761 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:23:15,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash 424751255, now seen corresponding path program 1 times [2023-11-29 05:23:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:15,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894153437] [2023-11-29 05:23:15,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:15,762 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:23:15,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:15,764 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:15,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:15,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:23:15,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:15,871 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:23:15,872 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:15,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:15,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894153437] [2023-11-29 05:23:15,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894153437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:15,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:15,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:23:15,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512336330] [2023-11-29 05:23:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:15,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:23:15,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:23:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:23:15,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:23:15,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:15,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:15,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:23:15,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:16,480 INFO L124 PetriNetUnfolderBase]: 3311/5476 cut-off events. [2023-11-29 05:23:16,480 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 05:23:16,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10301 conditions, 5476 events. 3311/5476 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39398 event pairs, 593 based on Foata normal form. 0/5403 useless extension candidates. Maximal degree in co-relation 10291. Up to 3661 conditions per place. [2023-11-29 05:23:16,520 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 41 selfloop transitions, 2 changer transitions 2/74 dead transitions. [2023-11-29 05:23:16,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 260 flow [2023-11-29 05:23:16,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:23:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:23:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-29 05:23:16,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7929292929292929 [2023-11-29 05:23:16,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-29 05:23:16,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-29 05:23:16,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:16,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-29 05:23:16,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:16,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:16,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:16,525 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 157 transitions. [2023-11-29 05:23:16,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 260 flow [2023-11-29 05:23:16,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:23:16,529 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 118 flow [2023-11-29 05:23:16,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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=118, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2023-11-29 05:23:16,530 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-29 05:23:16,530 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 118 flow [2023-11-29 05:23:16,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:16,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:16,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:23:16,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:16,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:16,734 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:23:16,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 753292702, now seen corresponding path program 1 times [2023-11-29 05:23:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:16,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074864190] [2023-11-29 05:23:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:16,735 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:23:16,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:16,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:16,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:16,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:23:16,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:16,831 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:23:16,837 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:23:16,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:16,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:16,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074864190] [2023-11-29 05:23:16,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074864190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:16,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:16,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:23:16,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662817380] [2023-11-29 05:23:16,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:16,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:23:16,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:16,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:23:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:23:16,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:23:16,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 118 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:23:16,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:16,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:23:16,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:17,467 INFO L124 PetriNetUnfolderBase]: 2920/5121 cut-off events. [2023-11-29 05:23:17,467 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-29 05:23:17,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9557 conditions, 5121 events. 2920/5121 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36869 event pairs, 1892 based on Foata normal form. 0/4902 useless extension candidates. Maximal degree in co-relation 9546. Up to 3460 conditions per place. [2023-11-29 05:23:17,498 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 05:23:17,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 208 flow [2023-11-29 05:23:17,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:23:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:23:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 05:23:17,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 05:23:17,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 05:23:17,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 05:23:17,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:17,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 05:23:17,501 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:23:17,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:17,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:17,502 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 118 flow. Second operand 3 states and 141 transitions. [2023-11-29 05:23:17,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 208 flow [2023-11-29 05:23:17,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:23:17,504 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 05:23:17,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:23:17,505 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 05:23:17,505 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 05:23:17,505 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:23:17,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:17,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:23:17,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:17,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:17,706 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:23:17,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:17,707 INFO L85 PathProgramCache]: Analyzing trace with hash 753292703, now seen corresponding path program 1 times [2023-11-29 05:23:17,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:17,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962116829] [2023-11-29 05:23:17,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:17,708 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:23:17,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:17,709 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:17,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:17,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:23:17,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:17,792 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:23:17,804 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:23:17,804 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:17,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:17,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962116829] [2023-11-29 05:23:17,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962116829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:17,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:17,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:23:17,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837189862] [2023-11-29 05:23:17,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:17,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:23:17,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:17,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:23:17,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:23:17,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:23:17,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:17,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:17,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:23:17,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:18,548 INFO L124 PetriNetUnfolderBase]: 2903/5092 cut-off events. [2023-11-29 05:23:18,548 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:23:18,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9373 conditions, 5092 events. 2903/5092 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36755 event pairs, 1884 based on Foata normal form. 12/4893 useless extension candidates. Maximal degree in co-relation 9363. Up to 3431 conditions per place. [2023-11-29 05:23:18,576 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:23:18,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 202 flow [2023-11-29 05:23:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:23:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:23:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 05:23:18,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 05:23:18,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 05:23:18,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 05:23:18,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:18,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 05:23:18,578 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:23:18,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:18,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:18,579 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-29 05:23:18,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 202 flow [2023-11-29 05:23:18,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:23:18,582 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 05:23:18,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:23:18,583 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-29 05:23:18,583 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 05:23:18,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:18,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:18,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:23:18,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:18,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:18,784 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:23:18,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash 139202133, now seen corresponding path program 1 times [2023-11-29 05:23:18,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:18,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737116823] [2023-11-29 05:23:18,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:18,786 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:23:18,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:18,787 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:18,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:18,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:23:18,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:18,898 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:23:18,904 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:23:18,904 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:18,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:18,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737116823] [2023-11-29 05:23:18,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737116823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:18,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:18,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:23:18,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455568130] [2023-11-29 05:23:18,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:18,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:23:18,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:18,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:23:18,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:23:18,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:23:18,931 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.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:23:18,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:18,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:23:18,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:19,531 INFO L124 PetriNetUnfolderBase]: 2978/5123 cut-off events. [2023-11-29 05:23:19,532 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:23:19,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 5123 events. 2978/5123 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 36360 event pairs, 1424 based on Foata normal form. 0/4976 useless extension candidates. Maximal degree in co-relation 9505. Up to 3426 conditions per place. [2023-11-29 05:23:19,551 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:23:19,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 202 flow [2023-11-29 05:23:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:23:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:23:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 05:23:19,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 05:23:19,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 05:23:19,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 05:23:19,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:19,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 05:23:19,553 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:23:19,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:19,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:19,554 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-29 05:23:19,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 202 flow [2023-11-29 05:23:19,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:23:19,557 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 05:23:19,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:23:19,558 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-29 05:23:19,558 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 05:23:19,558 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:23:19,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:19,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:23:19,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:19,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:19,759 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:23:19,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 139202134, now seen corresponding path program 1 times [2023-11-29 05:23:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:19,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147317570] [2023-11-29 05:23:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:19,760 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:23:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:19,762 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:19,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:19,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:23:19,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:19,861 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:23:19,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:23:19,872 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:19,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:19,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147317570] [2023-11-29 05:23:19,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147317570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:19,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:19,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:23:19,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102946160] [2023-11-29 05:23:19,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:19,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:23:19,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:19,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:23:19,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:23:19,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:23:19,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:19,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:19,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:23:19,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:20,446 INFO L124 PetriNetUnfolderBase]: 2903/5072 cut-off events. [2023-11-29 05:23:20,446 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 05:23:20,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 5072 events. 2903/5072 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 36514 event pairs, 920 based on Foata normal form. 36/4985 useless extension candidates. Maximal degree in co-relation 9367. Up to 3315 conditions per place. [2023-11-29 05:23:20,473 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 05:23:20,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 198 flow [2023-11-29 05:23:20,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:23:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:23:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 05:23:20,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 05:23:20,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 05:23:20,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 05:23:20,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:20,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 05:23:20,476 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:23:20,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:20,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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:23:20,477 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 143 transitions. [2023-11-29 05:23:20,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 198 flow [2023-11-29 05:23:20,479 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:23:20,480 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 05:23:20,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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:23:20,481 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-29 05:23:20,481 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 05:23:20,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:20,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:20,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:23:20,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:23:20,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:20,682 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:23:20,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:20,683 INFO L85 PathProgramCache]: Analyzing trace with hash -524787323, now seen corresponding path program 1 times [2023-11-29 05:23:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:20,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866503217] [2023-11-29 05:23:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:20,683 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:23:20,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:20,684 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:20,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:20,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:23:20,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:20,828 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:23:20,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:20,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:20,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866503217] [2023-11-29 05:23:20,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866503217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:20,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:20,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:23:20,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429784043] [2023-11-29 05:23:20,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:20,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:23:20,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:20,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:23:20,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:23:20,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 05:23:20,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have 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:23:20,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:20,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 05:23:20,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:22,145 INFO L124 PetriNetUnfolderBase]: 9971/15473 cut-off events. [2023-11-29 05:23:22,145 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-29 05:23:22,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29698 conditions, 15473 events. 9971/15473 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 111800 event pairs, 1033 based on Foata normal form. 400/15726 useless extension candidates. Maximal degree in co-relation 29688. Up to 8761 conditions per place. [2023-11-29 05:23:22,223 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 54 selfloop transitions, 6 changer transitions 1/81 dead transitions. [2023-11-29 05:23:22,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 304 flow [2023-11-29 05:23:22,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:23:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:23:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2023-11-29 05:23:22,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7234848484848485 [2023-11-29 05:23:22,225 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 191 transitions. [2023-11-29 05:23:22,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 191 transitions. [2023-11-29 05:23:22,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:22,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 191 transitions. [2023-11-29 05:23:22,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have 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:23:22,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:22,227 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:22,228 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 4 states and 191 transitions. [2023-11-29 05:23:22,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 304 flow [2023-11-29 05:23:22,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:23:22,239 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 148 flow [2023-11-29 05:23:22,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-11-29 05:23:22,240 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 05:23:22,240 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 148 flow [2023-11-29 05:23:22,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have 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:23:22,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:22,240 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:23:22,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:23:22,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:22,441 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:23:22,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1899385994, now seen corresponding path program 1 times [2023-11-29 05:23:22,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:22,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352301165] [2023-11-29 05:23:22,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:22,442 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:23:22,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:22,443 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:22,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:22,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:23:22,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:22,635 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:23:22,635 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:22,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:22,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352301165] [2023-11-29 05:23:22,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352301165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:22,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:22,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:23:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603769614] [2023-11-29 05:23:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:22,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:23:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:22,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:23:22,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:23:22,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 05:23:22,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:22,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:22,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 05:23:22,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:23,741 INFO L124 PetriNetUnfolderBase]: 7427/11573 cut-off events. [2023-11-29 05:23:23,742 INFO L125 PetriNetUnfolderBase]: For 2580/2580 co-relation queries the response was YES. [2023-11-29 05:23:23,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25501 conditions, 11573 events. 7427/11573 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 79477 event pairs, 451 based on Foata normal form. 364/11810 useless extension candidates. Maximal degree in co-relation 25488. Up to 5521 conditions per place. [2023-11-29 05:23:23,792 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 69 selfloop transitions, 10 changer transitions 1/100 dead transitions. [2023-11-29 05:23:23,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 431 flow [2023-11-29 05:23:23,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:23:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:23:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2023-11-29 05:23:23,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 05:23:23,794 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 242 transitions. [2023-11-29 05:23:23,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 242 transitions. [2023-11-29 05:23:23,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:23,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 242 transitions. [2023-11-29 05:23:23,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:23:23,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have 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:23:23,796 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have 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:23:23,797 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 148 flow. Second operand 5 states and 242 transitions. [2023-11-29 05:23:23,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 431 flow [2023-11-29 05:23:23,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 420 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:23:23,801 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 200 flow [2023-11-29 05:23:23,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-11-29 05:23:23,802 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 05:23:23,802 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 200 flow [2023-11-29 05:23:23,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:23:23,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:23,802 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:23:23,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 05:23:24,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:24,003 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:23:24,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:24,003 INFO L85 PathProgramCache]: Analyzing trace with hash 220587884, now seen corresponding path program 1 times [2023-11-29 05:23:24,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:24,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214646252] [2023-11-29 05:23:24,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:24,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:23:24,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:24,005 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:24,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:24,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:23:24,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:24,191 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:23:24,191 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:24,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:24,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214646252] [2023-11-29 05:23:24,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214646252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:24,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:24,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:23:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670734091] [2023-11-29 05:23:24,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:24,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:23:24,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:24,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:23:24,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:23:24,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 05:23:24,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have 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:23:24,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:24,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 05:23:24,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:25,009 INFO L124 PetriNetUnfolderBase]: 4491/6889 cut-off events. [2023-11-29 05:23:25,009 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2023-11-29 05:23:25,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17123 conditions, 6889 events. 4491/6889 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 41098 event pairs, 289 based on Foata normal form. 244/7017 useless extension candidates. Maximal degree in co-relation 17108. Up to 1969 conditions per place. [2023-11-29 05:23:25,045 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 82 selfloop transitions, 14 changer transitions 1/117 dead transitions. [2023-11-29 05:23:25,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 117 transitions, 562 flow [2023-11-29 05:23:25,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:23:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:23:25,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 291 transitions. [2023-11-29 05:23:25,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2023-11-29 05:23:25,047 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 291 transitions. [2023-11-29 05:23:25,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 291 transitions. [2023-11-29 05:23:25,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:25,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 291 transitions. [2023-11-29 05:23:25,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have 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:23:25,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:23:25,050 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:23:25,050 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 200 flow. Second operand 6 states and 291 transitions. [2023-11-29 05:23:25,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 117 transitions, 562 flow [2023-11-29 05:23:25,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 117 transitions, 532 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 05:23:25,077 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 250 flow [2023-11-29 05:23:25,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 05:23:25,077 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2023-11-29 05:23:25,077 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 250 flow [2023-11-29 05:23:25,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have 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:23:25,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:25,078 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:23:25,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:25,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:25,279 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:23:25,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1531281340, now seen corresponding path program 1 times [2023-11-29 05:23:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783037230] [2023-11-29 05:23:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:25,280 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:23:25,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:25,281 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:25,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:25,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:23:25,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:25,495 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:23:25,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:25,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:25,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783037230] [2023-11-29 05:23:25,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783037230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:23:25,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956934703] [2023-11-29 05:23:25,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:25,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:23:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:25,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:23:25,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:23:25,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 05:23:25,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have 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:23:25,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:23:25,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 05:23:25,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:23:26,369 INFO L124 PetriNetUnfolderBase]: 2927/4297 cut-off events. [2023-11-29 05:23:26,370 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2023-11-29 05:23:26,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11820 conditions, 4297 events. 2927/4297 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 22607 event pairs, 231 based on Foata normal form. 96/4277 useless extension candidates. Maximal degree in co-relation 11804. Up to 1316 conditions per place. [2023-11-29 05:23:26,397 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 73 selfloop transitions, 18 changer transitions 1/112 dead transitions. [2023-11-29 05:23:26,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 552 flow [2023-11-29 05:23:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:23:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:23:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 318 transitions. [2023-11-29 05:23:26,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2023-11-29 05:23:26,400 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 318 transitions. [2023-11-29 05:23:26,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 318 transitions. [2023-11-29 05:23:26,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:23:26,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 318 transitions. [2023-11-29 05:23:26,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.42857142857143) internal successors, (318), 7 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have 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:23:26,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:23:26,404 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:23:26,404 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 250 flow. Second operand 7 states and 318 transitions. [2023-11-29 05:23:26,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 552 flow [2023-11-29 05:23:26,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 112 transitions, 506 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 05:23:26,454 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 260 flow [2023-11-29 05:23:26,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-11-29 05:23:26,455 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 05:23:26,455 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 260 flow [2023-11-29 05:23:26,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have 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:23:26,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:26,455 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, 1] [2023-11-29 05:23:26,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:26,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:26,656 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:23:26,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1992692649, now seen corresponding path program 1 times [2023-11-29 05:23:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:26,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517268399] [2023-11-29 05:23:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:26,657 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:23:26,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:26,658 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:26,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:23:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:26,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 05:23:26,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:40,853 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:23:40,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:23:40,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:40,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517268399] [2023-11-29 05:23:40,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517268399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:23:40,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:23:40,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:23:40,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70434283] [2023-11-29 05:23:40,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:23:40,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:23:40,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:40,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:23:40,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=28, Unknown=3, NotChecked=0, Total=42 [2023-11-29 05:23:45,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:23:49,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:23:53,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:23:58,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:02,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:06,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:10,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:14,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:18,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:22,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:26,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:30,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:30,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2023-11-29 05:24:30,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have 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:24:30,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:24:30,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2023-11-29 05:24:30,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:24:34,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec, FloatRoundingMode], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:38,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:43,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:47,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:51,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:55,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:24:59,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:25:03,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:25:07,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:25:12,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:25:16,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:25:20,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:25:25,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:25:28,671 INFO L124 PetriNetUnfolderBase]: 1557/2738 cut-off events. [2023-11-29 05:25:28,671 INFO L125 PetriNetUnfolderBase]: For 1167/1263 co-relation queries the response was YES. [2023-11-29 05:25:28,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6213 conditions, 2738 events. 1557/2738 cut-off events. For 1167/1263 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16758 event pairs, 584 based on Foata normal form. 16/2574 useless extension candidates. Maximal degree in co-relation 6195. Up to 1876 conditions per place. [2023-11-29 05:25:28,689 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 38 selfloop transitions, 4 changer transitions 5/79 dead transitions. [2023-11-29 05:25:28,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 79 transitions, 390 flow [2023-11-29 05:25:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:25:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:25:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2023-11-29 05:25:28,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2023-11-29 05:25:28,693 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 216 transitions. [2023-11-29 05:25:28,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 216 transitions. [2023-11-29 05:25:28,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:28,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 216 transitions. [2023-11-29 05:25:28,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:28,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:25:28,695 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:25:28,695 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 260 flow. Second operand 7 states and 216 transitions. [2023-11-29 05:25:28,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 79 transitions, 390 flow [2023-11-29 05:25:28,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 294 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 05:25:28,708 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 168 flow [2023-11-29 05:25:28,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2023-11-29 05:25:28,708 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 05:25:28,708 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 168 flow [2023-11-29 05:25:28,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have 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:25:28,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:28,709 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, 1] [2023-11-29 05:25:28,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:28,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:28,909 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:25:28,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash -663516013, now seen corresponding path program 1 times [2023-11-29 05:25:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858057963] [2023-11-29 05:25:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:28,910 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:25:28,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:28,911 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:28,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:29,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 05:25:29,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:29,885 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:25:29,886 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:25:29,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:25:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858057963] [2023-11-29 05:25:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858057963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:29,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:29,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:25:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674884224] [2023-11-29 05:25:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:29,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:25:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:25:29,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:25:29,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:25:29,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:25:29,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 168 flow. Second operand has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:25:29,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:29,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:25:29,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:30,916 INFO L124 PetriNetUnfolderBase]: 2125/3563 cut-off events. [2023-11-29 05:25:30,916 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-11-29 05:25:30,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7071 conditions, 3563 events. 2125/3563 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 22436 event pairs, 419 based on Foata normal form. 16/3345 useless extension candidates. Maximal degree in co-relation 7059. Up to 1087 conditions per place. [2023-11-29 05:25:30,932 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 56 selfloop transitions, 5 changer transitions 16/112 dead transitions. [2023-11-29 05:25:30,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 112 transitions, 452 flow [2023-11-29 05:25:30,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:25:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:25:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 402 transitions. [2023-11-29 05:25:30,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6767676767676768 [2023-11-29 05:25:30,934 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 402 transitions. [2023-11-29 05:25:30,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 402 transitions. [2023-11-29 05:25:30,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:30,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 402 transitions. [2023-11-29 05:25:30,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.666666666666664) internal successors, (402), 9 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have 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:25:30,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:25:30,937 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:25:30,937 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 168 flow. Second operand 9 states and 402 transitions. [2023-11-29 05:25:30,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 112 transitions, 452 flow [2023-11-29 05:25:30,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 112 transitions, 435 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:25:30,939 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 184 flow [2023-11-29 05:25:30,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2023-11-29 05:25:30,940 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2023-11-29 05:25:30,940 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 184 flow [2023-11-29 05:25:30,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:25:30,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:30,940 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, 1] [2023-11-29 05:25:30,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:31,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:31,141 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:25:31,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:31,141 INFO L85 PathProgramCache]: Analyzing trace with hash -710677417, now seen corresponding path program 2 times [2023-11-29 05:25:31,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004485030] [2023-11-29 05:25:31,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:25:31,142 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:25:31,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:31,143 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:31,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:31,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:25:31,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:25:31,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:25:31,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:31,366 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:25:31,366 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:25:31,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:25:31,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004485030] [2023-11-29 05:25:31,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004485030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:31,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:31,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:25:31,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810935557] [2023-11-29 05:25:31,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:31,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:25:31,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:25:31,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:25:31,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:25:31,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:25:31,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:31,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:31,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:25:31,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:32,344 INFO L124 PetriNetUnfolderBase]: 4679/7625 cut-off events. [2023-11-29 05:25:32,344 INFO L125 PetriNetUnfolderBase]: For 959/959 co-relation queries the response was YES. [2023-11-29 05:25:32,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16170 conditions, 7625 events. 4679/7625 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 53561 event pairs, 1063 based on Foata normal form. 16/7148 useless extension candidates. Maximal degree in co-relation 16154. Up to 3127 conditions per place. [2023-11-29 05:25:32,387 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 53 selfloop transitions, 2 changer transitions 14/102 dead transitions. [2023-11-29 05:25:32,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 441 flow [2023-11-29 05:25:32,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:25:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:25:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2023-11-29 05:25:32,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6843434343434344 [2023-11-29 05:25:32,388 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 271 transitions. [2023-11-29 05:25:32,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 271 transitions. [2023-11-29 05:25:32,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:32,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 271 transitions. [2023-11-29 05:25:32,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have 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:25:32,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:25:32,391 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:25:32,391 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 184 flow. Second operand 6 states and 271 transitions. [2023-11-29 05:25:32,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 441 flow [2023-11-29 05:25:32,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 420 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-29 05:25:32,403 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 189 flow [2023-11-29 05:25:32,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2023-11-29 05:25:32,404 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2023-11-29 05:25:32,404 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 189 flow [2023-11-29 05:25:32,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:32,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:32,404 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, 1] [2023-11-29 05:25:32,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:32,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:32,605 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:25:32,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2066178811, now seen corresponding path program 3 times [2023-11-29 05:25:32,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:32,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17868837] [2023-11-29 05:25:32,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:25:32,606 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:25:32,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:32,607 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:32,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:32,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 05:25:32,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:25:32,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:25:32,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:32,814 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:25:32,815 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:25:32,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:25:32,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17868837] [2023-11-29 05:25:32,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17868837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:32,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:32,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:25:32,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932436162] [2023-11-29 05:25:32,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:32,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:25:32,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:25:32,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:25:32,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:25:32,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:25:32,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:32,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:32,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:25:32,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:34,425 INFO L124 PetriNetUnfolderBase]: 9173/14907 cut-off events. [2023-11-29 05:25:34,425 INFO L125 PetriNetUnfolderBase]: For 1090/1090 co-relation queries the response was YES. [2023-11-29 05:25:34,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31343 conditions, 14907 events. 9173/14907 cut-off events. For 1090/1090 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 113800 event pairs, 1396 based on Foata normal form. 16/13918 useless extension candidates. Maximal degree in co-relation 31327. Up to 5650 conditions per place. [2023-11-29 05:25:34,494 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 49 selfloop transitions, 2 changer transitions 15/100 dead transitions. [2023-11-29 05:25:34,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 425 flow [2023-11-29 05:25:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:25:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:25:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 268 transitions. [2023-11-29 05:25:34,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6767676767676768 [2023-11-29 05:25:34,497 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 268 transitions. [2023-11-29 05:25:34,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 268 transitions. [2023-11-29 05:25:34,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:34,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 268 transitions. [2023-11-29 05:25:34,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have 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:25:34,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:25:34,499 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:25:34,499 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 189 flow. Second operand 6 states and 268 transitions. [2023-11-29 05:25:34,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 425 flow [2023-11-29 05:25:34,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 100 transitions, 418 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 05:25:34,503 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 196 flow [2023-11-29 05:25:34,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2023-11-29 05:25:34,504 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2023-11-29 05:25:34,504 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 196 flow [2023-11-29 05:25:34,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:34,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:34,504 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, 1] [2023-11-29 05:25:34,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:34,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:34,705 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:25:34,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:34,705 INFO L85 PathProgramCache]: Analyzing trace with hash -544203241, now seen corresponding path program 4 times [2023-11-29 05:25:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:34,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901033453] [2023-11-29 05:25:34,706 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:25:34,706 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:25:34,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:34,707 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:34,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:34,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:25:34,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:25:34,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:25:34,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:34,876 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:25:34,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:25:34,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:25:34,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901033453] [2023-11-29 05:25:34,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901033453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:25:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283411657] [2023-11-29 05:25:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:34,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:25:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:25:34,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:25:34,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:34,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:25:34,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have 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:25:34,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:34,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:25:34,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:36,737 INFO L124 PetriNetUnfolderBase]: 10845/17570 cut-off events. [2023-11-29 05:25:36,738 INFO L125 PetriNetUnfolderBase]: For 1372/1372 co-relation queries the response was YES. [2023-11-29 05:25:36,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36912 conditions, 17570 events. 10845/17570 cut-off events. For 1372/1372 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 137778 event pairs, 3972 based on Foata normal form. 16/16355 useless extension candidates. Maximal degree in co-relation 36894. Up to 7234 conditions per place. [2023-11-29 05:25:36,827 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 32 selfloop transitions, 2 changer transitions 19/87 dead transitions. [2023-11-29 05:25:36,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 87 transitions, 367 flow [2023-11-29 05:25:36,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:25:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:25:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2023-11-29 05:25:36,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6757575757575758 [2023-11-29 05:25:36,828 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 223 transitions. [2023-11-29 05:25:36,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 223 transitions. [2023-11-29 05:25:36,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:36,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 223 transitions. [2023-11-29 05:25:36,830 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:25:36,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have 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:25:36,831 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have 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:25:36,831 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 196 flow. Second operand 5 states and 223 transitions. [2023-11-29 05:25:36,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 87 transitions, 367 flow [2023-11-29 05:25:36,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 87 transitions, 356 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-29 05:25:36,835 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 195 flow [2023-11-29 05:25:36,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2023-11-29 05:25:36,835 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2023-11-29 05:25:36,836 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 195 flow [2023-11-29 05:25:36,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have 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:25:36,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:36,836 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, 1] [2023-11-29 05:25:36,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:37,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:37,036 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:25:37,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2052226949, now seen corresponding path program 5 times [2023-11-29 05:25:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:37,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102100977] [2023-11-29 05:25:37,037 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:25:37,037 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:25:37,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:37,038 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:37,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:37,194 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:25:37,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 05:25:37,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:25:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:25:37,380 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 05:25:37,380 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:25:37,381 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:25:37,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:25:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:25:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:25:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:25:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:25:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:25:37,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:25:37,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:25:37,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:25:37,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:25:37,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:25:37,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:25:37,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:25:37,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:25:37,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:25:37,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:37,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/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:25:37,591 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:25:37,597 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:25:37,597 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:25:37,666 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:25:37,670 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:25:37,673 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:25:37,675 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:25:37,690 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:25:37,691 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:25:37,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:25:37 BasicIcfg [2023-11-29 05:25:37,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:25:37,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:25:37,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:25:37,707 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:25:37,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:23:09" (3/4) ... [2023-11-29 05:25:37,709 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:25:37,710 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:25:37,711 INFO L158 Benchmark]: Toolchain (without parser) took 150059.16ms. Allocated memory was 83.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 55.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 445.0MB. Max. memory is 16.1GB. [2023-11-29 05:25:37,711 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 56.6MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:25:37,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.19ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 49.3MB in the end (delta: 5.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:25:37,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.58ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 46.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:25:37,712 INFO L158 Benchmark]: Boogie Preprocessor took 61.86ms. Allocated memory is still 83.9MB. Free memory was 46.9MB in the beginning and 42.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:25:37,712 INFO L158 Benchmark]: RCFGBuilder took 877.47ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 29.4MB in the end (delta: 13.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2023-11-29 05:25:37,713 INFO L158 Benchmark]: TraceAbstraction took 148462.43ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 75.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 445.2MB. Max. memory is 16.1GB. [2023-11-29 05:25:37,713 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:25:37,715 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.33ms. Allocated memory is still 56.6MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.19ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 49.3MB in the end (delta: 5.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.58ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 46.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.86ms. Allocated memory is still 83.9MB. Free memory was 46.9MB in the beginning and 42.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 877.47ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 29.4MB in the end (delta: 13.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 148462.43ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 75.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 445.2MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t681; [L867] FCALL, FORK 0 pthread_create(&t681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, t681={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L868] 0 pthread_t t682; [L869] FCALL, FORK 0 pthread_create(&t682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, t681={3:0}, t682={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L788] 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) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 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 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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] [L870] 0 pthread_t t683; [L871] FCALL, FORK 0 pthread_create(&t683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, t681={3:0}, t682={7:0}, t683={-2147483646:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L872] 0 pthread_t t684; [L873] FCALL, FORK 0 pthread_create(&t684, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, t681={3:0}, t682={7:0}, t683={-2147483646:0}, t684={-2147483645:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L808] 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) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 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 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 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) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L768] 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) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 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 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L844] 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) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 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 [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, t681={3:0}, t682={7:0}, t683={-2147483646:0}, t684={-2147483645:0}, weak$$choice2=0, x=1, y=1, z=2] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 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 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, t681={3:0}, t682={7:0}, t683={-2147483646:0}, t684={-2147483645:0}, weak$$choice2=0, x=1, y=1, z=2] [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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, t681={3:0}, t682={7:0}, t683={-2147483646:0}, t684={-2147483645:0}, weak$$choice2=0, x=1, y=1, z=2] [L888] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] [L17] 0 __assert_fail ("0", "mix026.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_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=1, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: 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: 867]: 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: 871]: 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: 873]: 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, 99 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: 148.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 126.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 45 mSolverCounterUnknown, 965 SdHoareTripleChecker+Valid, 111.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 809 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 110.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2560 IncrementalHoareTripleChecker+Invalid, 2664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 30 mSDtfsCounter, 2560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 386 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=13, 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, 15.6s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 363 ConstructedInterpolants, 34 QuantifiedInterpolants, 8062 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2537 ConjunctsInSsa, 102 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:25:37,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5ee6146-2aea-4ab1-b4ba-3c7cac00358c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample