./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 20a2c57970e5e291ffc10826c9a5fbe3296a1e55ae86cfd2b786718aae571bfa --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:27:35,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:27:35,858 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:27:35,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:27:35,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:27:35,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:27:35,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:27:35,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:27:35,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:27:35,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:27:35,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:27:35,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:27:35,943 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:27:35,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:27:35,945 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:27:35,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:27:35,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:27:35,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:27:35,947 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:27:35,948 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:27:35,948 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:27:35,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:27:35,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:27:35,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:27:35,950 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:27:35,951 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:27:35,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:27:35,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:27:35,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:27:35,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:27:35,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:27:35,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:27:35,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:27:35,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:27:35,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:27:35,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:27:35,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:27:35,957 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:27:35,957 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_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/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_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 20a2c57970e5e291ffc10826c9a5fbe3296a1e55ae86cfd2b786718aae571bfa [2023-11-06 22:27:36,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:27:36,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:27:36,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:27:36,383 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:27:36,384 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:27:36,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix030_tso.i [2023-11-06 22:27:39,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:27:39,845 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:27:39,845 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/sv-benchmarks/c/pthread-wmm/mix030_tso.i [2023-11-06 22:27:39,866 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/data/7aece4fe3/03b50f09d93749c89ea561ca573e8128/FLAGa4f173373 [2023-11-06 22:27:39,882 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/data/7aece4fe3/03b50f09d93749c89ea561ca573e8128 [2023-11-06 22:27:39,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:27:39,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:27:39,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:27:39,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:27:39,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:27:39,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:39" (1/1) ... [2023-11-06 22:27:39,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77187c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:39, skipping insertion in model container [2023-11-06 22:27:39,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:39" (1/1) ... [2023-11-06 22:27:39,958 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:27:40,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:27:40,427 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:27:40,518 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:27:40,582 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:40,582 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:40,591 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:27:40,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40 WrapperNode [2023-11-06 22:27:40,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:27:40,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:27:40,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:27:40,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:27:40,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (1/1) ... [2023-11-06 22:27:40,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (1/1) ... [2023-11-06 22:27:40,706 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 185 [2023-11-06 22:27:40,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:27:40,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:27:40,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:27:40,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:27:40,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (1/1) ... [2023-11-06 22:27:40,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (1/1) ... [2023-11-06 22:27:40,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (1/1) ... [2023-11-06 22:27:40,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (1/1) ... [2023-11-06 22:27:40,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (1/1) ... [2023-11-06 22:27:40,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (1/1) ... [2023-11-06 22:27:40,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (1/1) ... [2023-11-06 22:27:40,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (1/1) ... [2023-11-06 22:27:40,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:27:40,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:27:40,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:27:40,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:27:40,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (1/1) ... [2023-11-06 22:27:40,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:27:40,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:40,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:27:40,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:27:40,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:27:40,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:27:40,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:27:40,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:27:40,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:27:40,960 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:27:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:27:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:27:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:27:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:27:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:27:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:27:40,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:27:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:27:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:27:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:27:40,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:27:40,966 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:27:41,198 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:27:41,200 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:27:41,726 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:27:41,926 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:27:41,926 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:27:41,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:41 BoogieIcfgContainer [2023-11-06 22:27:41,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:27:41,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:27:41,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:27:41,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:27:41,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:27:39" (1/3) ... [2023-11-06 22:27:41,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42365f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:41, skipping insertion in model container [2023-11-06 22:27:41,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:40" (2/3) ... [2023-11-06 22:27:41,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42365f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:41, skipping insertion in model container [2023-11-06 22:27:41,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:41" (3/3) ... [2023-11-06 22:27:41,943 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_tso.i [2023-11-06 22:27:41,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:27:41,965 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:27:41,966 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:27:42,062 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:27:42,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 310 flow [2023-11-06 22:27:42,235 INFO L124 PetriNetUnfolderBase]: 3/143 cut-off events. [2023-11-06 22:27:42,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:42,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 3/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:27:42,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 147 transitions, 310 flow [2023-11-06 22:27:42,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 143 transitions, 298 flow [2023-11-06 22:27:42,259 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:27:42,280 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 143 transitions, 298 flow [2023-11-06 22:27:42,285 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 143 transitions, 298 flow [2023-11-06 22:27:42,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 298 flow [2023-11-06 22:27:42,390 INFO L124 PetriNetUnfolderBase]: 3/143 cut-off events. [2023-11-06 22:27:42,390 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:42,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 3/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:27:42,396 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-11-06 22:27:51,714 INFO L134 LiptonReduction]: Checked pairs total: 9335 [2023-11-06 22:27:51,715 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-11-06 22:27:51,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:27:51,738 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;@5b43637b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:27:51,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:27:51,740 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:27:51,741 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:27:51,741 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:51,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:51,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:27:51,742 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:27:51,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:51,747 INFO L85 PathProgramCache]: Analyzing trace with hash 667, now seen corresponding path program 1 times [2023-11-06 22:27:51,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:51,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219916341] [2023-11-06 22:27:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:51,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:51,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219916341] [2023-11-06 22:27:51,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219916341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:51,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:51,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:27:51,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321978811] [2023-11-06 22:27:51,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:51,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:27:51,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:51,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:27:51,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:27:51,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 295 [2023-11-06 22:27:51,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:51,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:51,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 295 [2023-11-06 22:27:51,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:53,229 INFO L124 PetriNetUnfolderBase]: 3743/5213 cut-off events. [2023-11-06 22:27:53,230 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-11-06 22:27:53,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10453 conditions, 5213 events. 3743/5213 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 26368 event pairs, 3743 based on Foata normal form. 0/4507 useless extension candidates. Maximal degree in co-relation 10441. Up to 5137 conditions per place. [2023-11-06 22:27:53,285 INFO L140 encePairwiseOnDemand]: 286/295 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-11-06 22:27:53,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-11-06 22:27:53,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:27:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:27:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 298 transitions. [2023-11-06 22:27:53,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050847457627119 [2023-11-06 22:27:53,310 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 298 transitions. [2023-11-06 22:27:53,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 298 transitions. [2023-11-06 22:27:53,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:53,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 298 transitions. [2023-11-06 22:27:53,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.0) internal successors, (298), 2 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-06 22:27:53,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:53,331 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:53,333 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 298 transitions. [2023-11-06 22:27:53,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-11-06 22:27:53,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:27:53,344 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-11-06 22:27:53,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-06 22:27:53,351 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-11-06 22:27:53,352 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-11-06 22:27:53,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:53,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:53,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:53,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:27:53,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:27:53,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:53,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2096634614, now seen corresponding path program 1 times [2023-11-06 22:27:53,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:53,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234163980] [2023-11-06 22:27:53,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:53,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:53,844 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-06 22:27:53,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:53,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234163980] [2023-11-06 22:27:53,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234163980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:53,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:53,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:27:53,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907590458] [2023-11-06 22:27:53,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:53,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:27:53,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:53,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:27:53,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:27:53,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2023-11-06 22:27:53,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 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-06 22:27:53,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:53,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2023-11-06 22:27:53,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:54,877 INFO L124 PetriNetUnfolderBase]: 3113/4529 cut-off events. [2023-11-06 22:27:54,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:54,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8920 conditions, 4529 events. 3113/4529 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 24797 event pairs, 593 based on Foata normal form. 0/4156 useless extension candidates. Maximal degree in co-relation 8917. Up to 3385 conditions per place. [2023-11-06 22:27:54,921 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-11-06 22:27:54,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 160 flow [2023-11-06 22:27:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:27:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:27:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-11-06 22:27:54,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4858757062146893 [2023-11-06 22:27:54,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-11-06 22:27:54,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-11-06 22:27:54,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:54,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-11-06 22:27:54,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:54,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:54,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:54,940 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 430 transitions. [2023-11-06 22:27:54,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 160 flow [2023-11-06 22:27:54,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:27:54,943 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-11-06 22:27:54,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-06 22:27:54,945 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-11-06 22:27:54,945 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-11-06 22:27:54,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 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-06 22:27:54,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:54,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:54,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:27:54,953 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:27:54,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash -526155220, now seen corresponding path program 1 times [2023-11-06 22:27:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:54,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886464603] [2023-11-06 22:27:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:56,239 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-06 22:27:56,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:56,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886464603] [2023-11-06 22:27:56,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886464603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:56,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:56,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:27:56,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127094684] [2023-11-06 22:27:56,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:56,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:27:56,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:56,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:27:56,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:27:56,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 295 [2023-11-06 22:27:56,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:56,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:56,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 295 [2023-11-06 22:27:56,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:57,183 INFO L124 PetriNetUnfolderBase]: 2075/3012 cut-off events. [2023-11-06 22:27:57,184 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2023-11-06 22:27:57,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6151 conditions, 3012 events. 2075/3012 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15112 event pairs, 447 based on Foata normal form. 0/2976 useless extension candidates. Maximal degree in co-relation 6147. Up to 2763 conditions per place. [2023-11-06 22:27:57,216 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 31 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-11-06 22:27:57,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 160 flow [2023-11-06 22:27:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:27:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:27:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2023-11-06 22:27:57,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2023-11-06 22:27:57,221 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 708 transitions. [2023-11-06 22:27:57,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 708 transitions. [2023-11-06 22:27:57,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:57,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 708 transitions. [2023-11-06 22:27:57,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:57,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:57,232 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:57,233 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 6 states and 708 transitions. [2023-11-06 22:27:57,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 160 flow [2023-11-06 22:27:57,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:27:57,237 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 68 flow [2023-11-06 22:27:57,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-11-06 22:27:57,239 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-11-06 22:27:57,239 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 68 flow [2023-11-06 22:27:57,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:57,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:57,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:57,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:27:57,241 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:27:57,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash -526155232, now seen corresponding path program 1 times [2023-11-06 22:27:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:57,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902070663] [2023-11-06 22:27:57,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:58,385 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-06 22:27:58,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:58,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902070663] [2023-11-06 22:27:58,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902070663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:58,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:58,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:27:58,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536379446] [2023-11-06 22:27:58,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:58,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:58,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:58,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:58,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:58,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 295 [2023-11-06 22:27:58,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:58,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:58,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 295 [2023-11-06 22:27:58,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:59,972 INFO L124 PetriNetUnfolderBase]: 7071/10136 cut-off events. [2023-11-06 22:27:59,973 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-11-06 22:28:00,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20319 conditions, 10136 events. 7071/10136 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 56329 event pairs, 511 based on Foata normal form. 312/10448 useless extension candidates. Maximal degree in co-relation 20315. Up to 6389 conditions per place. [2023-11-06 22:28:00,080 INFO L140 encePairwiseOnDemand]: 283/295 looper letters, 47 selfloop transitions, 13 changer transitions 0/61 dead transitions. [2023-11-06 22:28:00,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 270 flow [2023-11-06 22:28:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:28:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-11-06 22:28:00,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559322033898305 [2023-11-06 22:28:00,084 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-11-06 22:28:00,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-11-06 22:28:00,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:00,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-11-06 22:28:00,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:00,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:00,093 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:00,093 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 68 flow. Second operand 4 states and 538 transitions. [2023-11-06 22:28:00,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 270 flow [2023-11-06 22:28:00,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 259 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:28:00,097 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 161 flow [2023-11-06 22:28:00,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-11-06 22:28:00,098 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2023-11-06 22:28:00,098 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 161 flow [2023-11-06 22:28:00,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:00,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:00,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:00,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:28:00,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:00,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:00,100 INFO L85 PathProgramCache]: Analyzing trace with hash 869054762, now seen corresponding path program 1 times [2023-11-06 22:28:00,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:00,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046034506] [2023-11-06 22:28:00,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:00,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:01,190 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-06 22:28:01,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:01,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046034506] [2023-11-06 22:28:01,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046034506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:01,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:01,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:28:01,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497835040] [2023-11-06 22:28:01,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:01,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:01,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:01,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 295 [2023-11-06 22:28:01,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:01,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:01,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 295 [2023-11-06 22:28:01,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:02,970 INFO L124 PetriNetUnfolderBase]: 7091/10078 cut-off events. [2023-11-06 22:28:02,970 INFO L125 PetriNetUnfolderBase]: For 5842/5852 co-relation queries the response was YES. [2023-11-06 22:28:02,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28742 conditions, 10078 events. 7091/10078 cut-off events. For 5842/5852 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 55059 event pairs, 689 based on Foata normal form. 36/10112 useless extension candidates. Maximal degree in co-relation 28736. Up to 6313 conditions per place. [2023-11-06 22:28:03,043 INFO L140 encePairwiseOnDemand]: 283/295 looper letters, 53 selfloop transitions, 23 changer transitions 0/77 dead transitions. [2023-11-06 22:28:03,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 449 flow [2023-11-06 22:28:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:28:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-11-06 22:28:03,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45847457627118643 [2023-11-06 22:28:03,046 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-11-06 22:28:03,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-11-06 22:28:03,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:03,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-11-06 22:28:03,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:03,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:03,053 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:03,054 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 161 flow. Second operand 4 states and 541 transitions. [2023-11-06 22:28:03,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 449 flow [2023-11-06 22:28:03,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 449 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:28:03,058 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 327 flow [2023-11-06 22:28:03,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=327, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2023-11-06 22:28:03,059 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-11-06 22:28:03,060 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 327 flow [2023-11-06 22:28:03,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:03,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:03,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:03,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:28:03,061 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:03,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:03,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1169428168, now seen corresponding path program 1 times [2023-11-06 22:28:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:03,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248969325] [2023-11-06 22:28:03,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:03,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,953 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-06 22:28:03,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248969325] [2023-11-06 22:28:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248969325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:03,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:03,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577670966] [2023-11-06 22:28:03,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:03,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:03,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:03,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:04,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 295 [2023-11-06 22:28:04,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:04,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:04,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 295 [2023-11-06 22:28:04,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:06,100 INFO L124 PetriNetUnfolderBase]: 8797/12440 cut-off events. [2023-11-06 22:28:06,100 INFO L125 PetriNetUnfolderBase]: For 20604/20604 co-relation queries the response was YES. [2023-11-06 22:28:06,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44033 conditions, 12440 events. 8797/12440 cut-off events. For 20604/20604 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 68184 event pairs, 1933 based on Foata normal form. 192/12632 useless extension candidates. Maximal degree in co-relation 44024. Up to 5687 conditions per place. [2023-11-06 22:28:06,211 INFO L140 encePairwiseOnDemand]: 283/295 looper letters, 58 selfloop transitions, 29 changer transitions 0/88 dead transitions. [2023-11-06 22:28:06,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 88 transitions, 691 flow [2023-11-06 22:28:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:28:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2023-11-06 22:28:06,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576271186440678 [2023-11-06 22:28:06,215 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2023-11-06 22:28:06,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2023-11-06 22:28:06,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:06,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2023-11-06 22:28:06,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:06,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:06,221 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:06,222 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 327 flow. Second operand 4 states and 540 transitions. [2023-11-06 22:28:06,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 88 transitions, 691 flow [2023-11-06 22:28:06,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 689 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-06 22:28:06,253 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 573 flow [2023-11-06 22:28:06,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=573, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2023-11-06 22:28:06,256 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-11-06 22:28:06,259 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 573 flow [2023-11-06 22:28:06,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:06,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:06,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:06,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:28:06,261 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:06,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1169493516, now seen corresponding path program 1 times [2023-11-06 22:28:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143578926] [2023-11-06 22:28:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:07,181 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-06 22:28:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143578926] [2023-11-06 22:28:07,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143578926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:07,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:07,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:28:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238345424] [2023-11-06 22:28:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:07,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:07,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:07,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:07,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:07,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 295 [2023-11-06 22:28:07,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 573 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:07,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:07,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 295 [2023-11-06 22:28:07,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:08,969 INFO L124 PetriNetUnfolderBase]: 8287/11690 cut-off events. [2023-11-06 22:28:08,969 INFO L125 PetriNetUnfolderBase]: For 38376/38376 co-relation queries the response was YES. [2023-11-06 22:28:09,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47596 conditions, 11690 events. 8287/11690 cut-off events. For 38376/38376 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 62368 event pairs, 1845 based on Foata normal form. 84/11772 useless extension candidates. Maximal degree in co-relation 47584. Up to 5707 conditions per place. [2023-11-06 22:28:09,053 INFO L140 encePairwiseOnDemand]: 284/295 looper letters, 67 selfloop transitions, 27 changer transitions 3/98 dead transitions. [2023-11-06 22:28:09,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 98 transitions, 1069 flow [2023-11-06 22:28:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:28:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2023-11-06 22:28:09,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44661016949152543 [2023-11-06 22:28:09,056 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 527 transitions. [2023-11-06 22:28:09,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 527 transitions. [2023-11-06 22:28:09,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:09,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 527 transitions. [2023-11-06 22:28:09,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:09,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:09,062 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:09,062 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 573 flow. Second operand 4 states and 527 transitions. [2023-11-06 22:28:09,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 98 transitions, 1069 flow [2023-11-06 22:28:09,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 98 transitions, 1021 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 22:28:09,128 INFO L231 Difference]: Finished difference. Result has 60 places, 76 transitions, 852 flow [2023-11-06 22:28:09,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=852, PETRI_PLACES=60, PETRI_TRANSITIONS=76} [2023-11-06 22:28:09,130 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2023-11-06 22:28:09,130 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 76 transitions, 852 flow [2023-11-06 22:28:09,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:09,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:09,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:09,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:28:09,132 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:09,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:09,132 INFO L85 PathProgramCache]: Analyzing trace with hash 60402261, now seen corresponding path program 1 times [2023-11-06 22:28:09,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118654086] [2023-11-06 22:28:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:09,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:09,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118654086] [2023-11-06 22:28:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118654086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:09,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:09,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897301534] [2023-11-06 22:28:09,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:09,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:09,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:09,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:09,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:09,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 295 [2023-11-06 22:28:09,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 76 transitions, 852 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:09,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:09,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 295 [2023-11-06 22:28:09,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:10,814 INFO L124 PetriNetUnfolderBase]: 5891/8773 cut-off events. [2023-11-06 22:28:10,814 INFO L125 PetriNetUnfolderBase]: For 51320/53555 co-relation queries the response was YES. [2023-11-06 22:28:10,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37910 conditions, 8773 events. 5891/8773 cut-off events. For 51320/53555 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 54088 event pairs, 945 based on Foata normal form. 1802/10357 useless extension candidates. Maximal degree in co-relation 37895. Up to 5633 conditions per place. [2023-11-06 22:28:10,890 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 124 selfloop transitions, 9 changer transitions 29/184 dead transitions. [2023-11-06 22:28:10,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 184 transitions, 2333 flow [2023-11-06 22:28:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:28:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-11-06 22:28:10,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46711864406779663 [2023-11-06 22:28:10,896 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-11-06 22:28:10,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-11-06 22:28:10,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:10,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-11-06 22:28:10,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:10,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:10,905 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:10,905 INFO L175 Difference]: Start difference. First operand has 60 places, 76 transitions, 852 flow. Second operand 5 states and 689 transitions. [2023-11-06 22:28:10,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 184 transitions, 2333 flow [2023-11-06 22:28:10,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 184 transitions, 2316 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:28:10,947 INFO L231 Difference]: Finished difference. Result has 66 places, 83 transitions, 930 flow [2023-11-06 22:28:10,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=930, PETRI_PLACES=66, PETRI_TRANSITIONS=83} [2023-11-06 22:28:10,949 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-11-06 22:28:10,949 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 83 transitions, 930 flow [2023-11-06 22:28:10,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:10,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:10,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:10,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:28:10,950 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:10,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash -94830034, now seen corresponding path program 1 times [2023-11-06 22:28:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:10,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861255230] [2023-11-06 22:28:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:12,158 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-06 22:28:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861255230] [2023-11-06 22:28:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861255230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:12,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:12,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144627325] [2023-11-06 22:28:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:12,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:12,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 295 [2023-11-06 22:28:12,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 83 transitions, 930 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:12,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:12,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 295 [2023-11-06 22:28:12,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:14,196 INFO L124 PetriNetUnfolderBase]: 8713/13064 cut-off events. [2023-11-06 22:28:14,196 INFO L125 PetriNetUnfolderBase]: For 69002/69002 co-relation queries the response was YES. [2023-11-06 22:28:14,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67815 conditions, 13064 events. 8713/13064 cut-off events. For 69002/69002 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 80651 event pairs, 2452 based on Foata normal form. 78/13142 useless extension candidates. Maximal degree in co-relation 67796. Up to 6257 conditions per place. [2023-11-06 22:28:14,293 INFO L140 encePairwiseOnDemand]: 283/295 looper letters, 82 selfloop transitions, 29 changer transitions 28/140 dead transitions. [2023-11-06 22:28:14,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 140 transitions, 1636 flow [2023-11-06 22:28:14,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:28:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-11-06 22:28:14,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45847457627118643 [2023-11-06 22:28:14,298 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-11-06 22:28:14,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-11-06 22:28:14,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:14,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-11-06 22:28:14,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:14,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:14,305 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:14,305 INFO L175 Difference]: Start difference. First operand has 66 places, 83 transitions, 930 flow. Second operand 4 states and 541 transitions. [2023-11-06 22:28:14,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 140 transitions, 1636 flow [2023-11-06 22:28:14,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 140 transitions, 1623 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:28:14,448 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 1023 flow [2023-11-06 22:28:14,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1023, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2023-11-06 22:28:14,449 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2023-11-06 22:28:14,450 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 1023 flow [2023-11-06 22:28:14,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:14,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:14,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:14,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:28:14,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:14,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1103593168, now seen corresponding path program 1 times [2023-11-06 22:28:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695595291] [2023-11-06 22:28:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:14,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:14,727 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-06 22:28:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:14,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695595291] [2023-11-06 22:28:14,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695595291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:14,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:14,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:14,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745090918] [2023-11-06 22:28:14,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:14,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:14,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:14,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:14,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:14,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 295 [2023-11-06 22:28:14,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 1023 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:14,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:14,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 295 [2023-11-06 22:28:14,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:15,986 INFO L124 PetriNetUnfolderBase]: 3651/5830 cut-off events. [2023-11-06 22:28:15,986 INFO L125 PetriNetUnfolderBase]: For 49033/50761 co-relation queries the response was YES. [2023-11-06 22:28:16,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29388 conditions, 5830 events. 3651/5830 cut-off events. For 49033/50761 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 37560 event pairs, 362 based on Foata normal form. 1267/6968 useless extension candidates. Maximal degree in co-relation 29367. Up to 2673 conditions per place. [2023-11-06 22:28:16,034 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 153 selfloop transitions, 14 changer transitions 26/212 dead transitions. [2023-11-06 22:28:16,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 212 transitions, 3074 flow [2023-11-06 22:28:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:28:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:28:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2023-11-06 22:28:16,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46836158192090394 [2023-11-06 22:28:16,040 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 829 transitions. [2023-11-06 22:28:16,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 829 transitions. [2023-11-06 22:28:16,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:16,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 829 transitions. [2023-11-06 22:28:16,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:16,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:16,050 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:16,051 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 1023 flow. Second operand 6 states and 829 transitions. [2023-11-06 22:28:16,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 212 transitions, 3074 flow [2023-11-06 22:28:16,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 212 transitions, 3058 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-06 22:28:16,163 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 1113 flow [2023-11-06 22:28:16,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1113, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2023-11-06 22:28:16,164 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 26 predicate places. [2023-11-06 22:28:16,164 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 1113 flow [2023-11-06 22:28:16,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:16,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:16,165 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] [2023-11-06 22:28:16,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:28:16,166 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:16,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:16,166 INFO L85 PathProgramCache]: Analyzing trace with hash -257058291, now seen corresponding path program 1 times [2023-11-06 22:28:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518454847] [2023-11-06 22:28:16,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:16,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,517 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-06 22:28:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518454847] [2023-11-06 22:28:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518454847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:16,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021491701] [2023-11-06 22:28:16,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:16,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:16,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:16,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 295 [2023-11-06 22:28:16,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 1113 flow. Second operand has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:16,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:16,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 295 [2023-11-06 22:28:16,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:17,648 INFO L124 PetriNetUnfolderBase]: 3132/5104 cut-off events. [2023-11-06 22:28:17,648 INFO L125 PetriNetUnfolderBase]: For 40213/41760 co-relation queries the response was YES. [2023-11-06 22:28:17,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29063 conditions, 5104 events. 3132/5104 cut-off events. For 40213/41760 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 33402 event pairs, 186 based on Foata normal form. 885/5875 useless extension candidates. Maximal degree in co-relation 29039. Up to 2481 conditions per place. [2023-11-06 22:28:17,685 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 146 selfloop transitions, 22 changer transitions 58/243 dead transitions. [2023-11-06 22:28:17,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 243 transitions, 3523 flow [2023-11-06 22:28:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:28:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1104 transitions. [2023-11-06 22:28:17,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46779661016949153 [2023-11-06 22:28:17,690 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1104 transitions. [2023-11-06 22:28:17,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1104 transitions. [2023-11-06 22:28:17,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:17,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1104 transitions. [2023-11-06 22:28:17,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:17,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:17,703 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:17,703 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 1113 flow. Second operand 8 states and 1104 transitions. [2023-11-06 22:28:17,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 243 transitions, 3523 flow [2023-11-06 22:28:17,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 243 transitions, 3446 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-11-06 22:28:17,984 INFO L231 Difference]: Finished difference. Result has 82 places, 87 transitions, 1105 flow [2023-11-06 22:28:17,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1105, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2023-11-06 22:28:17,985 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2023-11-06 22:28:17,985 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 1105 flow [2023-11-06 22:28:17,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:17,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:17,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:17,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:28:17,986 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:17,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1489856791, now seen corresponding path program 1 times [2023-11-06 22:28:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:17,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685495589] [2023-11-06 22:28:17,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:17,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:18,306 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-06 22:28:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:18,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685495589] [2023-11-06 22:28:18,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685495589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:18,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:18,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063160954] [2023-11-06 22:28:18,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:18,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:28:18,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:18,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:28:18,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:18,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 295 [2023-11-06 22:28:18,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 1105 flow. Second operand has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:18,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:18,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 295 [2023-11-06 22:28:18,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:19,314 INFO L124 PetriNetUnfolderBase]: 2873/4772 cut-off events. [2023-11-06 22:28:19,315 INFO L125 PetriNetUnfolderBase]: For 35589/36500 co-relation queries the response was YES. [2023-11-06 22:28:19,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27082 conditions, 4772 events. 2873/4772 cut-off events. For 35589/36500 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 31982 event pairs, 170 based on Foata normal form. 479/5139 useless extension candidates. Maximal degree in co-relation 27057. Up to 1724 conditions per place. [2023-11-06 22:28:19,347 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 82 selfloop transitions, 21 changer transitions 122/234 dead transitions. [2023-11-06 22:28:19,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 234 transitions, 3382 flow [2023-11-06 22:28:19,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:28:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:28:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1354 transitions. [2023-11-06 22:28:19,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4589830508474576 [2023-11-06 22:28:19,353 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1354 transitions. [2023-11-06 22:28:19,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1354 transitions. [2023-11-06 22:28:19,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:19,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1354 transitions. [2023-11-06 22:28:19,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 135.4) internal successors, (1354), 10 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:19,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 295.0) internal successors, (3245), 11 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:19,366 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 295.0) internal successors, (3245), 11 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:19,366 INFO L175 Difference]: Start difference. First operand has 82 places, 87 transitions, 1105 flow. Second operand 10 states and 1354 transitions. [2023-11-06 22:28:19,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 234 transitions, 3382 flow [2023-11-06 22:28:19,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 234 transitions, 3178 flow, removed 43 selfloop flow, removed 6 redundant places. [2023-11-06 22:28:19,770 INFO L231 Difference]: Finished difference. Result has 88 places, 58 transitions, 603 flow [2023-11-06 22:28:19,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=603, PETRI_PLACES=88, PETRI_TRANSITIONS=58} [2023-11-06 22:28:19,771 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2023-11-06 22:28:19,771 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 58 transitions, 603 flow [2023-11-06 22:28:19,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:19,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:19,773 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-06 22:28:19,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:28:19,773 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:19,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash 411066976, now seen corresponding path program 1 times [2023-11-06 22:28:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:19,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306902687] [2023-11-06 22:28:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:20,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:20,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306902687] [2023-11-06 22:28:20,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306902687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:20,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:20,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:20,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227234311] [2023-11-06 22:28:20,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:20,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:20,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:20,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:20,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:20,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 295 [2023-11-06 22:28:20,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 58 transitions, 603 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:20,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:20,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 295 [2023-11-06 22:28:20,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:20,440 INFO L124 PetriNetUnfolderBase]: 680/1230 cut-off events. [2023-11-06 22:28:20,440 INFO L125 PetriNetUnfolderBase]: For 7885/7909 co-relation queries the response was YES. [2023-11-06 22:28:20,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6936 conditions, 1230 events. 680/1230 cut-off events. For 7885/7909 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6375 event pairs, 188 based on Foata normal form. 13/1236 useless extension candidates. Maximal degree in co-relation 6909. Up to 762 conditions per place. [2023-11-06 22:28:20,449 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 40 selfloop transitions, 1 changer transitions 56/100 dead transitions. [2023-11-06 22:28:20,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 100 transitions, 1173 flow [2023-11-06 22:28:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:28:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2023-11-06 22:28:20,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728813559322034 [2023-11-06 22:28:20,453 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2023-11-06 22:28:20,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2023-11-06 22:28:20,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:20,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2023-11-06 22:28:20,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:20,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:20,459 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:20,459 INFO L175 Difference]: Start difference. First operand has 88 places, 58 transitions, 603 flow. Second operand 4 states and 558 transitions. [2023-11-06 22:28:20,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 100 transitions, 1173 flow [2023-11-06 22:28:20,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 909 flow, removed 61 selfloop flow, removed 17 redundant places. [2023-11-06 22:28:20,483 INFO L231 Difference]: Finished difference. Result has 73 places, 42 transitions, 290 flow [2023-11-06 22:28:20,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=73, PETRI_TRANSITIONS=42} [2023-11-06 22:28:20,485 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-11-06 22:28:20,485 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 42 transitions, 290 flow [2023-11-06 22:28:20,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:20,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:20,486 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-06 22:28:20,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:28:20,486 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:20,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:20,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1663170128, now seen corresponding path program 2 times [2023-11-06 22:28:20,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:20,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067149308] [2023-11-06 22:28:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:20,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:21,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-06 22:28:21,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:21,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067149308] [2023-11-06 22:28:21,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067149308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:21,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:21,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:21,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577287094] [2023-11-06 22:28:21,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:21,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:28:21,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:21,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:28:21,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:28:22,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 295 [2023-11-06 22:28:22,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 42 transitions, 290 flow. Second operand has 8 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:22,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:22,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 295 [2023-11-06 22:28:22,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:22,404 INFO L124 PetriNetUnfolderBase]: 171/330 cut-off events. [2023-11-06 22:28:22,404 INFO L125 PetriNetUnfolderBase]: For 881/883 co-relation queries the response was YES. [2023-11-06 22:28:22,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 330 events. 171/330 cut-off events. For 881/883 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1118 event pairs, 14 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 1443. Up to 152 conditions per place. [2023-11-06 22:28:22,407 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 45 selfloop transitions, 4 changer transitions 19/71 dead transitions. [2023-11-06 22:28:22,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 71 transitions, 612 flow [2023-11-06 22:28:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:28:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:28:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 789 transitions. [2023-11-06 22:28:22,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4457627118644068 [2023-11-06 22:28:22,412 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 789 transitions. [2023-11-06 22:28:22,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 789 transitions. [2023-11-06 22:28:22,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:22,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 789 transitions. [2023-11-06 22:28:22,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:22,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:22,420 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:22,420 INFO L175 Difference]: Start difference. First operand has 73 places, 42 transitions, 290 flow. Second operand 6 states and 789 transitions. [2023-11-06 22:28:22,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 71 transitions, 612 flow [2023-11-06 22:28:22,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 71 transitions, 539 flow, removed 15 selfloop flow, removed 10 redundant places. [2023-11-06 22:28:22,426 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 221 flow [2023-11-06 22:28:22,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2023-11-06 22:28:22,428 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-11-06 22:28:22,428 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 221 flow [2023-11-06 22:28:22,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:22,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:22,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:22,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:28:22,429 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:22,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1749659444, now seen corresponding path program 3 times [2023-11-06 22:28:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:22,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660757430] [2023-11-06 22:28:22,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:22,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:28:22,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:28:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:28:22,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:28:22,666 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:28:22,667 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:28:22,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:28:22,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:28:22,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:28:22,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:28:22,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:28:22,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:28:22,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:28:22,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:28:22,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:28:22,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:28:22,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:28:22,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:28:22,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:28:22,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:28:22,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:28:22,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:28:22,675 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:22,683 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:28:22,683 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:28:22,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:28:22 BasicIcfg [2023-11-06 22:28:22,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:28:22,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:28:22,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:28:22,836 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:28:22,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:41" (3/4) ... [2023-11-06 22:28:22,838 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:28:22,840 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:28:22,840 INFO L158 Benchmark]: Toolchain (without parser) took 42953.50ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 124.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 580.4MB. Max. memory is 16.1GB. [2023-11-06 22:28:22,841 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 125.8MB. Free memory was 97.6MB in the beginning and 97.5MB in the end (delta: 68.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:28:22,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.40ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 100.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:28:22,842 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.78ms. Allocated memory is still 159.4MB. Free memory was 100.2MB in the beginning and 97.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:28:22,842 INFO L158 Benchmark]: Boogie Preprocessor took 74.94ms. Allocated memory is still 159.4MB. Free memory was 97.2MB in the beginning and 95.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:28:22,843 INFO L158 Benchmark]: RCFGBuilder took 1145.55ms. Allocated memory is still 159.4MB. Free memory was 94.5MB in the beginning and 82.6MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:28:22,843 INFO L158 Benchmark]: TraceAbstraction took 40901.27ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 82.6MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 537.2MB. Max. memory is 16.1GB. [2023-11-06 22:28:22,844 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:28:22,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 125.8MB. Free memory was 97.6MB in the beginning and 97.5MB in the end (delta: 68.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 703.40ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 100.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.78ms. Allocated memory is still 159.4MB. Free memory was 100.2MB in the beginning and 97.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.94ms. Allocated memory is still 159.4MB. Free memory was 97.2MB in the beginning and 95.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1145.55ms. Allocated memory is still 159.4MB. Free memory was 94.5MB in the beginning and 82.6MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40901.27ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 82.6MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 537.2MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 153 PlacesBefore, 50 PlacesAfterwards, 143 TransitionsBefore, 38 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 148 TotalNumberOfCompositions, 9335 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4086, independent: 3885, independent conditional: 0, independent unconditional: 3885, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1989, independent: 1936, independent conditional: 0, independent unconditional: 1936, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4086, independent: 1949, independent conditional: 0, independent unconditional: 1949, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 1989, unknown conditional: 0, unknown unconditional: 1989] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L852] 0 pthread_t t825; [L853] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t825, ((void *)0), P0, ((void *)0))=-3, t825={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 pthread_t t826; [L855] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t826, ((void *)0), P1, ((void *)0))=-2, t825={5:0}, t826={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 pthread_t t827; [L857] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t827, ((void *)0), P2, ((void *)0))=-1, t825={5:0}, t826={6:0}, t827={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t828; [L859] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t828, ((void *)0), P3, ((void *)0))=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 4 z$flush_delayed = weak$$choice2 [L814] 4 z$mem_tmp = z [L815] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L816] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L819] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L821] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 __unbuffered_p3_EAX = z [L823] 4 z = z$flush_delayed ? z$mem_tmp : z [L824] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L830] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L831] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L832] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L834] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L866] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L867] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L868] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L869] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={3:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 z$flush_delayed = weak$$choice2 [L875] 0 z$mem_tmp = z [L876] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L877] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L878] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L879] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L880] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L882] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 0 z = z$flush_delayed ? z$mem_tmp : z [L885] 0 z$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix030_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 857]: 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: 855]: 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: 859]: 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, 181 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: 40.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 753 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1613 IncrementalHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 96 mSDtfsCounter, 1613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1113occurred in iteration=10, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 1999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:28:22,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 20a2c57970e5e291ffc10826c9a5fbe3296a1e55ae86cfd2b786718aae571bfa --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:28:25,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:28:26,008 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:28:26,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:28:26,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:28:26,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:28:26,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:28:26,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:28:26,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:28:26,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:28:26,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:28:26,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:28:26,086 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:28:26,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:28:26,089 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:28:26,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:28:26,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:28:26,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:28:26,091 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:28:26,092 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:28:26,093 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:28:26,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:28:26,094 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:28:26,094 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:28:26,095 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:28:26,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:28:26,096 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:28:26,096 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:28:26,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:28:26,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:28:26,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:28:26,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:28:26,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:28:26,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:28:26,101 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:28:26,102 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:28:26,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:28:26,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:28:26,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:28:26,104 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:28:26,104 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:28:26,105 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_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/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_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 20a2c57970e5e291ffc10826c9a5fbe3296a1e55ae86cfd2b786718aae571bfa [2023-11-06 22:28:26,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:28:26,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:28:26,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:28:26,589 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:28:26,590 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:28:26,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix030_tso.i [2023-11-06 22:28:29,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:28:30,364 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:28:30,365 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/sv-benchmarks/c/pthread-wmm/mix030_tso.i [2023-11-06 22:28:30,385 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/data/d481c8184/9d362cc6312e4eec9169cf0461eeb6bf/FLAG3b3ff36ca [2023-11-06 22:28:30,403 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/data/d481c8184/9d362cc6312e4eec9169cf0461eeb6bf [2023-11-06 22:28:30,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:28:30,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:28:30,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:28:30,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:28:30,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:28:30,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:30" (1/1) ... [2023-11-06 22:28:30,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134065e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:30, skipping insertion in model container [2023-11-06 22:28:30,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:30" (1/1) ... [2023-11-06 22:28:30,476 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:28:31,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:28:31,153 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:28:31,271 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:28:31,364 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:28:31,364 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:28:31,373 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:28:31,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31 WrapperNode [2023-11-06 22:28:31,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:28:31,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:28:31,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:28:31,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:28:31,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (1/1) ... [2023-11-06 22:28:31,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (1/1) ... [2023-11-06 22:28:31,502 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 186 [2023-11-06 22:28:31,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:28:31,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:28:31,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:28:31,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:28:31,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (1/1) ... [2023-11-06 22:28:31,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (1/1) ... [2023-11-06 22:28:31,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (1/1) ... [2023-11-06 22:28:31,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (1/1) ... [2023-11-06 22:28:31,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (1/1) ... [2023-11-06 22:28:31,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (1/1) ... [2023-11-06 22:28:31,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (1/1) ... [2023-11-06 22:28:31,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (1/1) ... [2023-11-06 22:28:31,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:28:31,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:28:31,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:28:31,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:28:31,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (1/1) ... [2023-11-06 22:28:31,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:28:31,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:28:31,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:28:31,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:28:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:28:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:28:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:28:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:28:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:28:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:28:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:28:31,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:28:31,701 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:28:31,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:28:31,701 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:28:31,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:28:31,703 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:28:31,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:28:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:28:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:28:31,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:28:31,706 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:28:31,964 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:28:31,969 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:28:32,622 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:28:32,875 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:28:32,876 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:28:32,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:32 BoogieIcfgContainer [2023-11-06 22:28:32,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:28:32,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:28:32,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:28:32,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:28:32,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:28:30" (1/3) ... [2023-11-06 22:28:32,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2549e2e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:32, skipping insertion in model container [2023-11-06 22:28:32,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:31" (2/3) ... [2023-11-06 22:28:32,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2549e2e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:32, skipping insertion in model container [2023-11-06 22:28:32,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:32" (3/3) ... [2023-11-06 22:28:32,897 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_tso.i [2023-11-06 22:28:32,920 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:28:32,920 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:28:32,920 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:28:33,054 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:28:33,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 148 transitions, 312 flow [2023-11-06 22:28:33,205 INFO L124 PetriNetUnfolderBase]: 3/144 cut-off events. [2023-11-06 22:28:33,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:28:33,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 3/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:28:33,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 148 transitions, 312 flow [2023-11-06 22:28:33,223 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 144 transitions, 300 flow [2023-11-06 22:28:33,229 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:28:33,248 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 144 transitions, 300 flow [2023-11-06 22:28:33,256 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 144 transitions, 300 flow [2023-11-06 22:28:33,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 144 transitions, 300 flow [2023-11-06 22:28:33,327 INFO L124 PetriNetUnfolderBase]: 3/144 cut-off events. [2023-11-06 22:28:33,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:28:33,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 3/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:28:33,336 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-11-06 22:28:47,665 INFO L134 LiptonReduction]: Checked pairs total: 9869 [2023-11-06 22:28:47,666 INFO L136 LiptonReduction]: Total number of compositions: 154 [2023-11-06 22:28:47,684 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:28:47,693 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;@107b66b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:28:47,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:28:47,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:28:47,696 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:28:47,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:28:47,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:47,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:28:47,698 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:47,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 673, now seen corresponding path program 1 times [2023-11-06 22:28:47,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:47,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695204479] [2023-11-06 22:28:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:47,722 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-06 22:28:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:47,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:47,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:47,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:28:47,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:47,833 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-06 22:28:47,833 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:47,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:47,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695204479] [2023-11-06 22:28:47,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695204479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:47,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:47,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:28:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533383744] [2023-11-06 22:28:47,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:47,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:28:47,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:47,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:28:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:28:47,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 302 [2023-11-06 22:28:47,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:47,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:47,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 302 [2023-11-06 22:28:47,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:49,430 INFO L124 PetriNetUnfolderBase]: 3743/5212 cut-off events. [2023-11-06 22:28:49,431 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-06 22:28:49,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10452 conditions, 5212 events. 3743/5212 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 26400 event pairs, 3743 based on Foata normal form. 0/4506 useless extension candidates. Maximal degree in co-relation 10440. Up to 5137 conditions per place. [2023-11-06 22:28:49,492 INFO L140 encePairwiseOnDemand]: 294/302 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-11-06 22:28:49,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-11-06 22:28:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:28:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:28:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2023-11-06 22:28:49,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49503311258278143 [2023-11-06 22:28:49,514 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2023-11-06 22:28:49,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2023-11-06 22:28:49,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:49,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2023-11-06 22:28:49,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:49,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:49,532 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:49,535 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 86 flow. Second operand 2 states and 299 transitions. [2023-11-06 22:28:49,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-11-06 22:28:49,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:28:49,543 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-11-06 22:28:49,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-06 22:28:49,551 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-11-06 22:28:49,551 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-11-06 22:28:49,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:49,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:49,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:49,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-06 22:28:49,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:49,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:49,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash -448346485, now seen corresponding path program 1 times [2023-11-06 22:28:49,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:49,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494609405] [2023-11-06 22:28:49,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:49,795 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-06 22:28:49,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:49,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:49,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:49,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:28:49,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:49,982 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-06 22:28:49,982 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:49,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:49,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494609405] [2023-11-06 22:28:49,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494609405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:49,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:49,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:28:49,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309004676] [2023-11-06 22:28:49,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:49,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:28:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:49,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:28:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:28:49,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 302 [2023-11-06 22:28:49,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:49,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:49,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 302 [2023-11-06 22:28:49,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:51,072 INFO L124 PetriNetUnfolderBase]: 3113/4528 cut-off events. [2023-11-06 22:28:51,073 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:28:51,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8919 conditions, 4528 events. 3113/4528 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 24758 event pairs, 593 based on Foata normal form. 0/4155 useless extension candidates. Maximal degree in co-relation 8916. Up to 3385 conditions per place. [2023-11-06 22:28:51,117 INFO L140 encePairwiseOnDemand]: 299/302 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-11-06 22:28:51,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 160 flow [2023-11-06 22:28:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:28:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:28:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-06 22:28:51,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47792494481236203 [2023-11-06 22:28:51,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-06 22:28:51,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-06 22:28:51,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:51,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-06 22:28:51,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:51,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:51,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:51,135 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 433 transitions. [2023-11-06 22:28:51,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 160 flow [2023-11-06 22:28:51,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:28:51,139 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-11-06 22:28:51,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-06 22:28:51,140 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-11-06 22:28:51,141 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-11-06 22:28:51,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:51,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:51,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:51,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:51,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:51,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:51,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1364171625, now seen corresponding path program 1 times [2023-11-06 22:28:51,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:51,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244375341] [2023-11-06 22:28:51,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:51,358 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-06 22:28:51,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:51,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:51,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:51,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:28:51,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:51,616 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-06 22:28:51,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:51,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:51,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244375341] [2023-11-06 22:28:51,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244375341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:51,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:51,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50925493] [2023-11-06 22:28:51,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:51,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:51,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:51,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:51,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 302 [2023-11-06 22:28:51,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:51,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:51,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 302 [2023-11-06 22:28:51,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:52,552 INFO L124 PetriNetUnfolderBase]: 2213/3221 cut-off events. [2023-11-06 22:28:52,553 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-11-06 22:28:52,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6690 conditions, 3221 events. 2213/3221 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 16303 event pairs, 423 based on Foata normal form. 180/3262 useless extension candidates. Maximal degree in co-relation 6686. Up to 2428 conditions per place. [2023-11-06 22:28:52,584 INFO L140 encePairwiseOnDemand]: 295/302 looper letters, 35 selfloop transitions, 5 changer transitions 23/67 dead transitions. [2023-11-06 22:28:52,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 284 flow [2023-11-06 22:28:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:28:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 680 transitions. [2023-11-06 22:28:52,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4503311258278146 [2023-11-06 22:28:52,589 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 680 transitions. [2023-11-06 22:28:52,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 680 transitions. [2023-11-06 22:28:52,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:52,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 680 transitions. [2023-11-06 22:28:52,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:52,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:52,600 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:52,600 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 680 transitions. [2023-11-06 22:28:52,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 284 flow [2023-11-06 22:28:52,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:28:52,604 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 107 flow [2023-11-06 22:28:52,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-06 22:28:52,606 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-11-06 22:28:52,606 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 107 flow [2023-11-06 22:28:52,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:52,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:52,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:52,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:52,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:52,823 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:52,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:52,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1848235644, now seen corresponding path program 1 times [2023-11-06 22:28:52,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:52,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160981365] [2023-11-06 22:28:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:52,824 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-06 22:28:52,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:52,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:52,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:52,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:28:52,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:53,039 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-06 22:28:53,040 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:53,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:53,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160981365] [2023-11-06 22:28:53,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160981365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:53,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:53,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905122201] [2023-11-06 22:28:53,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:53,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:53,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:53,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:53,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:53,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 302 [2023-11-06 22:28:53,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:53,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:53,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 302 [2023-11-06 22:28:53,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:53,731 INFO L124 PetriNetUnfolderBase]: 1185/1841 cut-off events. [2023-11-06 22:28:53,731 INFO L125 PetriNetUnfolderBase]: For 764/764 co-relation queries the response was YES. [2023-11-06 22:28:53,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5117 conditions, 1841 events. 1185/1841 cut-off events. For 764/764 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8924 event pairs, 173 based on Foata normal form. 132/1910 useless extension candidates. Maximal degree in co-relation 5110. Up to 872 conditions per place. [2023-11-06 22:28:53,753 INFO L140 encePairwiseOnDemand]: 295/302 looper letters, 46 selfloop transitions, 9 changer transitions 23/82 dead transitions. [2023-11-06 22:28:53,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 425 flow [2023-11-06 22:28:53,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:28:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:28:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2023-11-06 22:28:53,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45143487858719644 [2023-11-06 22:28:53,759 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 818 transitions. [2023-11-06 22:28:53,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 818 transitions. [2023-11-06 22:28:53,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:53,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 818 transitions. [2023-11-06 22:28:53,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.33333333333334) internal successors, (818), 6 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:53,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:53,772 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:53,772 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 107 flow. Second operand 6 states and 818 transitions. [2023-11-06 22:28:53,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 425 flow [2023-11-06 22:28:53,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 418 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:28:53,786 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 172 flow [2023-11-06 22:28:53,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-11-06 22:28:53,787 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-11-06 22:28:53,788 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 172 flow [2023-11-06 22:28:53,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:53,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:53,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:53,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:54,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:54,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:54,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1698595488, now seen corresponding path program 1 times [2023-11-06 22:28:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:54,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13217051] [2023-11-06 22:28:54,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:54,005 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-06 22:28:54,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:54,006 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:54,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:54,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:28:54,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:54,229 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-06 22:28:54,229 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:54,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:54,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13217051] [2023-11-06 22:28:54,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13217051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:54,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:54,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:54,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190541371] [2023-11-06 22:28:54,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:54,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:54,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:54,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:54,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:54,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 302 [2023-11-06 22:28:54,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:54,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:54,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 302 [2023-11-06 22:28:54,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:54,865 INFO L124 PetriNetUnfolderBase]: 649/1053 cut-off events. [2023-11-06 22:28:54,865 INFO L125 PetriNetUnfolderBase]: For 1188/1188 co-relation queries the response was YES. [2023-11-06 22:28:54,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1053 events. 649/1053 cut-off events. For 1188/1188 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4599 event pairs, 123 based on Foata normal form. 56/1090 useless extension candidates. Maximal degree in co-relation 3431. Up to 391 conditions per place. [2023-11-06 22:28:54,875 INFO L140 encePairwiseOnDemand]: 295/302 looper letters, 55 selfloop transitions, 13 changer transitions 23/95 dead transitions. [2023-11-06 22:28:54,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 586 flow [2023-11-06 22:28:54,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:28:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:28:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 954 transitions. [2023-11-06 22:28:54,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512771996215705 [2023-11-06 22:28:54,881 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 954 transitions. [2023-11-06 22:28:54,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 954 transitions. [2023-11-06 22:28:54,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:54,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 954 transitions. [2023-11-06 22:28:54,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.28571428571428) internal successors, (954), 7 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:54,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:54,892 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:54,893 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 172 flow. Second operand 7 states and 954 transitions. [2023-11-06 22:28:54,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 586 flow [2023-11-06 22:28:54,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 524 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-06 22:28:54,904 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 222 flow [2023-11-06 22:28:54,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-11-06 22:28:54,905 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-11-06 22:28:54,906 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 222 flow [2023-11-06 22:28:54,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:54,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:54,907 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-06 22:28:54,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:55,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:55,119 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:55,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash 375565887, now seen corresponding path program 1 times [2023-11-06 22:28:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:55,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892575980] [2023-11-06 22:28:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:55,120 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-06 22:28:55,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:55,126 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:55,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:55,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:28:55,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:55,354 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-06 22:28:55,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:55,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:55,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892575980] [2023-11-06 22:28:55,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892575980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:55,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:55,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:55,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885899159] [2023-11-06 22:28:55,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:55,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:28:55,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:55,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:28:55,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:55,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 302 [2023-11-06 22:28:55,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:55,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:55,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 302 [2023-11-06 22:28:55,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:56,042 INFO L124 PetriNetUnfolderBase]: 528/844 cut-off events. [2023-11-06 22:28:56,042 INFO L125 PetriNetUnfolderBase]: For 938/938 co-relation queries the response was YES. [2023-11-06 22:28:56,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2643 conditions, 844 events. 528/844 cut-off events. For 938/938 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3546 event pairs, 119 based on Foata normal form. 12/848 useless extension candidates. Maximal degree in co-relation 2633. Up to 340 conditions per place. [2023-11-06 22:28:56,053 INFO L140 encePairwiseOnDemand]: 295/302 looper letters, 51 selfloop transitions, 17 changer transitions 12/84 dead transitions. [2023-11-06 22:28:56,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 530 flow [2023-11-06 22:28:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:28:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1066 transitions. [2023-11-06 22:28:56,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4412251655629139 [2023-11-06 22:28:56,059 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1066 transitions. [2023-11-06 22:28:56,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1066 transitions. [2023-11-06 22:28:56,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:56,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1066 transitions. [2023-11-06 22:28:56,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.25) internal successors, (1066), 8 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:56,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:56,071 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:56,072 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 222 flow. Second operand 8 states and 1066 transitions. [2023-11-06 22:28:56,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 530 flow [2023-11-06 22:28:56,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 468 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-06 22:28:56,083 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 216 flow [2023-11-06 22:28:56,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-11-06 22:28:56,084 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-11-06 22:28:56,084 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 216 flow [2023-11-06 22:28:56,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:56,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:56,085 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-06 22:28:56,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:56,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:56,298 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:56,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:56,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1220776096, now seen corresponding path program 1 times [2023-11-06 22:28:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224614017] [2023-11-06 22:28:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:56,301 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-06 22:28:56,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:56,302 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:56,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:56,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:28:56,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:57,372 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-06 22:28:57,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:57,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:57,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224614017] [2023-11-06 22:28:57,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224614017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:57,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:57,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663746874] [2023-11-06 22:28:57,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:57,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:57,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:57,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:57,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:57,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 302 [2023-11-06 22:28:57,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:57,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:57,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 302 [2023-11-06 22:28:57,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:58,423 INFO L124 PetriNetUnfolderBase]: 518/846 cut-off events. [2023-11-06 22:28:58,423 INFO L125 PetriNetUnfolderBase]: For 1364/1364 co-relation queries the response was YES. [2023-11-06 22:28:58,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2578 conditions, 846 events. 518/846 cut-off events. For 1364/1364 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3936 event pairs, 9 based on Foata normal form. 0/846 useless extension candidates. Maximal degree in co-relation 2567. Up to 669 conditions per place. [2023-11-06 22:28:58,434 INFO L140 encePairwiseOnDemand]: 297/302 looper letters, 51 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2023-11-06 22:28:58,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 447 flow [2023-11-06 22:28:58,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:28:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:28:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2023-11-06 22:28:58,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39072847682119205 [2023-11-06 22:28:58,444 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 708 transitions. [2023-11-06 22:28:58,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 708 transitions. [2023-11-06 22:28:58,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:58,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 708 transitions. [2023-11-06 22:28:58,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:58,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:58,455 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:58,455 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 216 flow. Second operand 6 states and 708 transitions. [2023-11-06 22:28:58,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 447 flow [2023-11-06 22:28:58,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 358 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-11-06 22:28:58,462 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 158 flow [2023-11-06 22:28:58,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-11-06 22:28:58,464 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-11-06 22:28:58,464 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 158 flow [2023-11-06 22:28:58,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:58,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:58,465 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-06 22:28:58,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:58,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:58,679 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:58,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash -355089812, now seen corresponding path program 1 times [2023-11-06 22:28:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:58,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460244817] [2023-11-06 22:28:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:58,681 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-06 22:28:58,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:58,683 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:58,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:58,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:28:58,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:58,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:58,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:58,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460244817] [2023-11-06 22:28:58,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460244817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:58,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:58,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:28:58,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562183178] [2023-11-06 22:28:58,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:58,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:28:58,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:58,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:28:58,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:28:58,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 302 [2023-11-06 22:28:58,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 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-06 22:28:58,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:58,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 302 [2023-11-06 22:28:58,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:59,296 INFO L124 PetriNetUnfolderBase]: 932/1480 cut-off events. [2023-11-06 22:28:59,296 INFO L125 PetriNetUnfolderBase]: For 1022/1022 co-relation queries the response was YES. [2023-11-06 22:28:59,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4183 conditions, 1480 events. 932/1480 cut-off events. For 1022/1022 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7452 event pairs, 443 based on Foata normal form. 1/1462 useless extension candidates. Maximal degree in co-relation 4175. Up to 889 conditions per place. [2023-11-06 22:28:59,307 INFO L140 encePairwiseOnDemand]: 299/302 looper letters, 50 selfloop transitions, 2 changer transitions 11/66 dead transitions. [2023-11-06 22:28:59,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 412 flow [2023-11-06 22:28:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:28:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:28:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-11-06 22:28:59,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746136865342163 [2023-11-06 22:28:59,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-11-06 22:28:59,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-11-06 22:28:59,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:59,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-11-06 22:28:59,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:59,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:59,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:59,317 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 158 flow. Second operand 3 states and 430 transitions. [2023-11-06 22:28:59,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 412 flow [2023-11-06 22:28:59,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 402 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:28:59,329 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 159 flow [2023-11-06 22:28:59,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-11-06 22:28:59,330 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-11-06 22:28:59,331 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 159 flow [2023-11-06 22:28:59,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 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-06 22:28:59,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:59,332 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-06 22:28:59,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:59,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:59,544 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:28:59,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:59,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2042420124, now seen corresponding path program 2 times [2023-11-06 22:28:59,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:59,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417787831] [2023-11-06 22:28:59,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:28:59,546 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-06 22:28:59,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:59,552 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:59,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:28:59,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:28:59,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:28:59,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:28:59,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:59,787 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-06 22:28:59,787 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:59,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:59,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417787831] [2023-11-06 22:28:59,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417787831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:59,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:59,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715202365] [2023-11-06 22:28:59,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:59,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:59,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:59,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:59,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:59,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 302 [2023-11-06 22:28:59,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:59,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:59,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 302 [2023-11-06 22:28:59,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:29:00,129 INFO L124 PetriNetUnfolderBase]: 485/820 cut-off events. [2023-11-06 22:29:00,130 INFO L125 PetriNetUnfolderBase]: For 723/723 co-relation queries the response was YES. [2023-11-06 22:29:00,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 820 events. 485/820 cut-off events. For 723/723 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3777 event pairs, 95 based on Foata normal form. 1/818 useless extension candidates. Maximal degree in co-relation 2511. Up to 471 conditions per place. [2023-11-06 22:29:00,139 INFO L140 encePairwiseOnDemand]: 299/302 looper letters, 47 selfloop transitions, 1 changer transitions 31/82 dead transitions. [2023-11-06 22:29:00,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 518 flow [2023-11-06 22:29:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:29:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-11-06 22:29:00,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685430463576159 [2023-11-06 22:29:00,145 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-11-06 22:29:00,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-11-06 22:29:00,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:29:00,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-11-06 22:29:00,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:00,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 302.0) internal successors, (1510), 5 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:00,152 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 302.0) internal successors, (1510), 5 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:00,153 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 159 flow. Second operand 4 states and 566 transitions. [2023-11-06 22:29:00,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 518 flow [2023-11-06 22:29:00,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 508 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:29:00,162 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 160 flow [2023-11-06 22:29:00,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-11-06 22:29:00,163 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-11-06 22:29:00,163 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 160 flow [2023-11-06 22:29:00,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:00,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:29:00,166 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-06 22:29:00,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:29:00,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:29:00,379 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:29:00,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash 280761466, now seen corresponding path program 3 times [2023-11-06 22:29:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:29:00,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392981335] [2023-11-06 22:29:00,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:29:00,381 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-06 22:29:00,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:29:00,382 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:29:00,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:29:00,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:29:00,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:29:00,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:29:00,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:29:00,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-06 22:29:00,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:29:00,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:29:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392981335] [2023-11-06 22:29:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392981335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:29:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972948321] [2023-11-06 22:29:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:00,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:29:00,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:29:00,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:29:00,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:29:00,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 302 [2023-11-06 22:29:00,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 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-06 22:29:00,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:29:00,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 302 [2023-11-06 22:29:00,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:29:00,909 INFO L124 PetriNetUnfolderBase]: 735/1222 cut-off events. [2023-11-06 22:29:00,909 INFO L125 PetriNetUnfolderBase]: For 1280/1280 co-relation queries the response was YES. [2023-11-06 22:29:00,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3702 conditions, 1222 events. 735/1222 cut-off events. For 1280/1280 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6073 event pairs, 325 based on Foata normal form. 1/1208 useless extension candidates. Maximal degree in co-relation 3692. Up to 739 conditions per place. [2023-11-06 22:29:00,915 INFO L140 encePairwiseOnDemand]: 299/302 looper letters, 38 selfloop transitions, 2 changer transitions 25/68 dead transitions. [2023-11-06 22:29:00,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 422 flow [2023-11-06 22:29:00,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:29:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:29:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-11-06 22:29:00,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4768211920529801 [2023-11-06 22:29:00,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-11-06 22:29:00,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-11-06 22:29:00,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:29:00,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-11-06 22:29:00,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:00,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:00,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:00,924 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 160 flow. Second operand 3 states and 432 transitions. [2023-11-06 22:29:00,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 422 flow [2023-11-06 22:29:00,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 419 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:29:00,934 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 165 flow [2023-11-06 22:29:00,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-11-06 22:29:00,938 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-11-06 22:29:00,938 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 165 flow [2023-11-06 22:29:00,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 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-06 22:29:00,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:29:00,939 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-06 22:29:00,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:29:01,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:29:01,152 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:29:01,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:01,152 INFO L85 PathProgramCache]: Analyzing trace with hash 144963274, now seen corresponding path program 4 times [2023-11-06 22:29:01,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:29:01,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088786307] [2023-11-06 22:29:01,153 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:29:01,153 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-06 22:29:01,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:29:01,155 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:29:01,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:29:01,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:29:01,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:29:01,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:29:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:29:01,576 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:29:01,577 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:29:01,578 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:29:01,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:29:01,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:29:01,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:29:01,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:29:01,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:29:01,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:29:01,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:29:01,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:29:01,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:29:01,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:29:01,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:29:01,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:29:01,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:29:01,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:29:01,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:29:01,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:29:01,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:29:01,797 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:01,803 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:29:01,803 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:29:01,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:29:01 BasicIcfg [2023-11-06 22:29:01,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:29:01,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:29:01,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:29:01,897 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:29:01,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:32" (3/4) ... [2023-11-06 22:29:01,900 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:29:01,901 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:29:01,902 INFO L158 Benchmark]: Toolchain (without parser) took 31493.99ms. Allocated memory was 102.8MB in the beginning and 643.8MB in the end (delta: 541.1MB). Free memory was 77.2MB in the beginning and 474.5MB in the end (delta: -397.3MB). Peak memory consumption was 145.3MB. Max. memory is 16.1GB. [2023-11-06 22:29:01,902 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 67.1MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 56.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:29:01,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 964.60ms. Allocated memory is still 102.8MB. Free memory was 77.0MB in the beginning and 75.4MB in the end (delta: 1.6MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2023-11-06 22:29:01,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.47ms. Allocated memory is still 102.8MB. Free memory was 75.4MB in the beginning and 72.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:29:01,903 INFO L158 Benchmark]: Boogie Preprocessor took 87.90ms. Allocated memory is still 102.8MB. Free memory was 72.4MB in the beginning and 69.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:29:01,904 INFO L158 Benchmark]: RCFGBuilder took 1286.10ms. Allocated memory is still 102.8MB. Free memory was 69.9MB in the beginning and 51.9MB in the end (delta: 18.0MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2023-11-06 22:29:01,904 INFO L158 Benchmark]: TraceAbstraction took 29011.89ms. Allocated memory was 102.8MB in the beginning and 643.8MB in the end (delta: 541.1MB). Free memory was 51.4MB in the beginning and 474.5MB in the end (delta: -423.1MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. [2023-11-06 22:29:01,905 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 643.8MB. Free memory is still 474.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:29:01,907 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.38ms. Allocated memory is still 67.1MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 56.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 964.60ms. Allocated memory is still 102.8MB. Free memory was 77.0MB in the beginning and 75.4MB in the end (delta: 1.6MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.47ms. Allocated memory is still 102.8MB. Free memory was 75.4MB in the beginning and 72.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.90ms. Allocated memory is still 102.8MB. Free memory was 72.4MB in the beginning and 69.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1286.10ms. Allocated memory is still 102.8MB. Free memory was 69.9MB in the beginning and 51.9MB in the end (delta: 18.0MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29011.89ms. Allocated memory was 102.8MB in the beginning and 643.8MB in the end (delta: 541.1MB). Free memory was 51.4MB in the beginning and 474.5MB in the end (delta: -423.1MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 643.8MB. Free memory is still 474.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.4s, 154 PlacesBefore, 50 PlacesAfterwards, 144 TransitionsBefore, 37 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 87 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 154 TotalNumberOfCompositions, 9869 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3989, independent: 3759, independent conditional: 0, independent unconditional: 3759, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2012, independent: 1950, independent conditional: 0, independent unconditional: 1950, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3989, independent: 1809, independent conditional: 0, independent unconditional: 1809, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 2012, unknown conditional: 0, unknown unconditional: 2012] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L852] 0 pthread_t t825; [L853] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t825, ((void *)0), P0, ((void *)0))=0, t825={-16:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 pthread_t t826; [L855] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t826, ((void *)0), P1, ((void *)0))=1, t825={-16:0}, t826={-12:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 pthread_t t827; [L857] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t827, ((void *)0), P2, ((void *)0))=2, t825={-16:0}, t826={-12:0}, t827={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t828; [L859] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t828, ((void *)0), P3, ((void *)0))=3, t825={-16:0}, t826={-12:0}, t827={-2:0}, t828={-4:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 4 z$flush_delayed = weak$$choice2 [L814] 4 z$mem_tmp = z [L815] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L816] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L819] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L821] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 __unbuffered_p3_EAX = z [L823] 4 z = z$flush_delayed ? z$mem_tmp : z [L824] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L830] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L831] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L832] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L834] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L866] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L867] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L868] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L869] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t825={-16:0}, t826={-12:0}, t827={-2:0}, t828={-4:0}, weak$$choice2=2, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 z$flush_delayed = weak$$choice2 [L875] 0 z$mem_tmp = z [L876] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L877] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L878] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L879] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L880] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L882] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 0 z = z$flush_delayed ? z$mem_tmp : z [L885] 0 z$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix030_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={6:5}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 857]: 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: 855]: 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: 859]: 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, 182 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 397 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 324 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1622 IncrementalHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 31 mSDtfsCounter, 1622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=5, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 1487 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1518 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-06 22:29:01,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5d2325-0753-41a0-a432-162c362879de/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample