./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036.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_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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 e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:01:23,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:01:23,596 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:01:23,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:01:23,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:01:23,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:01:23,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:01:23,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:01:23,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:01:23,626 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:01:23,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:01:23,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:01:23,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:01:23,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:01:23,629 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:01:23,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:01:23,630 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:01:23,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:01:23,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:01:23,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:01:23,632 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:01:23,633 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:01:23,633 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:01:23,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:01:23,634 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:01:23,634 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:01:23,635 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:01:23,635 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:01:23,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:01:23,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:01:23,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:01:23,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:01:23,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:01:23,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:01:23,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:01:23,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:01:23,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:01:23,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:01:23,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:01:23,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:01:23,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:01:23,639 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_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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 -> e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 [2023-11-29 02:01:23,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:01:23,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:01:23,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:01:23,895 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:01:23,895 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:01:23,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2023-11-29 02:01:26,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:01:26,892 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:01:26,892 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2023-11-29 02:01:26,911 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/data/3c6496a43/67ac92d306814b609db2965c311749ad/FLAGdea570ec8 [2023-11-29 02:01:26,923 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/data/3c6496a43/67ac92d306814b609db2965c311749ad [2023-11-29 02:01:26,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:01:26,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:01:26,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:01:26,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:01:26,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:01:26,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:01:26" (1/1) ... [2023-11-29 02:01:26,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35de97a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:26, skipping insertion in model container [2023-11-29 02:01:26,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:01:26" (1/1) ... [2023-11-29 02:01:26,982 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:01:27,302 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:01:27,314 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:01:27,378 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:01:27,412 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:01:27,412 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:01:27,420 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:01:27,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27 WrapperNode [2023-11-29 02:01:27,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:01:27,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:01:27,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:01:27,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:01:27,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,475 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-11-29 02:01:27,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:01:27,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:01:27,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:01:27,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:01:27,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,512 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 02:01:27,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:01:27,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:01:27,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:01:27,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:01:27,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (1/1) ... [2023-11-29 02:01:27,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:01:27,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:01:27,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:01:27,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:01:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:01:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:01:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 02:01:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 02:01:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 02:01:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 02:01:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:01:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:01:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:01:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 02:01:27,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 02:01:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 02:01:27,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 02:01:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 02:01:27,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 02:01:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 02:01:27,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 02:01:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:01:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:01:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:01:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 02:01:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 02:01:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 02:01:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:01:27,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:01:27,608 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 02:01:27,767 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:01:27,769 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:01:28,093 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:01:28,328 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:01:28,329 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:01:28,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:01:28 BoogieIcfgContainer [2023-11-29 02:01:28,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:01:28,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:01:28,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:01:28,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:01:28,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:01:26" (1/3) ... [2023-11-29 02:01:28,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba2a533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:01:28, skipping insertion in model container [2023-11-29 02:01:28,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:01:27" (2/3) ... [2023-11-29 02:01:28,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba2a533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:01:28, skipping insertion in model container [2023-11-29 02:01:28,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:01:28" (3/3) ... [2023-11-29 02:01:28,337 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2023-11-29 02:01:28,356 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:01:28,357 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 02:01:28,357 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:01:28,412 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:01:28,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 02:01:28,482 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 02:01:28,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:01:28,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 138 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-29 02:01:28,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 02:01:28,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 02:01:28,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:01:28,506 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;@1284074f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:01:28,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 02:01:28,509 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:01:28,510 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 02:01:28,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:01:28,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:28,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:01:28,511 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 02:01:28,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash 14515, now seen corresponding path program 1 times [2023-11-29 02:01:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:28,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147087510] [2023-11-29 02:01:28,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:28,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:28,768 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 02:01:28,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:28,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147087510] [2023-11-29 02:01:28,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147087510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:28,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:28,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:01:28,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049984645] [2023-11-29 02:01:28,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:28,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:01:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:28,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:01:28,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:01:28,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 02:01:28,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 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 02:01:28,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:28,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 02:01:28,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:30,344 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-29 02:01:30,344 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 02:01:30,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13210 conditions, 7283 events. 4217/7283 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54415 event pairs, 3179 based on Foata normal form. 360/7021 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-29 02:01:30,435 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-29 02:01:30,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 228 flow [2023-11-29 02:01:30,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:01:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:01:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 02:01:30,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 02:01:30,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 02:01:30,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 02:01:30,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:30,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 02:01:30,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:30,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:30,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:30,464 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 149 transitions. [2023-11-29 02:01:30,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 228 flow [2023-11-29 02:01:30,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:01:30,476 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 02:01:30,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-29 02:01:30,482 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 02:01:30,483 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 02:01:30,483 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 02:01:30,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:30,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:01:30,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:01:30,484 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 02:01:30,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:30,485 INFO L85 PathProgramCache]: Analyzing trace with hash 14516, now seen corresponding path program 1 times [2023-11-29 02:01:30,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:30,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936553489] [2023-11-29 02:01:30,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:30,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:30,609 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 02:01:30,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:30,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936553489] [2023-11-29 02:01:30,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936553489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:30,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:30,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:01:30,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279503018] [2023-11-29 02:01:30,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:30,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:01:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:30,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:01:30,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:01:30,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 02:01:30,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 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 02:01:30,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:30,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 02:01:30,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:31,714 INFO L124 PetriNetUnfolderBase]: 4217/7217 cut-off events. [2023-11-29 02:01:31,714 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 02:01:31,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13322 conditions, 7217 events. 4217/7217 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 54347 event pairs, 4213 based on Foata normal form. 0/6607 useless extension candidates. Maximal degree in co-relation 13310. Up to 5783 conditions per place. [2023-11-29 02:01:31,793 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 02:01:31,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 62 transitions, 198 flow [2023-11-29 02:01:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:01:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:01:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-29 02:01:31,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6965174129353234 [2023-11-29 02:01:31,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-29 02:01:31,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-29 02:01:31,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:31,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-29 02:01:31,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:31,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:31,799 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:31,800 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 140 transitions. [2023-11-29 02:01:31,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 62 transitions, 198 flow [2023-11-29 02:01:31,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:01:31,808 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 02:01:31,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:01:31,810 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 02:01:31,810 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 02:01:31,810 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 02:01:31,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:31,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:01:31,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:01:31,811 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 02:01:31,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:31,812 INFO L85 PathProgramCache]: Analyzing trace with hash 432858845, now seen corresponding path program 1 times [2023-11-29 02:01:31,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:31,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669600192] [2023-11-29 02:01:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:31,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:31,878 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 02:01:31,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669600192] [2023-11-29 02:01:31,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669600192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:31,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:31,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:01:31,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193790021] [2023-11-29 02:01:31,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:31,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:01:31,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:31,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:01:31,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:01:31,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 02:01:31,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 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 02:01:31,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:31,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 02:01:31,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:32,834 INFO L124 PetriNetUnfolderBase]: 4221/7240 cut-off events. [2023-11-29 02:01:32,834 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 02:01:32,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13178 conditions, 7240 events. 4221/7240 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 54504 event pairs, 2877 based on Foata normal form. 0/6629 useless extension candidates. Maximal degree in co-relation 13167. Up to 4393 conditions per place. [2023-11-29 02:01:32,894 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 02:01:32,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 224 flow [2023-11-29 02:01:32,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:01:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:01:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2023-11-29 02:01:32,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-29 02:01:32,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 147 transitions. [2023-11-29 02:01:32,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 147 transitions. [2023-11-29 02:01:32,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:32,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 147 transitions. [2023-11-29 02:01:32,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:32,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:32,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:32,901 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 147 transitions. [2023-11-29 02:01:32,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 224 flow [2023-11-29 02:01:32,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:01:32,903 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 02:01:32,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:01:32,905 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 02:01:32,905 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 02:01:32,905 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 02:01:32,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:32,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:01:32,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:01:32,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:01:32,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:32,907 INFO L85 PathProgramCache]: Analyzing trace with hash 432859340, now seen corresponding path program 1 times [2023-11-29 02:01:32,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:32,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005674242] [2023-11-29 02:01:32,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:32,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:33,017 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 02:01:33,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:33,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005674242] [2023-11-29 02:01:33,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005674242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:33,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:33,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:01:33,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948864305] [2023-11-29 02:01:33,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:33,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:01:33,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:33,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:01:33,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:01:33,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 02:01:33,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:33,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:33,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 02:01:33,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:33,763 INFO L124 PetriNetUnfolderBase]: 3311/5254 cut-off events. [2023-11-29 02:01:33,764 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 02:01:33,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10079 conditions, 5254 events. 3311/5254 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 33812 event pairs, 2177 based on Foata normal form. 0/5190 useless extension candidates. Maximal degree in co-relation 10069. Up to 3661 conditions per place. [2023-11-29 02:01:33,793 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 41 selfloop transitions, 2 changer transitions 2/76 dead transitions. [2023-11-29 02:01:33,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 264 flow [2023-11-29 02:01:33,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:01:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:01:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-29 02:01:33,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7960199004975125 [2023-11-29 02:01:33,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-29 02:01:33,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-29 02:01:33,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:33,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-29 02:01:33,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:33,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:33,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:33,799 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 160 transitions. [2023-11-29 02:01:33,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 264 flow [2023-11-29 02:01:33,801 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 02:01:33,803 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 122 flow [2023-11-29 02:01:33,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:01:33,804 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 02:01:33,804 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 122 flow [2023-11-29 02:01:33,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:33,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:33,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:01:33,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:01:33,805 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 02:01:33,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:33,806 INFO L85 PathProgramCache]: Analyzing trace with hash 432858846, now seen corresponding path program 1 times [2023-11-29 02:01:33,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:33,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392871025] [2023-11-29 02:01:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:33,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:33,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 02:01:33,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392871025] [2023-11-29 02:01:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392871025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:33,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:33,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:01:33,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438919327] [2023-11-29 02:01:33,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:33,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:01:33,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:33,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:01:33,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:01:33,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 02:01:33,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:33,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:33,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 02:01:33,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:34,500 INFO L124 PetriNetUnfolderBase]: 2903/5161 cut-off events. [2023-11-29 02:01:34,500 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2023-11-29 02:01:34,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9565 conditions, 5161 events. 2903/5161 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 37995 event pairs, 2492 based on Foata normal form. 4/4930 useless extension candidates. Maximal degree in co-relation 9554. Up to 3459 conditions per place. [2023-11-29 02:01:34,544 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 02:01:34,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 210 flow [2023-11-29 02:01:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:01:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:01:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 02:01:34,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 02:01:34,546 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 02:01:34,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 02:01:34,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:34,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 02:01:34,547 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 02:01:34,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:34,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:34,549 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 146 transitions. [2023-11-29 02:01:34,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 210 flow [2023-11-29 02:01:34,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:01:34,552 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 02:01:34,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:01:34,553 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-29 02:01:34,553 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 02:01:34,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:34,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:34,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:34,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:01:34,554 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 02:01:34,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1806474852, now seen corresponding path program 1 times [2023-11-29 02:01:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:34,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188266500] [2023-11-29 02:01:34,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:34,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:34,612 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 02:01:34,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:34,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188266500] [2023-11-29 02:01:34,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188266500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:34,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:34,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:01:34,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914906938] [2023-11-29 02:01:34,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:34,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:01:34,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:34,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:01:34,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:01:34,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 02:01:34,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 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 02:01:34,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:34,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 02:01:34,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:35,208 INFO L124 PetriNetUnfolderBase]: 2920/5209 cut-off events. [2023-11-29 02:01:35,208 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 02:01:35,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9511 conditions, 5209 events. 2920/5209 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 38266 event pairs, 1356 based on Foata normal form. 0/4999 useless extension candidates. Maximal degree in co-relation 9501. Up to 3460 conditions per place. [2023-11-29 02:01:35,233 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 02:01:35,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 208 flow [2023-11-29 02:01:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:01:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:01:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 02:01:35,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 02:01:35,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 02:01:35,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 02:01:35,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:35,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 02:01:35,235 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 02:01:35,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:35,236 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:35,237 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-29 02:01:35,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 208 flow [2023-11-29 02:01:35,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:01:35,240 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 02:01:35,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:01:35,241 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 02:01:35,242 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 02:01:35,242 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 02:01:35,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:35,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:35,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:01:35,242 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 02:01:35,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:35,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1806474853, now seen corresponding path program 1 times [2023-11-29 02:01:35,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:35,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682029369] [2023-11-29 02:01:35,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:35,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:35,313 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 02:01:35,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:35,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682029369] [2023-11-29 02:01:35,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682029369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:35,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:35,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:01:35,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510185627] [2023-11-29 02:01:35,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:35,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:01:35,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:35,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:01:35,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:01:35,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 02:01:35,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:35,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:35,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 02:01:35,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:36,040 INFO L124 PetriNetUnfolderBase]: 2903/5128 cut-off events. [2023-11-29 02:01:36,040 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:01:36,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9409 conditions, 5128 events. 2903/5128 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37262 event pairs, 1884 based on Foata normal form. 12/4933 useless extension candidates. Maximal degree in co-relation 9399. Up to 3431 conditions per place. [2023-11-29 02:01:36,069 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 02:01:36,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-29 02:01:36,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:01:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:01:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 02:01:36,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 02:01:36,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 02:01:36,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 02:01:36,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:36,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 02:01:36,073 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 02:01:36,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:36,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:36,075 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-29 02:01:36,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-29 02:01:36,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:01:36,079 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 02:01:36,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:01:36,080 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 02:01:36,081 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 02:01:36,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:36,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:36,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:36,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:01:36,081 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 02:01:36,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash 752540074, now seen corresponding path program 1 times [2023-11-29 02:01:36,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:36,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316293007] [2023-11-29 02:01:36,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:36,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:36,141 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 02:01:36,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:36,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316293007] [2023-11-29 02:01:36,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316293007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:36,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:36,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:01:36,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721116613] [2023-11-29 02:01:36,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:36,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:01:36,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:36,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:01:36,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:01:36,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 02:01:36,163 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.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 02:01:36,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:36,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 02:01:36,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:36,957 INFO L124 PetriNetUnfolderBase]: 2978/5159 cut-off events. [2023-11-29 02:01:36,957 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:01:36,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 5159 events. 2978/5159 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 36992 event pairs, 1424 based on Foata normal form. 0/5016 useless extension candidates. Maximal degree in co-relation 9541. Up to 3426 conditions per place. [2023-11-29 02:01:37,001 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 02:01:37,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-29 02:01:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:01:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:01:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 02:01:37,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 02:01:37,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 02:01:37,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 02:01:37,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:37,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 02:01:37,004 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 02:01:37,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:37,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:37,005 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 144 transitions. [2023-11-29 02:01:37,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-29 02:01:37,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:01:37,008 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 02:01:37,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:01:37,009 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 02:01:37,009 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 02:01:37,009 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 02:01:37,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:37,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:37,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:01:37,010 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 02:01:37,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash 752540075, now seen corresponding path program 1 times [2023-11-29 02:01:37,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:37,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038198020] [2023-11-29 02:01:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:37,110 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 02:01:37,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:37,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038198020] [2023-11-29 02:01:37,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038198020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:37,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:37,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:01:37,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47413023] [2023-11-29 02:01:37,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:37,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:01:37,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:37,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:01:37,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:01:37,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 02:01:37,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:37,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:37,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 02:01:37,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:37,779 INFO L124 PetriNetUnfolderBase]: 2903/5108 cut-off events. [2023-11-29 02:01:37,780 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 02:01:37,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9413 conditions, 5108 events. 2903/5108 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 36964 event pairs, 920 based on Foata normal form. 36/5013 useless extension candidates. Maximal degree in co-relation 9403. Up to 3315 conditions per place. [2023-11-29 02:01:37,803 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 02:01:37,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-29 02:01:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:01:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:01:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 02:01:37,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 02:01:37,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 02:01:37,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 02:01:37,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:37,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 02:01:37,806 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 02:01:37,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:37,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:01:37,807 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 146 transitions. [2023-11-29 02:01:37,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-29 02:01:37,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:01:37,809 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 02:01:37,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:01:37,810 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-29 02:01:37,810 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 02:01:37,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:37,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:37,811 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 02:01:37,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:01:37,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:01:37,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:37,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1982496767, now seen corresponding path program 1 times [2023-11-29 02:01:37,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:37,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558549264] [2023-11-29 02:01:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:37,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:38,601 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 02:01:38,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:38,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558549264] [2023-11-29 02:01:38,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558549264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:38,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:38,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:01:38,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34703865] [2023-11-29 02:01:38,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:38,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:01:38,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:38,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:01:38,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:01:39,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 02:01:39,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 11 states, 11 states have (on average 34.63636363636363) internal successors, (381), 11 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:39,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:39,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 02:01:39,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:40,064 INFO L124 PetriNetUnfolderBase]: 3664/5653 cut-off events. [2023-11-29 02:01:40,064 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2023-11-29 02:01:40,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11024 conditions, 5653 events. 3664/5653 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 36004 event pairs, 0 based on Foata normal form. 180/5781 useless extension candidates. Maximal degree in co-relation 11013. Up to 3384 conditions per place. [2023-11-29 02:01:40,094 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 49 selfloop transitions, 5 changer transitions 13/88 dead transitions. [2023-11-29 02:01:40,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 88 transitions, 324 flow [2023-11-29 02:01:40,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:01:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 02:01:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 332 transitions. [2023-11-29 02:01:40,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6194029850746269 [2023-11-29 02:01:40,097 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 332 transitions. [2023-11-29 02:01:40,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 332 transitions. [2023-11-29 02:01:40,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:40,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 332 transitions. [2023-11-29 02:01:40,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:40,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:40,100 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:40,100 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 8 states and 332 transitions. [2023-11-29 02:01:40,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 88 transitions, 324 flow [2023-11-29 02:01:40,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:01:40,103 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 114 flow [2023-11-29 02:01:40,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-11-29 02:01:40,104 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-29 02:01:40,104 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 114 flow [2023-11-29 02:01:40,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.63636363636363) internal successors, (381), 11 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:40,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:40,105 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 02:01:40,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:01:40,105 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 02:01:40,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1982498332, now seen corresponding path program 1 times [2023-11-29 02:01:40,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:40,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260760798] [2023-11-29 02:01:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:40,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:40,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:40,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260760798] [2023-11-29 02:01:40,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260760798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:40,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:40,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:01:40,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237267192] [2023-11-29 02:01:40,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:40,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:01:40,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:40,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:01:40,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:01:40,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 67 [2023-11-29 02:01:40,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:40,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:40,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 67 [2023-11-29 02:01:40,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:42,285 INFO L124 PetriNetUnfolderBase]: 13249/19677 cut-off events. [2023-11-29 02:01:42,285 INFO L125 PetriNetUnfolderBase]: For 972/972 co-relation queries the response was YES. [2023-11-29 02:01:42,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38722 conditions, 19677 events. 13249/19677 cut-off events. For 972/972 co-relation queries the response was YES. Maximal size of possible extension queue 1022. Compared 138541 event pairs, 7720 based on Foata normal form. 0/19263 useless extension candidates. Maximal degree in co-relation 38711. Up to 11671 conditions per place. [2023-11-29 02:01:42,367 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 37 selfloop transitions, 5 changer transitions 58/119 dead transitions. [2023-11-29 02:01:42,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 119 transitions, 480 flow [2023-11-29 02:01:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:01:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 02:01:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 358 transitions. [2023-11-29 02:01:42,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.667910447761194 [2023-11-29 02:01:42,370 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 358 transitions. [2023-11-29 02:01:42,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 358 transitions. [2023-11-29 02:01:42,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:42,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 358 transitions. [2023-11-29 02:01:42,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 44.75) internal successors, (358), 8 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:42,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:42,373 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:42,373 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 114 flow. Second operand 8 states and 358 transitions. [2023-11-29 02:01:42,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 119 transitions, 480 flow [2023-11-29 02:01:42,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 119 transitions, 459 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 02:01:42,377 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 161 flow [2023-11-29 02:01:42,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=161, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2023-11-29 02:01:42,378 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 02:01:42,378 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 161 flow [2023-11-29 02:01:42,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:42,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:42,379 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 02:01:42,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:01:42,379 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 02:01:42,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:42,379 INFO L85 PathProgramCache]: Analyzing trace with hash 725938540, now seen corresponding path program 1 times [2023-11-29 02:01:42,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:42,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146384606] [2023-11-29 02:01:42,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:42,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:42,583 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 02:01:42,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:42,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146384606] [2023-11-29 02:01:42,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146384606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:42,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:42,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:01:42,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639047224] [2023-11-29 02:01:42,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:42,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:01:42,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:42,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:01:42,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:01:42,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 67 [2023-11-29 02:01:42,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:42,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:42,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 67 [2023-11-29 02:01:42,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:44,511 INFO L124 PetriNetUnfolderBase]: 10019/14964 cut-off events. [2023-11-29 02:01:44,511 INFO L125 PetriNetUnfolderBase]: For 14343/14348 co-relation queries the response was YES. [2023-11-29 02:01:44,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40373 conditions, 14964 events. 10019/14964 cut-off events. For 14343/14348 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 100366 event pairs, 1683 based on Foata normal form. 390/15200 useless extension candidates. Maximal degree in co-relation 40357. Up to 9073 conditions per place. [2023-11-29 02:01:44,616 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 42 selfloop transitions, 3 changer transitions 51/115 dead transitions. [2023-11-29 02:01:44,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 115 transitions, 595 flow [2023-11-29 02:01:44,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:01:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:01:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 318 transitions. [2023-11-29 02:01:44,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6780383795309168 [2023-11-29 02:01:44,619 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 318 transitions. [2023-11-29 02:01:44,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 318 transitions. [2023-11-29 02:01:44,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:44,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 318 transitions. [2023-11-29 02:01:44,621 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 02:01:44,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:44,623 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:44,623 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 161 flow. Second operand 7 states and 318 transitions. [2023-11-29 02:01:44,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 115 transitions, 595 flow [2023-11-29 02:01:44,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 582 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-29 02:01:44,797 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 171 flow [2023-11-29 02:01:44,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2023-11-29 02:01:44,798 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -2 predicate places. [2023-11-29 02:01:44,798 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 171 flow [2023-11-29 02:01:44,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:44,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:44,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:44,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:01:44,799 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 02:01:44,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash -342090790, now seen corresponding path program 1 times [2023-11-29 02:01:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:44,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454178472] [2023-11-29 02:01:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:44,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:44,945 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 02:01:44,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454178472] [2023-11-29 02:01:44,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454178472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:44,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:44,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:01:44,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936455651] [2023-11-29 02:01:44,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:44,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:01:44,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:44,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:01:44,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:01:44,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 02:01:44,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 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 02:01:44,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:44,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 02:01:44,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:47,202 INFO L124 PetriNetUnfolderBase]: 15258/22721 cut-off events. [2023-11-29 02:01:47,202 INFO L125 PetriNetUnfolderBase]: For 9639/9853 co-relation queries the response was YES. [2023-11-29 02:01:47,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51229 conditions, 22721 events. 15258/22721 cut-off events. For 9639/9853 co-relation queries the response was YES. Maximal size of possible extension queue 1225. Compared 158744 event pairs, 2488 based on Foata normal form. 681/22528 useless extension candidates. Maximal degree in co-relation 51209. Up to 11856 conditions per place. [2023-11-29 02:01:47,340 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 54 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2023-11-29 02:01:47,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 83 transitions, 361 flow [2023-11-29 02:01:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:01:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 02:01:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2023-11-29 02:01:47,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7238805970149254 [2023-11-29 02:01:47,342 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 194 transitions. [2023-11-29 02:01:47,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 194 transitions. [2023-11-29 02:01:47,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:47,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 194 transitions. [2023-11-29 02:01:47,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:47,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 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 02:01:47,343 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 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 02:01:47,343 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 171 flow. Second operand 4 states and 194 transitions. [2023-11-29 02:01:47,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 83 transitions, 361 flow [2023-11-29 02:01:47,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 347 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-29 02:01:47,693 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 203 flow [2023-11-29 02:01:47,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-29 02:01:47,693 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 02:01:47,694 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 203 flow [2023-11-29 02:01:47,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 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 02:01:47,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:47,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:47,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:01:47,694 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 02:01:47,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash 133869979, now seen corresponding path program 1 times [2023-11-29 02:01:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:47,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837763008] [2023-11-29 02:01:47,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:47,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:47,893 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 02:01:47,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:47,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837763008] [2023-11-29 02:01:47,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837763008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:47,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:47,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:01:47,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799102525] [2023-11-29 02:01:47,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:47,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:01:47,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:47,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:01:47,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:01:47,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 02:01:47,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:47,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:47,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 02:01:47,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:49,876 INFO L124 PetriNetUnfolderBase]: 12088/18089 cut-off events. [2023-11-29 02:01:49,876 INFO L125 PetriNetUnfolderBase]: For 6166/6314 co-relation queries the response was YES. [2023-11-29 02:01:49,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43476 conditions, 18089 events. 12088/18089 cut-off events. For 6166/6314 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 121927 event pairs, 1485 based on Foata normal form. 602/17959 useless extension candidates. Maximal degree in co-relation 43458. Up to 6665 conditions per place. [2023-11-29 02:01:50,006 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 70 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2023-11-29 02:01:50,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 103 transitions, 486 flow [2023-11-29 02:01:50,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:01:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:01:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2023-11-29 02:01:50,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2023-11-29 02:01:50,008 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2023-11-29 02:01:50,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2023-11-29 02:01:50,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:50,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2023-11-29 02:01:50,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:50,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 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 02:01:50,010 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 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 02:01:50,010 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 203 flow. Second operand 5 states and 247 transitions. [2023-11-29 02:01:50,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 103 transitions, 486 flow [2023-11-29 02:01:50,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 103 transitions, 483 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:01:50,015 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 268 flow [2023-11-29 02:01:50,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2023-11-29 02:01:50,016 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -2 predicate places. [2023-11-29 02:01:50,016 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 268 flow [2023-11-29 02:01:50,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:50,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:50,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:50,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:01:50,017 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 02:01:50,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1816130216, now seen corresponding path program 1 times [2023-11-29 02:01:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:50,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656017100] [2023-11-29 02:01:50,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:50,627 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 02:01:50,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:50,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656017100] [2023-11-29 02:01:50,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656017100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:50,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:50,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:01:50,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409054184] [2023-11-29 02:01:50,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:50,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:01:50,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:50,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:01:50,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:01:50,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 02:01:50,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 268 flow. Second operand has 8 states, 8 states have (on average 38.25) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:50,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:50,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 02:01:50,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:53,676 INFO L124 PetriNetUnfolderBase]: 16281/27127 cut-off events. [2023-11-29 02:01:53,677 INFO L125 PetriNetUnfolderBase]: For 19049/24522 co-relation queries the response was YES. [2023-11-29 02:01:53,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69609 conditions, 27127 events. 16281/27127 cut-off events. For 19049/24522 co-relation queries the response was YES. Maximal size of possible extension queue 1640. Compared 231174 event pairs, 5760 based on Foata normal form. 406/25387 useless extension candidates. Maximal degree in co-relation 69588. Up to 9870 conditions per place. [2023-11-29 02:01:53,844 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 85 selfloop transitions, 15 changer transitions 14/151 dead transitions. [2023-11-29 02:01:53,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 151 transitions, 752 flow [2023-11-29 02:01:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:01:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 02:01:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 512 transitions. [2023-11-29 02:01:53,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.694708276797829 [2023-11-29 02:01:53,846 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 512 transitions. [2023-11-29 02:01:53,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 512 transitions. [2023-11-29 02:01:53,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:53,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 512 transitions. [2023-11-29 02:01:53,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 46.54545454545455) internal successors, (512), 11 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:53,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 67.0) internal successors, (804), 12 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:53,849 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 67.0) internal successors, (804), 12 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:53,850 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 268 flow. Second operand 11 states and 512 transitions. [2023-11-29 02:01:53,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 151 transitions, 752 flow [2023-11-29 02:01:53,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 151 transitions, 737 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-29 02:01:53,857 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 370 flow [2023-11-29 02:01:53,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=370, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2023-11-29 02:01:53,857 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 14 predicate places. [2023-11-29 02:01:53,858 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 370 flow [2023-11-29 02:01:53,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.25) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:53,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:53,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:53,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:01:53,858 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 02:01:53,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1639162544, now seen corresponding path program 2 times [2023-11-29 02:01:53,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:53,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310164411] [2023-11-29 02:01:53,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:53,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:54,091 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 02:01:54,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:54,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310164411] [2023-11-29 02:01:54,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310164411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:54,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:54,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:01:54,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707196227] [2023-11-29 02:01:54,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:54,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:01:54,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:54,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:01:54,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:01:54,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 02:01:54,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:54,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:54,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 02:01:54,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:01:57,544 INFO L124 PetriNetUnfolderBase]: 20244/30085 cut-off events. [2023-11-29 02:01:57,544 INFO L125 PetriNetUnfolderBase]: For 46598/48128 co-relation queries the response was YES. [2023-11-29 02:01:57,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95154 conditions, 30085 events. 20244/30085 cut-off events. For 46598/48128 co-relation queries the response was YES. Maximal size of possible extension queue 1236. Compared 206261 event pairs, 1752 based on Foata normal form. 1014/30331 useless extension candidates. Maximal degree in co-relation 95125. Up to 9902 conditions per place. [2023-11-29 02:01:57,795 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 115 selfloop transitions, 14 changer transitions 10/163 dead transitions. [2023-11-29 02:01:57,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 163 transitions, 1048 flow [2023-11-29 02:01:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:01:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:01:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 298 transitions. [2023-11-29 02:01:57,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 02:01:57,797 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 298 transitions. [2023-11-29 02:01:57,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 298 transitions. [2023-11-29 02:01:57,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:01:57,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 298 transitions. [2023-11-29 02:01:57,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 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 02:01:57,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:57,799 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:57,799 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 370 flow. Second operand 6 states and 298 transitions. [2023-11-29 02:01:57,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 163 transitions, 1048 flow [2023-11-29 02:01:58,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 163 transitions, 1041 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 02:01:58,095 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 434 flow [2023-11-29 02:01:58,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2023-11-29 02:01:58,096 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2023-11-29 02:01:58,096 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 434 flow [2023-11-29 02:01:58,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:58,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:01:58,097 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] [2023-11-29 02:01:58,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:01:58,097 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 02:01:58,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:58,098 INFO L85 PathProgramCache]: Analyzing trace with hash -187114570, now seen corresponding path program 1 times [2023-11-29 02:01:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:58,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333133862] [2023-11-29 02:01:58,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:58,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:58,435 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 02:01:58,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:58,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333133862] [2023-11-29 02:01:58,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333133862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:58,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:01:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499655574] [2023-11-29 02:01:58,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:58,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:01:58,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:58,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:01:58,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:01:58,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 02:01:58,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:58,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:01:58,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 02:01:58,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:02,036 INFO L124 PetriNetUnfolderBase]: 17286/25657 cut-off events. [2023-11-29 02:02:02,036 INFO L125 PetriNetUnfolderBase]: For 68313/69699 co-relation queries the response was YES. [2023-11-29 02:02:02,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90463 conditions, 25657 events. 17286/25657 cut-off events. For 68313/69699 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 174544 event pairs, 1549 based on Foata normal form. 402/25327 useless extension candidates. Maximal degree in co-relation 90433. Up to 9526 conditions per place. [2023-11-29 02:02:02,233 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 101 selfloop transitions, 18 changer transitions 5/147 dead transitions. [2023-11-29 02:02:02,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 147 transitions, 957 flow [2023-11-29 02:02:02,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:02:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:02:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 327 transitions. [2023-11-29 02:02:02,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.697228144989339 [2023-11-29 02:02:02,235 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 327 transitions. [2023-11-29 02:02:02,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 327 transitions. [2023-11-29 02:02:02,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:02,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 327 transitions. [2023-11-29 02:02:02,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:02,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:02,238 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:02,238 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 434 flow. Second operand 7 states and 327 transitions. [2023-11-29 02:02:02,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 147 transitions, 957 flow [2023-11-29 02:02:02,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 147 transitions, 908 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-29 02:02:02,928 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 428 flow [2023-11-29 02:02:02,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=428, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2023-11-29 02:02:02,928 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 18 predicate places. [2023-11-29 02:02:02,928 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 428 flow [2023-11-29 02:02:02,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:02,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:02,929 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, 1] [2023-11-29 02:02:02,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:02:02,929 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 02:02:02,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:02,929 INFO L85 PathProgramCache]: Analyzing trace with hash 939201164, now seen corresponding path program 1 times [2023-11-29 02:02:02,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:02:02,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75582176] [2023-11-29 02:02:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:02,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:02:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:03,156 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 02:02:03,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:02:03,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75582176] [2023-11-29 02:02:03,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75582176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:03,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:03,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:02:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589843582] [2023-11-29 02:02:03,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:03,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:02:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:02:03,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:02:03,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:02:03,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 67 [2023-11-29 02:02:03,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 428 flow. Second operand has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 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 02:02:03,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:03,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 67 [2023-11-29 02:02:03,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:07,269 INFO L124 PetriNetUnfolderBase]: 20754/33641 cut-off events. [2023-11-29 02:02:07,270 INFO L125 PetriNetUnfolderBase]: For 81737/96227 co-relation queries the response was YES. [2023-11-29 02:02:07,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111060 conditions, 33641 events. 20754/33641 cut-off events. For 81737/96227 co-relation queries the response was YES. Maximal size of possible extension queue 2431. Compared 289377 event pairs, 5764 based on Foata normal form. 571/30625 useless extension candidates. Maximal degree in co-relation 111030. Up to 13172 conditions per place. [2023-11-29 02:02:07,535 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 77 selfloop transitions, 11 changer transitions 23/145 dead transitions. [2023-11-29 02:02:07,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 145 transitions, 948 flow [2023-11-29 02:02:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:02:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 02:02:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 340 transitions. [2023-11-29 02:02:07,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6343283582089553 [2023-11-29 02:02:07,537 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 340 transitions. [2023-11-29 02:02:07,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 340 transitions. [2023-11-29 02:02:07,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:07,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 340 transitions. [2023-11-29 02:02:07,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 42.5) internal successors, (340), 8 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:07,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:07,541 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:07,541 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 428 flow. Second operand 8 states and 340 transitions. [2023-11-29 02:02:07,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 145 transitions, 948 flow [2023-11-29 02:02:09,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 145 transitions, 851 flow, removed 36 selfloop flow, removed 8 redundant places. [2023-11-29 02:02:09,539 INFO L231 Difference]: Finished difference. Result has 94 places, 80 transitions, 416 flow [2023-11-29 02:02:09,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=416, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2023-11-29 02:02:09,539 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 20 predicate places. [2023-11-29 02:02:09,539 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 416 flow [2023-11-29 02:02:09,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 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 02:02:09,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:09,540 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, 1] [2023-11-29 02:02:09,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:02:09,540 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 02:02:09,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash -574563606, now seen corresponding path program 2 times [2023-11-29 02:02:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:02:09,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116046406] [2023-11-29 02:02:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:02:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:11,294 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 02:02:11,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:02:11,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116046406] [2023-11-29 02:02:11,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116046406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:11,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:11,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 02:02:11,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997939618] [2023-11-29 02:02:11,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:11,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:02:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:02:11,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:02:11,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:02:11,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 02:02:11,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 80 transitions, 416 flow. Second operand has 11 states, 11 states have (on average 37.81818181818182) internal successors, (416), 11 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:11,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:11,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 02:02:11,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:15,620 INFO L124 PetriNetUnfolderBase]: 19875/34845 cut-off events. [2023-11-29 02:02:15,620 INFO L125 PetriNetUnfolderBase]: For 52048/60805 co-relation queries the response was YES. [2023-11-29 02:02:15,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101466 conditions, 34845 events. 19875/34845 cut-off events. For 52048/60805 co-relation queries the response was YES. Maximal size of possible extension queue 2795. Compared 339767 event pairs, 4730 based on Foata normal form. 699/31149 useless extension candidates. Maximal degree in co-relation 101436. Up to 8224 conditions per place. [2023-11-29 02:02:15,908 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 70 selfloop transitions, 10 changer transitions 16/144 dead transitions. [2023-11-29 02:02:15,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 144 transitions, 834 flow [2023-11-29 02:02:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:02:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:02:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 414 transitions. [2023-11-29 02:02:15,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865671641791045 [2023-11-29 02:02:15,911 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 414 transitions. [2023-11-29 02:02:15,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 414 transitions. [2023-11-29 02:02:15,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:15,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 414 transitions. [2023-11-29 02:02:15,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 46.0) internal successors, (414), 9 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:15,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:15,914 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:15,914 INFO L175 Difference]: Start difference. First operand has 94 places, 80 transitions, 416 flow. Second operand 9 states and 414 transitions. [2023-11-29 02:02:15,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 144 transitions, 834 flow [2023-11-29 02:02:19,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 144 transitions, 820 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 02:02:19,349 INFO L231 Difference]: Finished difference. Result has 103 places, 84 transitions, 473 flow [2023-11-29 02:02:19,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=473, PETRI_PLACES=103, PETRI_TRANSITIONS=84} [2023-11-29 02:02:19,350 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 29 predicate places. [2023-11-29 02:02:19,350 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 84 transitions, 473 flow [2023-11-29 02:02:19,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.81818181818182) internal successors, (416), 11 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:19,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:19,350 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, 1] [2023-11-29 02:02:19,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:02:19,351 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 02:02:19,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash 342713002, now seen corresponding path program 3 times [2023-11-29 02:02:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:02:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408818729] [2023-11-29 02:02:19,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:19,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:02:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:02:19,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:02:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:02:19,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:02:19,544 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:02:19,545 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 02:02:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 02:02:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 02:02:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 02:02:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 02:02:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 02:02:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 02:02:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 02:02:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 02:02:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 02:02:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 02:02:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 02:02:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 02:02:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 02:02:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 02:02:19,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 02:02:19,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:02:19,551 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:02:19,558 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 02:02:19,558 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:02:19,626 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 02:02:19,629 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 02:02:19,630 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 02:02:19,631 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 02:02:19,648 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:02:19,649 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:02:19,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:02:19 BasicIcfg [2023-11-29 02:02:19,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:02:19,665 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:02:19,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:02:19,665 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:02:19,665 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:01:28" (3/4) ... [2023-11-29 02:02:19,667 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:02:19,668 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:02:19,669 INFO L158 Benchmark]: Toolchain (without parser) took 52742.25ms. Allocated memory was 167.8MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 133.4MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-11-29 02:02:19,669 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:02:19,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.04ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 108.7MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 02:02:19,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.92ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:02:19,670 INFO L158 Benchmark]: Boogie Preprocessor took 60.66ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 102.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:02:19,670 INFO L158 Benchmark]: RCFGBuilder took 792.00ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 112.8MB in the end (delta: -10.7MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2023-11-29 02:02:19,671 INFO L158 Benchmark]: TraceAbstraction took 51332.25ms. Allocated memory was 167.8MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 112.0MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-11-29 02:02:19,671 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 4.7GB. Free memory was 3.2GB in the beginning and 3.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:02:19,673 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 167.8MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.04ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 108.7MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.92ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.66ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 102.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 792.00ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 112.8MB in the end (delta: -10.7MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * TraceAbstraction took 51332.25ms. Allocated memory was 167.8MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 112.0MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 4.7GB. Free memory was 3.2GB in the beginning and 3.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L829] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L895] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix036.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 880]: 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: 874]: 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: 878]: 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, 101 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: 51.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 45.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1295 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1123 mSDsluCounter, 213 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3481 IncrementalHoareTripleChecker+Invalid, 3560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 63 mSDtfsCounter, 3481 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=19, InterpolantAutomatonStates: 100, 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, 4.9s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 2922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 02:02:19,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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 e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:02:21,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:02:21,973 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 02:02:22,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:02:22,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:02:22,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:02:22,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:02:22,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:02:22,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:02:22,031 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:02:22,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:02:22,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:02:22,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:02:22,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:02:22,035 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:02:22,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:02:22,036 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:02:22,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:02:22,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:02:22,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:02:22,038 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:02:22,038 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:02:22,039 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:02:22,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:02:22,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:02:22,040 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:02:22,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:02:22,041 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:02:22,041 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:02:22,041 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:02:22,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:02:22,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:02:22,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:02:22,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:02:22,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:02:22,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:02:22,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:02:22,044 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:02:22,044 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:02:22,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:02:22,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:02:22,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:02:22,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:02:22,045 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:02:22,045 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_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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 -> e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 [2023-11-29 02:02:22,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:02:22,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:02:22,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:02:22,345 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:02:22,346 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:02:22,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2023-11-29 02:02:25,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:02:25,460 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:02:25,461 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2023-11-29 02:02:25,479 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/data/a7e960c76/231925b597c04cfa82435b0180884cda/FLAG92834fde2 [2023-11-29 02:02:25,497 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/data/a7e960c76/231925b597c04cfa82435b0180884cda [2023-11-29 02:02:25,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:02:25,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:02:25,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:02:25,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:02:25,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:02:25,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:02:25" (1/1) ... [2023-11-29 02:02:25,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15a5a265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:25, skipping insertion in model container [2023-11-29 02:02:25,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:02:25" (1/1) ... [2023-11-29 02:02:25,567 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:02:25,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:02:25,982 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:02:26,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:02:26,065 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:02:26,065 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:02:26,071 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:02:26,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26 WrapperNode [2023-11-29 02:02:26,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:02:26,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:02:26,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:02:26,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:02:26,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,124 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2023-11-29 02:02:26,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:02:26,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:02:26,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:02:26,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:02:26,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,158 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 02:02:26,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:02:26,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:02:26,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:02:26,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:02:26,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (1/1) ... [2023-11-29 02:02:26,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:02:26,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:02:26,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:02:26,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:02:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 02:02:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:02:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:02:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:02:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 02:02:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 02:02:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 02:02:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 02:02:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 02:02:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:02:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:02:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 02:02:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 02:02:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 02:02:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 02:02:26,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 02:02:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 02:02:26,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 02:02:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 02:02:26,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 02:02:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 02:02:26,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 02:02:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 02:02:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:02:26,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:02:26,276 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 02:02:26,438 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:02:26,441 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:02:26,823 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:02:27,061 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:02:27,061 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:02:27,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:02:27 BoogieIcfgContainer [2023-11-29 02:02:27,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:02:27,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:02:27,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:02:27,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:02:27,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:02:25" (1/3) ... [2023-11-29 02:02:27,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431ab0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:02:27, skipping insertion in model container [2023-11-29 02:02:27,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:26" (2/3) ... [2023-11-29 02:02:27,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431ab0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:02:27, skipping insertion in model container [2023-11-29 02:02:27,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:02:27" (3/3) ... [2023-11-29 02:02:27,070 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2023-11-29 02:02:27,090 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:02:27,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 02:02:27,090 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:02:27,172 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:02:27,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 02:02:27,246 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 02:02:27,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:02:27,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 138 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-29 02:02:27,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 02:02:27,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 02:02:27,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:02:27,274 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;@7cf266fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:02:27,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 02:02:27,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:02:27,279 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 02:02:27,279 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:02:27,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:27,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:02:27,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:02:27,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash 14579, now seen corresponding path program 1 times [2023-11-29 02:02:27,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:27,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652005202] [2023-11-29 02:02:27,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:27,302 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 02:02:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:27,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:27,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:27,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:02:27,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:27,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 7 [2023-11-29 02:02:27,559 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 02:02:27,560 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:27,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:27,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652005202] [2023-11-29 02:02:27,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652005202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:27,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:27,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:02:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985665741] [2023-11-29 02:02:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:27,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:02:27,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:27,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:02:27,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:02:27,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 02:02:27,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 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 02:02:27,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:27,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 02:02:27,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:29,067 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-29 02:02:29,067 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 02:02:29,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13210 conditions, 7283 events. 4217/7283 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54415 event pairs, 3179 based on Foata normal form. 360/7021 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-29 02:02:29,139 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-29 02:02:29,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 228 flow [2023-11-29 02:02:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:02:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:02:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 02:02:29,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 02:02:29,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 02:02:29,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 02:02:29,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:29,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 02:02:29,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:29,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:29,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:29,161 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 149 transitions. [2023-11-29 02:02:29,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 228 flow [2023-11-29 02:02:29,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:02:29,170 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 02:02:29,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-29 02:02:29,175 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 02:02:29,175 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 02:02:29,176 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 02:02:29,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:29,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:02:29,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:29,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:29,377 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 02:02:29,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:29,378 INFO L85 PathProgramCache]: Analyzing trace with hash 14580, now seen corresponding path program 1 times [2023-11-29 02:02:29,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:29,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276025572] [2023-11-29 02:02:29,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:29,379 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 02:02:29,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:29,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:29,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:29,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:02:29,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:29,471 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 02:02:29,481 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 02:02:29,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:29,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276025572] [2023-11-29 02:02:29,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276025572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:29,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:29,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:02:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240340165] [2023-11-29 02:02:29,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:29,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:02:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:29,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:02:29,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:02:29,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 02:02:29,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 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 02:02:29,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:29,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 02:02:29,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:30,735 INFO L124 PetriNetUnfolderBase]: 4217/7282 cut-off events. [2023-11-29 02:02:30,735 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 02:02:30,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13386 conditions, 7282 events. 4217/7282 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54454 event pairs, 3179 based on Foata normal form. 1/6661 useless extension candidates. Maximal degree in co-relation 13375. Up to 4390 conditions per place. [2023-11-29 02:02:30,823 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 02:02:30,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 224 flow [2023-11-29 02:02:30,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:02:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:02:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 02:02:30,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 02:02:30,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 02:02:30,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 02:02:30,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:30,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 02:02:30,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:30,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:30,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:30,830 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 149 transitions. [2023-11-29 02:02:30,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 224 flow [2023-11-29 02:02:30,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:02:30,843 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 02:02:30,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:02:30,845 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 02:02:30,845 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 02:02:30,845 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 02:02:30,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:30,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:02:30,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:31,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:31,046 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 02:02:31,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:31,047 INFO L85 PathProgramCache]: Analyzing trace with hash 434767455, now seen corresponding path program 1 times [2023-11-29 02:02:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:31,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872092100] [2023-11-29 02:02:31,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:31,048 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 02:02:31,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:31,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:31,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:31,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:02:31,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:31,151 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 02:02:31,157 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 02:02:31,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:31,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:31,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872092100] [2023-11-29 02:02:31,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872092100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:31,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:31,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:02:31,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262270025] [2023-11-29 02:02:31,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:31,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:02:31,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:31,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:02:31,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:02:31,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 02:02:31,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 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 02:02:31,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:31,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 02:02:31,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:32,250 INFO L124 PetriNetUnfolderBase]: 4221/7245 cut-off events. [2023-11-29 02:02:32,251 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 02:02:32,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13358 conditions, 7245 events. 4221/7245 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 54157 event pairs, 3251 based on Foata normal form. 0/6633 useless extension candidates. Maximal degree in co-relation 13347. Up to 4393 conditions per place. [2023-11-29 02:02:32,309 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 02:02:32,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 224 flow [2023-11-29 02:02:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:02:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:02:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2023-11-29 02:02:32,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-29 02:02:32,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 147 transitions. [2023-11-29 02:02:32,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 147 transitions. [2023-11-29 02:02:32,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:32,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 147 transitions. [2023-11-29 02:02:32,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:32,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:32,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:32,318 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 147 transitions. [2023-11-29 02:02:32,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 224 flow [2023-11-29 02:02:32,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:02:32,327 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 02:02:32,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:02:32,328 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 02:02:32,328 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 02:02:32,329 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 02:02:32,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:32,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:02:32,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:32,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:32,530 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 02:02:32,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:32,531 INFO L85 PathProgramCache]: Analyzing trace with hash 434767456, now seen corresponding path program 1 times [2023-11-29 02:02:32,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:32,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815293556] [2023-11-29 02:02:32,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:32,532 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 02:02:32,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:32,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:32,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:32,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:02:32,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:32,637 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 02:02:32,650 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 02:02:32,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:32,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:32,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815293556] [2023-11-29 02:02:32,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815293556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:32,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:32,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:02:32,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887265913] [2023-11-29 02:02:32,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:32,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:02:32,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:32,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:02:32,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:02:32,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 02:02:32,700 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.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:32,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:32,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 02:02:32,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:33,601 INFO L124 PetriNetUnfolderBase]: 4217/7272 cut-off events. [2023-11-29 02:02:33,601 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-29 02:02:33,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13380 conditions, 7272 events. 4217/7272 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54929 event pairs, 2503 based on Foata normal form. 5/6668 useless extension candidates. Maximal degree in co-relation 13370. Up to 4384 conditions per place. [2023-11-29 02:02:33,653 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 02:02:33,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-29 02:02:33,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:02:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:02:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 02:02:33,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 02:02:33,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 02:02:33,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 02:02:33,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:33,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 02:02:33,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:33,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:33,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:33,659 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 149 transitions. [2023-11-29 02:02:33,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-29 02:02:33,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:02:33,664 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 02:02:33,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:02:33,665 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 02:02:33,665 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 02:02:33,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:33,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:33,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:02:33,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:33,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:33,866 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 02:02:33,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash 434767950, now seen corresponding path program 1 times [2023-11-29 02:02:33,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:33,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092328309] [2023-11-29 02:02:33,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:33,868 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 02:02:33,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:33,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:33,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:33,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:02:33,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:33,957 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 02:02:33,958 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:33,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:33,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092328309] [2023-11-29 02:02:33,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092328309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:33,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:33,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:02:33,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698474407] [2023-11-29 02:02:33,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:33,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:02:33,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:33,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:02:33,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:02:33,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 02:02:33,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:33,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:33,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 02:02:33,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:34,607 INFO L124 PetriNetUnfolderBase]: 3311/5485 cut-off events. [2023-11-29 02:02:34,607 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 02:02:34,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10310 conditions, 5485 events. 3311/5485 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 39504 event pairs, 593 based on Foata normal form. 0/5404 useless extension candidates. Maximal degree in co-relation 10300. Up to 3661 conditions per place. [2023-11-29 02:02:34,630 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-29 02:02:34,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 262 flow [2023-11-29 02:02:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:02:34,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:02:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-29 02:02:34,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7960199004975125 [2023-11-29 02:02:34,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-29 02:02:34,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-29 02:02:34,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:34,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-29 02:02:34,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:34,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:34,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:34,634 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 160 transitions. [2023-11-29 02:02:34,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 262 flow [2023-11-29 02:02:34,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:02:34,637 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-29 02:02:34,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-29 02:02:34,638 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-29 02:02:34,639 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-29 02:02:34,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:34,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:34,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:02:34,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:34,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:34,841 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 02:02:34,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1463664796, now seen corresponding path program 1 times [2023-11-29 02:02:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:34,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443438570] [2023-11-29 02:02:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:34,843 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 02:02:34,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:34,846 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:34,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:34,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:02:34,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:34,935 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 02:02:34,941 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 02:02:34,941 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:34,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:34,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443438570] [2023-11-29 02:02:34,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443438570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:34,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:34,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:02:34,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341404489] [2023-11-29 02:02:34,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:34,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:02:34,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:34,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:02:34,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:02:34,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 02:02:34,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 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 02:02:34,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:34,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 02:02:34,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:35,645 INFO L124 PetriNetUnfolderBase]: 2920/5209 cut-off events. [2023-11-29 02:02:35,646 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-29 02:02:35,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9645 conditions, 5209 events. 2920/5209 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 38220 event pairs, 1356 based on Foata normal form. 0/4998 useless extension candidates. Maximal degree in co-relation 9634. Up to 3460 conditions per place. [2023-11-29 02:02:35,680 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 02:02:35,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 210 flow [2023-11-29 02:02:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:02:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:02:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 02:02:35,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 02:02:35,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 02:02:35,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 02:02:35,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:35,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 02:02:35,683 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 02:02:35,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:35,685 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:35,685 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-29 02:02:35,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 210 flow [2023-11-29 02:02:35,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:02:35,688 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 02:02:35,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:02:35,690 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 02:02:35,690 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 02:02:35,690 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 02:02:35,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:35,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:02:35,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:35,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:35,891 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 02:02:35,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1463664795, now seen corresponding path program 1 times [2023-11-29 02:02:35,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:35,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620043682] [2023-11-29 02:02:35,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:35,893 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 02:02:35,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:35,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:35,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:35,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:02:35,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:36,005 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 02:02:36,016 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 02:02:36,016 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:36,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:36,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620043682] [2023-11-29 02:02:36,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620043682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:36,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:36,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:02:36,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643644804] [2023-11-29 02:02:36,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:36,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:02:36,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:36,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:02:36,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:02:36,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 02:02:36,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:36,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:36,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 02:02:36,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:36,827 INFO L124 PetriNetUnfolderBase]: 2903/5076 cut-off events. [2023-11-29 02:02:36,827 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:02:36,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9357 conditions, 5076 events. 2903/5076 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 36902 event pairs, 1620 based on Foata normal form. 12/4909 useless extension candidates. Maximal degree in co-relation 9347. Up to 3431 conditions per place. [2023-11-29 02:02:36,871 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 02:02:36,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-29 02:02:36,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:02:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:02:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 02:02:36,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 02:02:36,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 02:02:36,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 02:02:36,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:36,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 02:02:36,874 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 02:02:36,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:36,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:36,876 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-29 02:02:36,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-29 02:02:36,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:02:36,879 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 02:02:36,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:02:36,880 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 02:02:36,880 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 02:02:36,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:36,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:36,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:02:36,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:37,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:37,081 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 02:02:37,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:37,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1529503636, now seen corresponding path program 1 times [2023-11-29 02:02:37,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:37,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293477658] [2023-11-29 02:02:37,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:37,083 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 02:02:37,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:37,084 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:37,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:37,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:02:37,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:37,204 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 02:02:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:02:37,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:37,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293477658] [2023-11-29 02:02:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293477658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:37,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:37,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:02:37,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741289409] [2023-11-29 02:02:37,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:37,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:02:37,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:37,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:02:37,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:02:37,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 02:02:37,246 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.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 02:02:37,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:37,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 02:02:37,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:37,963 INFO L124 PetriNetUnfolderBase]: 2978/5159 cut-off events. [2023-11-29 02:02:37,964 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:02:37,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 5159 events. 2978/5159 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 36909 event pairs, 1424 based on Foata normal form. 0/5016 useless extension candidates. Maximal degree in co-relation 9541. Up to 3426 conditions per place. [2023-11-29 02:02:37,985 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 02:02:37,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-29 02:02:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:02:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:02:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 02:02:37,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 02:02:37,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 02:02:37,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 02:02:37,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:37,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 02:02:37,988 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 02:02:37,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:37,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:37,989 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 144 transitions. [2023-11-29 02:02:37,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-29 02:02:37,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:02:37,992 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 02:02:37,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:02:37,993 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 02:02:37,993 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 02:02:37,993 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 02:02:37,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:37,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:02:37,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:38,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:38,194 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 02:02:38,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:38,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1529503635, now seen corresponding path program 1 times [2023-11-29 02:02:38,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:38,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417412360] [2023-11-29 02:02:38,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:38,195 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 02:02:38,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:38,196 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:38,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:38,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:02:38,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:38,303 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 02:02:38,312 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 02:02:38,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:38,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:38,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417412360] [2023-11-29 02:02:38,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417412360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:38,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:38,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:02:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903890496] [2023-11-29 02:02:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:38,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:02:38,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:38,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:02:38,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:02:38,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 02:02:38,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:38,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:38,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 02:02:38,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:38,953 INFO L124 PetriNetUnfolderBase]: 2903/5108 cut-off events. [2023-11-29 02:02:38,953 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 02:02:38,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9413 conditions, 5108 events. 2903/5108 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37003 event pairs, 920 based on Foata normal form. 36/5025 useless extension candidates. Maximal degree in co-relation 9403. Up to 3315 conditions per place. [2023-11-29 02:02:38,983 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 02:02:38,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-29 02:02:38,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:02:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:02:38,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 02:02:38,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 02:02:38,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 02:02:38,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 02:02:38,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:38,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 02:02:38,986 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 02:02:38,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:38,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 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 02:02:38,986 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 146 transitions. [2023-11-29 02:02:38,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-29 02:02:38,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:02:38,989 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 02:02:38,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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 02:02:38,990 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-29 02:02:38,990 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 02:02:38,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:38,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:38,990 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 02:02:38,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 02:02:39,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:39,191 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 02:02:39,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:39,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1016685183, now seen corresponding path program 1 times [2023-11-29 02:02:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:39,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082523847] [2023-11-29 02:02:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:39,192 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 02:02:39,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:39,193 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:39,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:39,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:02:39,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:02:39,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:39,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082523847] [2023-11-29 02:02:39,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082523847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:39,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:39,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:02:39,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347279959] [2023-11-29 02:02:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:39,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:02:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:39,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:02:39,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:02:39,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 02:02:39,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 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 02:02:39,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:39,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 02:02:39,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:40,796 INFO L124 PetriNetUnfolderBase]: 9971/15485 cut-off events. [2023-11-29 02:02:40,796 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-29 02:02:40,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29710 conditions, 15485 events. 9971/15485 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 112445 event pairs, 1033 based on Foata normal form. 400/15655 useless extension candidates. Maximal degree in co-relation 29700. Up to 8761 conditions per place. [2023-11-29 02:02:40,877 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 54 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2023-11-29 02:02:40,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 306 flow [2023-11-29 02:02:40,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:02:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 02:02:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2023-11-29 02:02:40,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7276119402985075 [2023-11-29 02:02:40,879 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 195 transitions. [2023-11-29 02:02:40,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 195 transitions. [2023-11-29 02:02:40,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:40,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 195 transitions. [2023-11-29 02:02:40,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:40,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 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 02:02:40,881 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 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 02:02:40,881 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 4 states and 195 transitions. [2023-11-29 02:02:40,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 306 flow [2023-11-29 02:02:40,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:02:40,890 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 150 flow [2023-11-29 02:02:40,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-11-29 02:02:40,891 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 02:02:40,891 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 150 flow [2023-11-29 02:02:40,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 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 02:02:40,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:40,892 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 02:02:40,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 02:02:41,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:41,093 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 02:02:41,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:41,093 INFO L85 PathProgramCache]: Analyzing trace with hash 51552268, now seen corresponding path program 1 times [2023-11-29 02:02:41,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:41,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272272506] [2023-11-29 02:02:41,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:41,094 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 02:02:41,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:41,095 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:41,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:41,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:02:41,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:41,281 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 02:02:41,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:41,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:41,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272272506] [2023-11-29 02:02:41,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272272506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:41,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:41,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:02:41,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407938255] [2023-11-29 02:02:41,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:41,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:02:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:41,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:02:41,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:02:41,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 02:02:41,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:41,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:41,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 02:02:41,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:42,461 INFO L124 PetriNetUnfolderBase]: 7427/11585 cut-off events. [2023-11-29 02:02:42,461 INFO L125 PetriNetUnfolderBase]: For 2580/2580 co-relation queries the response was YES. [2023-11-29 02:02:42,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25513 conditions, 11585 events. 7427/11585 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 79912 event pairs, 451 based on Foata normal form. 364/11768 useless extension candidates. Maximal degree in co-relation 25500. Up to 5521 conditions per place. [2023-11-29 02:02:42,520 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 69 selfloop transitions, 10 changer transitions 1/101 dead transitions. [2023-11-29 02:02:42,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 433 flow [2023-11-29 02:02:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:02:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:02:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2023-11-29 02:02:42,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2023-11-29 02:02:42,523 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2023-11-29 02:02:42,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2023-11-29 02:02:42,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:42,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2023-11-29 02:02:42,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:42,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 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 02:02:42,525 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 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 02:02:42,525 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 150 flow. Second operand 5 states and 247 transitions. [2023-11-29 02:02:42,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 433 flow [2023-11-29 02:02:42,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 02:02:42,530 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 202 flow [2023-11-29 02:02:42,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-11-29 02:02:42,530 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 02:02:42,531 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 202 flow [2023-11-29 02:02:42,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:42,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:42,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:02:42,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:42,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:42,731 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 02:02:42,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1223017816, now seen corresponding path program 1 times [2023-11-29 02:02:42,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:42,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607604465] [2023-11-29 02:02:42,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:42,733 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 02:02:42,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:42,734 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:42,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:42,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:02:42,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:42,920 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 02:02:42,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:42,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:42,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607604465] [2023-11-29 02:02:42,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607604465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:42,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:42,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:02:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767975623] [2023-11-29 02:02:42,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:42,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:02:42,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:42,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:02:42,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:02:42,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 02:02:42,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:42,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:42,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 02:02:42,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:43,761 INFO L124 PetriNetUnfolderBase]: 4491/6901 cut-off events. [2023-11-29 02:02:43,762 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2023-11-29 02:02:43,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17135 conditions, 6901 events. 4491/6901 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 41539 event pairs, 289 based on Foata normal form. 244/6993 useless extension candidates. Maximal degree in co-relation 17120. Up to 1969 conditions per place. [2023-11-29 02:02:43,791 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 82 selfloop transitions, 14 changer transitions 1/118 dead transitions. [2023-11-29 02:02:43,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 118 transitions, 564 flow [2023-11-29 02:02:43,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:02:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:02:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 297 transitions. [2023-11-29 02:02:43,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7388059701492538 [2023-11-29 02:02:43,793 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 297 transitions. [2023-11-29 02:02:43,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 297 transitions. [2023-11-29 02:02:43,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:43,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 297 transitions. [2023-11-29 02:02:43,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:43,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:43,796 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:43,796 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 202 flow. Second operand 6 states and 297 transitions. [2023-11-29 02:02:43,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 118 transitions, 564 flow [2023-11-29 02:02:43,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 118 transitions, 534 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 02:02:43,813 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 252 flow [2023-11-29 02:02:43,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-29 02:02:43,814 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-29 02:02:43,814 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 252 flow [2023-11-29 02:02:43,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:43,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:43,814 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 02:02:43,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:44,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:44,015 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 02:02:44,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:44,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2010179054, now seen corresponding path program 1 times [2023-11-29 02:02:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166728922] [2023-11-29 02:02:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:44,016 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 02:02:44,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:44,017 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:44,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:44,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:02:44,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:44,197 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 02:02:44,197 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:44,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166728922] [2023-11-29 02:02:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166728922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:44,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:44,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:02:44,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632290534] [2023-11-29 02:02:44,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:44,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:02:44,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:44,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:02:44,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:02:44,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 02:02:44,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:44,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:44,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 02:02:44,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:44,993 INFO L124 PetriNetUnfolderBase]: 2927/4309 cut-off events. [2023-11-29 02:02:44,994 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2023-11-29 02:02:45,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11832 conditions, 4309 events. 2927/4309 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22744 event pairs, 231 based on Foata normal form. 96/4260 useless extension candidates. Maximal degree in co-relation 11816. Up to 1316 conditions per place. [2023-11-29 02:02:45,015 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 73 selfloop transitions, 18 changer transitions 1/113 dead transitions. [2023-11-29 02:02:45,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 554 flow [2023-11-29 02:02:45,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:02:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:02:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 325 transitions. [2023-11-29 02:02:45,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6929637526652452 [2023-11-29 02:02:45,017 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 325 transitions. [2023-11-29 02:02:45,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 325 transitions. [2023-11-29 02:02:45,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:45,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 325 transitions. [2023-11-29 02:02:45,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:45,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:45,020 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:45,021 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 252 flow. Second operand 7 states and 325 transitions. [2023-11-29 02:02:45,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 554 flow [2023-11-29 02:02:45,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 508 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 02:02:45,046 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 262 flow [2023-11-29 02:02:45,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2023-11-29 02:02:45,046 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-29 02:02:45,047 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 262 flow [2023-11-29 02:02:45,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:45,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:45,047 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, 1] [2023-11-29 02:02:45,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:45,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:45,248 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 02:02:45,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1987099831, now seen corresponding path program 1 times [2023-11-29 02:02:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:45,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823263511] [2023-11-29 02:02:45,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:45,249 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 02:02:45,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:45,250 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:45,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:45,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 02:02:45,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:46,421 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t939~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t937~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t940~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t938~0#1.base_53| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t937~0#1.base_57| (_ bv1 1)))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t938~0#1.base_53| (_ bv1 1)))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t938~0#1.base_53|) (_ bv0 1)) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t937~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t938~0#1.base_53| (_ bv0 1)) |v_ULTIMATE.start_main_~#t939~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t940~0#1.base_49| (_ bv0 1)) |c_#valid|) (= (select .cse1 |v_ULTIMATE.start_main_~#t939~0#1.base_47|) (_ bv0 1)) (= (select (store .cse1 |v_ULTIMATE.start_main_~#t939~0#1.base_47| (_ bv1 1)) |v_ULTIMATE.start_main_~#t940~0#1.base_49|) (_ bv0 1)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t937~0#1.base_57|) (_ bv0 1)))))) is different from true [2023-11-29 02:02:46,423 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 02:02:46,423 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:46,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:46,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823263511] [2023-11-29 02:02:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823263511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:46,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:02:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969109853] [2023-11-29 02:02:46,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:46,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:02:46,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:46,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:02:46,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-29 02:02:46,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 67 [2023-11-29 02:02:46,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:46,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:46,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 67 [2023-11-29 02:02:46,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:47,258 INFO L124 PetriNetUnfolderBase]: 1591/2819 cut-off events. [2023-11-29 02:02:47,258 INFO L125 PetriNetUnfolderBase]: For 1111/1196 co-relation queries the response was YES. [2023-11-29 02:02:47,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6293 conditions, 2819 events. 1591/2819 cut-off events. For 1111/1196 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17279 event pairs, 249 based on Foata normal form. 16/2674 useless extension candidates. Maximal degree in co-relation 6275. Up to 1876 conditions per place. [2023-11-29 02:02:47,277 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 43 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2023-11-29 02:02:47,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 412 flow [2023-11-29 02:02:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:02:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:02:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2023-11-29 02:02:47,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861407249466951 [2023-11-29 02:02:47,279 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 228 transitions. [2023-11-29 02:02:47,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 228 transitions. [2023-11-29 02:02:47,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:47,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 228 transitions. [2023-11-29 02:02:47,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:47,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:47,283 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:47,283 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 262 flow. Second operand 7 states and 228 transitions. [2023-11-29 02:02:47,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 412 flow [2023-11-29 02:02:47,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 316 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 02:02:47,294 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 207 flow [2023-11-29 02:02:47,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2023-11-29 02:02:47,295 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-29 02:02:47,295 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 207 flow [2023-11-29 02:02:47,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:47,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:47,296 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, 1] [2023-11-29 02:02:47,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 02:02:47,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:47,497 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 02:02:47,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash 703927426, now seen corresponding path program 1 times [2023-11-29 02:02:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626388885] [2023-11-29 02:02:47,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:47,498 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 02:02:47,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:47,499 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:47,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:47,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 02:02:47,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:48,403 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 02:02:48,403 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:48,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:48,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626388885] [2023-11-29 02:02:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626388885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:48,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:02:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186172940] [2023-11-29 02:02:48,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:48,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:02:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:48,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:02:48,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:02:48,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 02:02:48,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 207 flow. Second operand has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:48,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:48,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 02:02:48,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:49,243 INFO L124 PetriNetUnfolderBase]: 2271/3811 cut-off events. [2023-11-29 02:02:49,243 INFO L125 PetriNetUnfolderBase]: For 1167/1391 co-relation queries the response was YES. [2023-11-29 02:02:49,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9122 conditions, 3811 events. 2271/3811 cut-off events. For 1167/1391 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 23710 event pairs, 439 based on Foata normal form. 16/3594 useless extension candidates. Maximal degree in co-relation 9109. Up to 1499 conditions per place. [2023-11-29 02:02:49,267 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 78 selfloop transitions, 9 changer transitions 0/124 dead transitions. [2023-11-29 02:02:49,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 124 transitions, 582 flow [2023-11-29 02:02:49,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:02:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:02:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 413 transitions. [2023-11-29 02:02:49,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6849087893864013 [2023-11-29 02:02:49,269 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 413 transitions. [2023-11-29 02:02:49,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 413 transitions. [2023-11-29 02:02:49,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:49,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 413 transitions. [2023-11-29 02:02:49,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 45.888888888888886) internal successors, (413), 9 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:49,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:49,273 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:49,273 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 207 flow. Second operand 9 states and 413 transitions. [2023-11-29 02:02:49,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 124 transitions, 582 flow [2023-11-29 02:02:49,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 552 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 02:02:49,276 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 244 flow [2023-11-29 02:02:49,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2023-11-29 02:02:49,277 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 4 predicate places. [2023-11-29 02:02:49,277 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 244 flow [2023-11-29 02:02:49,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:49,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:49,277 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, 1] [2023-11-29 02:02:49,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:49,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:49,478 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 02:02:49,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash -557834966, now seen corresponding path program 2 times [2023-11-29 02:02:49,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:49,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791369209] [2023-11-29 02:02:49,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:02:49,479 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 02:02:49,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:49,480 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:49,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:49,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 02:02:49,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:02:49,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:02:49,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:49,678 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 02:02:49,678 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:49,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:49,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791369209] [2023-11-29 02:02:49,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791369209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:49,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:49,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:02:49,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521296636] [2023-11-29 02:02:49,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:49,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:02:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:49,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:02:49,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:02:49,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 02:02:49,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:49,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:49,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 02:02:49,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:50,682 INFO L124 PetriNetUnfolderBase]: 5163/8437 cut-off events. [2023-11-29 02:02:50,682 INFO L125 PetriNetUnfolderBase]: For 3516/4109 co-relation queries the response was YES. [2023-11-29 02:02:50,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21058 conditions, 8437 events. 5163/8437 cut-off events. For 3516/4109 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 57826 event pairs, 1207 based on Foata normal form. 22/7949 useless extension candidates. Maximal degree in co-relation 21041. Up to 3479 conditions per place. [2023-11-29 02:02:50,739 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 79 selfloop transitions, 8 changer transitions 0/122 dead transitions. [2023-11-29 02:02:50,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 122 transitions, 612 flow [2023-11-29 02:02:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:02:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:02:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 279 transitions. [2023-11-29 02:02:50,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6940298507462687 [2023-11-29 02:02:50,741 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 279 transitions. [2023-11-29 02:02:50,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 279 transitions. [2023-11-29 02:02:50,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:50,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 279 transitions. [2023-11-29 02:02:50,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:50,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:50,743 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:50,743 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 244 flow. Second operand 6 states and 279 transitions. [2023-11-29 02:02:50,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 122 transitions, 612 flow [2023-11-29 02:02:50,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 122 transitions, 601 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 02:02:50,757 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 321 flow [2023-11-29 02:02:50,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2023-11-29 02:02:50,758 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 10 predicate places. [2023-11-29 02:02:50,758 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 321 flow [2023-11-29 02:02:50,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:50,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:50,758 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, 1] [2023-11-29 02:02:50,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 02:02:50,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:50,959 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 02:02:50,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash 632058290, now seen corresponding path program 3 times [2023-11-29 02:02:50,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:50,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085935409] [2023-11-29 02:02:50,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:02:50,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:02:50,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:50,961 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:50,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:51,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 02:02:51,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:02:51,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:02:51,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:51,157 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 02:02:51,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:51,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:51,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085935409] [2023-11-29 02:02:51,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085935409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:51,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:51,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:02:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428693341] [2023-11-29 02:02:51,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:51,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:02:51,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:51,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:02:51,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:02:51,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 02:02:51,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:51,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:51,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 02:02:51,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:52,943 INFO L124 PetriNetUnfolderBase]: 10249/16715 cut-off events. [2023-11-29 02:02:52,943 INFO L125 PetriNetUnfolderBase]: For 7388/8156 co-relation queries the response was YES. [2023-11-29 02:02:53,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42059 conditions, 16715 events. 10249/16715 cut-off events. For 7388/8156 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 124930 event pairs, 1764 based on Foata normal form. 16/15710 useless extension candidates. Maximal degree in co-relation 42039. Up to 6450 conditions per place. [2023-11-29 02:02:53,099 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 82 selfloop transitions, 14 changer transitions 0/132 dead transitions. [2023-11-29 02:02:53,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 132 transitions, 762 flow [2023-11-29 02:02:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:02:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:02:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2023-11-29 02:02:53,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865671641791045 [2023-11-29 02:02:53,101 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 276 transitions. [2023-11-29 02:02:53,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 276 transitions. [2023-11-29 02:02:53,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:53,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 276 transitions. [2023-11-29 02:02:53,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:53,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:53,103 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:53,103 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 321 flow. Second operand 6 states and 276 transitions. [2023-11-29 02:02:53,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 132 transitions, 762 flow [2023-11-29 02:02:53,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 132 transitions, 761 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:02:53,127 INFO L231 Difference]: Finished difference. Result has 92 places, 91 transitions, 509 flow [2023-11-29 02:02:53,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=509, PETRI_PLACES=92, PETRI_TRANSITIONS=91} [2023-11-29 02:02:53,128 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 18 predicate places. [2023-11-29 02:02:53,128 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 91 transitions, 509 flow [2023-11-29 02:02:53,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:53,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:53,129 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, 1] [2023-11-29 02:02:53,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:53,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:53,329 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 02:02:53,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:53,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1964779582, now seen corresponding path program 4 times [2023-11-29 02:02:53,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:53,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531684834] [2023-11-29 02:02:53,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 02:02:53,330 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 02:02:53,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:53,331 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:53,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:53,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 02:02:53,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:02:53,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:02:53,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:53,537 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 02:02:53,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:53,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:02:53,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531684834] [2023-11-29 02:02:53,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531684834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:53,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:53,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:02:53,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103818676] [2023-11-29 02:02:53,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:53,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:02:53,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:02:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:02:53,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:02:53,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 02:02:53,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 509 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:53,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:02:53,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 02:02:53,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:02:56,452 INFO L124 PetriNetUnfolderBase]: 17895/29471 cut-off events. [2023-11-29 02:02:56,453 INFO L125 PetriNetUnfolderBase]: For 17397/18101 co-relation queries the response was YES. [2023-11-29 02:02:56,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75491 conditions, 29471 events. 17895/29471 cut-off events. For 17397/18101 co-relation queries the response was YES. Maximal size of possible extension queue 1806. Compared 241889 event pairs, 3516 based on Foata normal form. 16/27627 useless extension candidates. Maximal degree in co-relation 75467. Up to 11457 conditions per place. [2023-11-29 02:02:56,710 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 88 selfloop transitions, 26 changer transitions 0/151 dead transitions. [2023-11-29 02:02:56,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 151 transitions, 1141 flow [2023-11-29 02:02:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:02:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:02:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2023-11-29 02:02:56,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6741293532338308 [2023-11-29 02:02:56,712 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 271 transitions. [2023-11-29 02:02:56,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 271 transitions. [2023-11-29 02:02:56,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:02:56,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 271 transitions. [2023-11-29 02:02:56,713 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 02:02:56,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:56,714 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:56,714 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 509 flow. Second operand 6 states and 271 transitions. [2023-11-29 02:02:56,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 151 transitions, 1141 flow [2023-11-29 02:02:56,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 151 transitions, 1140 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:02:56,818 INFO L231 Difference]: Finished difference. Result has 100 places, 116 transitions, 945 flow [2023-11-29 02:02:56,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=945, PETRI_PLACES=100, PETRI_TRANSITIONS=116} [2023-11-29 02:02:56,819 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 26 predicate places. [2023-11-29 02:02:56,819 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 116 transitions, 945 flow [2023-11-29 02:02:56,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:56,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:02:56,819 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, 1] [2023-11-29 02:02:56,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:57,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:57,020 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 02:02:57,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1882455326, now seen corresponding path program 5 times [2023-11-29 02:02:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:02:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631827395] [2023-11-29 02:02:57,021 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:02:57,021 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 02:02:57,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:02:57,022 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:57,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:57,191 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 02:02:57,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 02:02:57,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:02:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:02:57,388 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 02:02:57,389 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:02:57,389 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 02:02:57,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 02:02:57,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 02:02:57,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 02:02:57,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 02:02:57,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 02:02:57,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 02:02:57,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 02:02:57,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 02:02:57,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 02:02:57,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 02:02:57,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 02:02:57,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 02:02:57,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 02:02:57,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 02:02:57,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 02:02:57,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:57,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:02:57,593 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:02:57,599 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 02:02:57,599 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:02:57,662 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 02:02:57,666 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 02:02:57,670 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 02:02:57,674 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 02:02:57,688 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:02:57,689 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:02:57,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:02:57 BasicIcfg [2023-11-29 02:02:57,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:02:57,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:02:57,705 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:02:57,705 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:02:57,706 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:02:27" (3/4) ... [2023-11-29 02:02:57,708 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:02:57,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:02:57,710 INFO L158 Benchmark]: Toolchain (without parser) took 32207.44ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 67.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 799.3MB. Max. memory is 16.1GB. [2023-11-29 02:02:57,710 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 56.6MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:02:57,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.72ms. Allocated memory is still 96.5MB. Free memory was 67.0MB in the beginning and 64.8MB in the end (delta: 2.2MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-11-29 02:02:57,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.29ms. Allocated memory is still 96.5MB. Free memory was 64.8MB in the beginning and 62.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:02:57,711 INFO L158 Benchmark]: Boogie Preprocessor took 61.56ms. Allocated memory is still 96.5MB. Free memory was 62.0MB in the beginning and 58.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:02:57,711 INFO L158 Benchmark]: RCFGBuilder took 874.75ms. Allocated memory is still 96.5MB. Free memory was 58.1MB in the beginning and 48.8MB in the end (delta: 9.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-11-29 02:02:57,711 INFO L158 Benchmark]: TraceAbstraction took 30640.38ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 48.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 781.3MB. Max. memory is 16.1GB. [2023-11-29 02:02:57,711 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 1.9GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:02:57,713 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.28ms. Allocated memory is still 56.6MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.72ms. Allocated memory is still 96.5MB. Free memory was 67.0MB in the beginning and 64.8MB in the end (delta: 2.2MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.29ms. Allocated memory is still 96.5MB. Free memory was 64.8MB in the beginning and 62.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.56ms. Allocated memory is still 96.5MB. Free memory was 62.0MB in the beginning and 58.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 874.75ms. Allocated memory is still 96.5MB. Free memory was 58.1MB in the beginning and 48.8MB in the end (delta: 9.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 30640.38ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 48.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 781.3MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 1.9GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={6:0}, t938={-2147483646:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={6:0}, t938={-2147483646:0}, t939={-2147483641:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={6:0}, t938={-2147483646:0}, t939={-2147483641:0}, t940={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L829] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937={6:0}, t938={-2147483646:0}, t939={-2147483641:0}, t940={7:0}, weak$$choice2=0, x=1, y=1, z=1] [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937={6:0}, t938={-2147483646:0}, t939={-2147483641:0}, t940={7:0}, weak$$choice2=0, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937={6:0}, t938={-2147483646:0}, t939={-2147483641:0}, t940={7:0}, weak$$choice2=0, x=1, y=1, z=1] [L895] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix036.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 880]: 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: 874]: 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: 878]: 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, 101 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: 30.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 976 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 806 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 83 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2675 IncrementalHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 24 mSDtfsCounter, 2675 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=945occurred in iteration=18, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 368 ConstructedInterpolants, 1 QuantifiedInterpolants, 2956 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2578 ConjunctsInSsa, 104 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 02:02:57,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd1209e9-d9c1-453c-94f1-e5fd46a00212/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