./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:54:11,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:54:11,977 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 21:54:11,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:54:11,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:54:12,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:54:12,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:54:12,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:54:12,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:54:12,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:54:12,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:54:12,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:54:12,046 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:54:12,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:54:12,048 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:54:12,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:54:12,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:54:12,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:54:12,050 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:54:12,050 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:54:12,051 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:54:12,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:54:12,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:54:12,052 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:54:12,053 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:54:12,053 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:54:12,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:54:12,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:54:12,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:54:12,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:12,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:54:12,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:54:12,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:54:12,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:54:12,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:54:12,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:54:12,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:54:12,059 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:54:12,059 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_61a4db75-f002-4167-8a86-ab6fe40bdc12/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_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 -> 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 [2023-11-06 21:54:12,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:54:12,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:54:12,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:54:12,430 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:54:12,431 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:54:12,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix006.opt.i [2023-11-06 21:54:15,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:54:15,902 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:54:15,903 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/sv-benchmarks/c/pthread-wmm/mix006.opt.i [2023-11-06 21:54:15,927 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/data/87d71e866/d8c259b2b02f48fbbced28a8cdeb9fa5/FLAGc79b5c6ec [2023-11-06 21:54:15,952 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/data/87d71e866/d8c259b2b02f48fbbced28a8cdeb9fa5 [2023-11-06 21:54:15,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:54:15,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:54:15,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:15,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:54:15,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:54:15,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:15" (1/1) ... [2023-11-06 21:54:15,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a06c567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:15, skipping insertion in model container [2023-11-06 21:54:15,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:15" (1/1) ... [2023-11-06 21:54:16,050 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:54:16,506 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:16,526 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:54:16,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:16,694 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:54:16,694 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:54:16,702 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:54:16,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16 WrapperNode [2023-11-06 21:54:16,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:16,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:16,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:54:16,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:54:16,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (1/1) ... [2023-11-06 21:54:16,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (1/1) ... [2023-11-06 21:54:16,797 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 155 [2023-11-06 21:54:16,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:16,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:54:16,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:54:16,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:54:16,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (1/1) ... [2023-11-06 21:54:16,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (1/1) ... [2023-11-06 21:54:16,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (1/1) ... [2023-11-06 21:54:16,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (1/1) ... [2023-11-06 21:54:16,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (1/1) ... [2023-11-06 21:54:16,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (1/1) ... [2023-11-06 21:54:16,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (1/1) ... [2023-11-06 21:54:16,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (1/1) ... [2023-11-06 21:54:16,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:54:16,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:54:16,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:54:16,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:54:16,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (1/1) ... [2023-11-06 21:54:16,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:16,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:16,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:54:16,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:54:16,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:54:16,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:54:16,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:54:16,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:54:16,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:54:16,959 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 21:54:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 21:54:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 21:54:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 21:54:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 21:54:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 21:54:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:54:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:54:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:54:16,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:54:16,964 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 21:54:17,148 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:54:17,150 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:54:17,561 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:54:17,786 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:54:17,786 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:54:17,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:17 BoogieIcfgContainer [2023-11-06 21:54:17,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:54:17,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:54:17,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:54:17,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:54:17,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:54:15" (1/3) ... [2023-11-06 21:54:17,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdb7f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:17, skipping insertion in model container [2023-11-06 21:54:17,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:16" (2/3) ... [2023-11-06 21:54:17,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdb7f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:17, skipping insertion in model container [2023-11-06 21:54:17,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:17" (3/3) ... [2023-11-06 21:54:17,803 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2023-11-06 21:54:17,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:54:17,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 21:54:17,825 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:54:17,910 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:54:17,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 128 transitions, 268 flow [2023-11-06 21:54:18,063 INFO L124 PetriNetUnfolderBase]: 3/125 cut-off events. [2023-11-06 21:54:18,064 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:54:18,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 125 events. 3/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 21:54:18,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 128 transitions, 268 flow [2023-11-06 21:54:18,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 125 transitions, 259 flow [2023-11-06 21:54:18,087 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:54:18,097 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 125 transitions, 259 flow [2023-11-06 21:54:18,100 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 125 transitions, 259 flow [2023-11-06 21:54:18,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 125 transitions, 259 flow [2023-11-06 21:54:18,137 INFO L124 PetriNetUnfolderBase]: 3/125 cut-off events. [2023-11-06 21:54:18,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:54:18,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 125 events. 3/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 21:54:18,141 INFO L119 LiptonReduction]: Number of co-enabled transitions 2464 [2023-11-06 21:54:23,341 INFO L134 LiptonReduction]: Checked pairs total: 6236 [2023-11-06 21:54:23,342 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-11-06 21:54:23,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:54:23,366 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;@2847d80a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:54:23,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 21:54:23,368 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:54:23,369 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 21:54:23,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:54:23,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:23,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 21:54:23,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:23,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash 591, now seen corresponding path program 1 times [2023-11-06 21:54:23,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:23,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686066218] [2023-11-06 21:54:23,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:23,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,511 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 21:54:23,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:23,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686066218] [2023-11-06 21:54:23,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686066218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:23,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:23,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 21:54:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017630838] [2023-11-06 21:54:23,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:23,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:54:23,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:23,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:54:23,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:54:23,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 255 [2023-11-06 21:54:23,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 115.5) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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 21:54:23,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:23,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 255 [2023-11-06 21:54:23,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:24,003 INFO L124 PetriNetUnfolderBase]: 939/1436 cut-off events. [2023-11-06 21:54:24,003 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-06 21:54:24,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 1436 events. 939/1436 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6813 event pairs, 939 based on Foata normal form. 0/1180 useless extension candidates. Maximal degree in co-relation 2864. Up to 1403 conditions per place. [2023-11-06 21:54:24,019 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-11-06 21:54:24,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2023-11-06 21:54:24,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:54:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 21:54:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions. [2023-11-06 21:54:24,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2023-11-06 21:54:24,035 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions. [2023-11-06 21:54:24,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions. [2023-11-06 21:54:24,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:24,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions. [2023-11-06 21:54:24,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 21:54:24,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states 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 21:54:24,049 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states 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 21:54:24,051 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 258 transitions. [2023-11-06 21:54:24,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2023-11-06 21:54:24,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:54:24,056 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-11-06 21:54:24,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-11-06 21:54:24,062 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-11-06 21:54:24,063 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-11-06 21:54:24,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.5) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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 21:54:24,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:24,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:24,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:54:24,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:24,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:24,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1433298093, now seen corresponding path program 1 times [2023-11-06 21:54:24,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:24,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262170968] [2023-11-06 21:54:24,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:24,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,510 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 21:54:24,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:24,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262170968] [2023-11-06 21:54:24,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262170968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:24,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:24,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:54:24,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067302021] [2023-11-06 21:54:24,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:24,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:24,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:24,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:24,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:24,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 255 [2023-11-06 21:54:24,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states 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 21:54:24,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:24,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 255 [2023-11-06 21:54:24,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:24,818 INFO L124 PetriNetUnfolderBase]: 777/1247 cut-off events. [2023-11-06 21:54:24,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:54:24,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2450 conditions, 1247 events. 777/1247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6193 event pairs, 129 based on Foata normal form. 0/1123 useless extension candidates. Maximal degree in co-relation 2447. Up to 937 conditions per place. [2023-11-06 21:54:24,829 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 26 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-11-06 21:54:24,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 132 flow [2023-11-06 21:54:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:54:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-11-06 21:54:24,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875816993464052 [2023-11-06 21:54:24,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-11-06 21:54:24,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-11-06 21:54:24,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:24,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-11-06 21:54:24,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states 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 21:54:24,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 21:54:24,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 21:54:24,848 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 373 transitions. [2023-11-06 21:54:24,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 132 flow [2023-11-06 21:54:24,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:54:24,853 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-11-06 21:54:24,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-06 21:54:24,855 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-11-06 21:54:24,855 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-11-06 21:54:24,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states 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 21:54:24,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:24,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:24,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:54:24,864 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:24,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1284988121, now seen corresponding path program 1 times [2023-11-06 21:54:24,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:24,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557166437] [2023-11-06 21:54:24,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:24,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:25,222 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 21:54:25,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:25,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557166437] [2023-11-06 21:54:25,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557166437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:25,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:25,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:54:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125096636] [2023-11-06 21:54:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:25,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:25,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:25,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 255 [2023-11-06 21:54:25,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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 21:54:25,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:25,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 255 [2023-11-06 21:54:25,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:25,545 INFO L124 PetriNetUnfolderBase]: 867/1392 cut-off events. [2023-11-06 21:54:25,545 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-11-06 21:54:25,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2815 conditions, 1392 events. 867/1392 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6811 event pairs, 183 based on Foata normal form. 0/1317 useless extension candidates. Maximal degree in co-relation 2811. Up to 1203 conditions per place. [2023-11-06 21:54:25,557 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 31 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-11-06 21:54:25,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 156 flow [2023-11-06 21:54:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:54:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-11-06 21:54:25,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849673202614379 [2023-11-06 21:54:25,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-11-06 21:54:25,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-11-06 21:54:25,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:25,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-11-06 21:54:25,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states 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 21:54:25,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 21:54:25,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 21:54:25,565 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 3 states and 371 transitions. [2023-11-06 21:54:25,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 156 flow [2023-11-06 21:54:25,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:54:25,567 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 69 flow [2023-11-06 21:54:25,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-11-06 21:54:25,568 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-11-06 21:54:25,568 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 69 flow [2023-11-06 21:54:25,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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 21:54:25,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:25,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:25,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:54:25,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:25,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:25,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1284988112, now seen corresponding path program 1 times [2023-11-06 21:54:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:25,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237216292] [2023-11-06 21:54:25,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237216292] [2023-11-06 21:54:25,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237216292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:25,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:25,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:25,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443130426] [2023-11-06 21:54:25,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:25,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:54:25,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:25,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:54:25,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:54:26,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 255 [2023-11-06 21:54:26,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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 21:54:26,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:26,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 255 [2023-11-06 21:54:26,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:26,418 INFO L124 PetriNetUnfolderBase]: 604/974 cut-off events. [2023-11-06 21:54:26,419 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-11-06 21:54:26,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 974 events. 604/974 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4382 event pairs, 340 based on Foata normal form. 75/1037 useless extension candidates. Maximal degree in co-relation 2133. Up to 891 conditions per place. [2023-11-06 21:54:26,428 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 24 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-11-06 21:54:26,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 142 flow [2023-11-06 21:54:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:54:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:54:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2023-11-06 21:54:26,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4164705882352941 [2023-11-06 21:54:26,431 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 531 transitions. [2023-11-06 21:54:26,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 531 transitions. [2023-11-06 21:54:26,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:26,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 531 transitions. [2023-11-06 21:54:26,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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 21:54:26,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 21:54:26,438 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 21:54:26,438 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 69 flow. Second operand 5 states and 531 transitions. [2023-11-06 21:54:26,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 142 flow [2023-11-06 21:54:26,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:54:26,440 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 70 flow [2023-11-06 21:54:26,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-11-06 21:54:26,441 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2023-11-06 21:54:26,441 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 70 flow [2023-11-06 21:54:26,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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 21:54:26,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:26,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:26,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:54:26,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:26,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1376546754, now seen corresponding path program 1 times [2023-11-06 21:54:26,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:26,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170941470] [2023-11-06 21:54:26,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:26,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:26,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:26,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170941470] [2023-11-06 21:54:26,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170941470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:26,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:26,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869889781] [2023-11-06 21:54:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:26,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:54:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:26,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:54:26,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:26,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 255 [2023-11-06 21:54:26,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states 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 21:54:26,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:26,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 255 [2023-11-06 21:54:26,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:27,063 INFO L124 PetriNetUnfolderBase]: 1199/1836 cut-off events. [2023-11-06 21:54:27,063 INFO L125 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2023-11-06 21:54:27,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 1836 events. 1199/1836 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8275 event pairs, 307 based on Foata normal form. 72/1908 useless extension candidates. Maximal degree in co-relation 4038. Up to 1025 conditions per place. [2023-11-06 21:54:27,080 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 41 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2023-11-06 21:54:27,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 222 flow [2023-11-06 21:54:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:54:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:54:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-11-06 21:54:27,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46176470588235297 [2023-11-06 21:54:27,083 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-11-06 21:54:27,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-11-06 21:54:27,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:27,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-11-06 21:54:27,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 21:54:27,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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 21:54:27,090 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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 21:54:27,090 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 70 flow. Second operand 4 states and 471 transitions. [2023-11-06 21:54:27,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 222 flow [2023-11-06 21:54:27,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 215 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:54:27,093 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 111 flow [2023-11-06 21:54:27,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-11-06 21:54:27,094 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-06 21:54:27,094 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 111 flow [2023-11-06 21:54:27,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states 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 21:54:27,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:27,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:27,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:54:27,096 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:27,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1143332088, now seen corresponding path program 1 times [2023-11-06 21:54:27,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:27,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595268031] [2023-11-06 21:54:27,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:27,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:27,232 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 21:54:27,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:27,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595268031] [2023-11-06 21:54:27,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595268031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:27,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:27,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:54:27,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234014085] [2023-11-06 21:54:27,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:27,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:27,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:27,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:27,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:27,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 255 [2023-11-06 21:54:27,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:27,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:27,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 255 [2023-11-06 21:54:27,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:27,507 INFO L124 PetriNetUnfolderBase]: 787/1281 cut-off events. [2023-11-06 21:54:27,507 INFO L125 PetriNetUnfolderBase]: For 839/861 co-relation queries the response was YES. [2023-11-06 21:54:27,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 1281 events. 787/1281 cut-off events. For 839/861 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6257 event pairs, 275 based on Foata normal form. 24/1280 useless extension candidates. Maximal degree in co-relation 3256. Up to 780 conditions per place. [2023-11-06 21:54:27,540 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 27 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-11-06 21:54:27,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 199 flow [2023-11-06 21:54:27,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:54:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-11-06 21:54:27,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48104575163398694 [2023-11-06 21:54:27,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-11-06 21:54:27,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-11-06 21:54:27,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:27,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-11-06 21:54:27,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states 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 21:54:27,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 21:54:27,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 21:54:27,550 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 111 flow. Second operand 3 states and 368 transitions. [2023-11-06 21:54:27,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 199 flow [2023-11-06 21:54:27,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:54:27,557 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 120 flow [2023-11-06 21:54:27,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-06 21:54:27,560 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-06 21:54:27,564 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 120 flow [2023-11-06 21:54:27,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:27,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:27,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:27,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:54:27,565 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:27,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:27,566 INFO L85 PathProgramCache]: Analyzing trace with hash 734678013, now seen corresponding path program 1 times [2023-11-06 21:54:27,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:27,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316145879] [2023-11-06 21:54:27,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:27,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:27,816 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 21:54:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:27,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316145879] [2023-11-06 21:54:27,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316145879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:27,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:27,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:27,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008982760] [2023-11-06 21:54:27,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:27,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:54:27,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:27,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:54:27,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:27,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 255 [2023-11-06 21:54:27,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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 21:54:27,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:27,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 255 [2023-11-06 21:54:27,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:28,134 INFO L124 PetriNetUnfolderBase]: 650/1102 cut-off events. [2023-11-06 21:54:28,134 INFO L125 PetriNetUnfolderBase]: For 810/828 co-relation queries the response was YES. [2023-11-06 21:54:28,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2938 conditions, 1102 events. 650/1102 cut-off events. For 810/828 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5684 event pairs, 120 based on Foata normal form. 108/1187 useless extension candidates. Maximal degree in co-relation 2929. Up to 661 conditions per place. [2023-11-06 21:54:28,143 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 47 selfloop transitions, 8 changer transitions 7/68 dead transitions. [2023-11-06 21:54:28,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 397 flow [2023-11-06 21:54:28,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:54:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:54:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2023-11-06 21:54:28,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4682352941176471 [2023-11-06 21:54:28,147 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 597 transitions. [2023-11-06 21:54:28,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 597 transitions. [2023-11-06 21:54:28,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:28,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 597 transitions. [2023-11-06 21:54:28,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states 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 21:54:28,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 21:54:28,153 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 21:54:28,153 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 120 flow. Second operand 5 states and 597 transitions. [2023-11-06 21:54:28,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 397 flow [2023-11-06 21:54:28,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:54:28,157 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 172 flow [2023-11-06 21:54:28,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-11-06 21:54:28,158 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-11-06 21:54:28,158 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 172 flow [2023-11-06 21:54:28,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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 21:54:28,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:28,159 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 21:54:28,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:54:28,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:28,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash -618363233, now seen corresponding path program 1 times [2023-11-06 21:54:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:28,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131326316] [2023-11-06 21:54:28,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:28,376 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 21:54:28,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:28,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131326316] [2023-11-06 21:54:28,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131326316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:28,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:28,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:28,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309353788] [2023-11-06 21:54:28,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:28,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:28,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:28,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:28,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:28,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 255 [2023-11-06 21:54:28,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 21:54:28,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:28,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 255 [2023-11-06 21:54:28,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:28,707 INFO L124 PetriNetUnfolderBase]: 880/1549 cut-off events. [2023-11-06 21:54:28,707 INFO L125 PetriNetUnfolderBase]: For 1980/1986 co-relation queries the response was YES. [2023-11-06 21:54:28,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5283 conditions, 1549 events. 880/1549 cut-off events. For 1980/1986 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8749 event pairs, 379 based on Foata normal form. 26/1540 useless extension candidates. Maximal degree in co-relation 5271. Up to 800 conditions per place. [2023-11-06 21:54:28,720 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 36 selfloop transitions, 3 changer transitions 12/54 dead transitions. [2023-11-06 21:54:28,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 365 flow [2023-11-06 21:54:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:54:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-06 21:54:28,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48366013071895425 [2023-11-06 21:54:28,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-06 21:54:28,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-06 21:54:28,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:28,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-06 21:54:28,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:28,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 21:54:28,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 21:54:28,728 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 172 flow. Second operand 3 states and 370 transitions. [2023-11-06 21:54:28,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 365 flow [2023-11-06 21:54:28,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 365 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:54:28,734 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 146 flow [2023-11-06 21:54:28,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-11-06 21:54:28,735 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-11-06 21:54:28,736 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 146 flow [2023-11-06 21:54:28,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 21:54:28,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:28,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:28,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:54:28,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:28,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:28,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1970905146, now seen corresponding path program 1 times [2023-11-06 21:54:28,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:28,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892677826] [2023-11-06 21:54:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:28,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,006 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 21:54:29,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892677826] [2023-11-06 21:54:29,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892677826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:29,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:29,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:54:29,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139517082] [2023-11-06 21:54:29,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:29,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:54:29,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:29,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:54:29,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:54:29,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 255 [2023-11-06 21:54:29,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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 21:54:29,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:29,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 255 [2023-11-06 21:54:29,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:29,297 INFO L124 PetriNetUnfolderBase]: 371/721 cut-off events. [2023-11-06 21:54:29,298 INFO L125 PetriNetUnfolderBase]: For 795/800 co-relation queries the response was YES. [2023-11-06 21:54:29,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 721 events. 371/721 cut-off events. For 795/800 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3774 event pairs, 66 based on Foata normal form. 86/790 useless extension candidates. Maximal degree in co-relation 2420. Up to 277 conditions per place. [2023-11-06 21:54:29,304 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 37 selfloop transitions, 7 changer transitions 26/74 dead transitions. [2023-11-06 21:54:29,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 476 flow [2023-11-06 21:54:29,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:54:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:54:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions. [2023-11-06 21:54:29,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46862745098039216 [2023-11-06 21:54:29,308 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 717 transitions. [2023-11-06 21:54:29,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions. [2023-11-06 21:54:29,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:29,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions. [2023-11-06 21:54:29,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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 21:54:29,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states 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 21:54:29,315 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states 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 21:54:29,316 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 146 flow. Second operand 6 states and 717 transitions. [2023-11-06 21:54:29,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 476 flow [2023-11-06 21:54:29,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 74 transitions, 448 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-06 21:54:29,322 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 178 flow [2023-11-06 21:54:29,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2023-11-06 21:54:29,323 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-11-06 21:54:29,323 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 178 flow [2023-11-06 21:54:29,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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 21:54:29,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:29,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:29,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:54:29,325 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:29,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:29,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1796411027, now seen corresponding path program 1 times [2023-11-06 21:54:29,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:29,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486550000] [2023-11-06 21:54:29,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,547 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 21:54:29,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:29,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486550000] [2023-11-06 21:54:29,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486550000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:29,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:29,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:54:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267346526] [2023-11-06 21:54:29,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:29,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:29,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:29,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:29,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:29,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 255 [2023-11-06 21:54:29,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 29 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:29,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:29,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 255 [2023-11-06 21:54:29,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:29,759 INFO L124 PetriNetUnfolderBase]: 171/357 cut-off events. [2023-11-06 21:54:29,759 INFO L125 PetriNetUnfolderBase]: For 614/618 co-relation queries the response was YES. [2023-11-06 21:54:29,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 357 events. 171/357 cut-off events. For 614/618 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1624 event pairs, 52 based on Foata normal form. 24/372 useless extension candidates. Maximal degree in co-relation 1335. Up to 129 conditions per place. [2023-11-06 21:54:29,762 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 31 selfloop transitions, 10 changer transitions 14/58 dead transitions. [2023-11-06 21:54:29,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 401 flow [2023-11-06 21:54:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:54:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 817 transitions. [2023-11-06 21:54:29,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.457703081232493 [2023-11-06 21:54:29,766 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 817 transitions. [2023-11-06 21:54:29,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 817 transitions. [2023-11-06 21:54:29,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:29,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 817 transitions. [2023-11-06 21:54:29,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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 21:54:29,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states 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 21:54:29,774 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states 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 21:54:29,774 INFO L175 Difference]: Start difference. First operand has 51 places, 29 transitions, 178 flow. Second operand 7 states and 817 transitions. [2023-11-06 21:54:29,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 401 flow [2023-11-06 21:54:29,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 356 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-06 21:54:29,780 INFO L231 Difference]: Finished difference. Result has 53 places, 27 transitions, 161 flow [2023-11-06 21:54:29,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=27} [2023-11-06 21:54:29,781 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-11-06 21:54:29,781 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 27 transitions, 161 flow [2023-11-06 21:54:29,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:29,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:29,782 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 21:54:29,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:54:29,783 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:29,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash -76976656, now seen corresponding path program 1 times [2023-11-06 21:54:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:29,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407401163] [2023-11-06 21:54:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:29,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,161 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 21:54:30,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:30,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407401163] [2023-11-06 21:54:30,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407401163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572150502] [2023-11-06 21:54:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:30,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:54:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:30,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:54:30,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:30,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 255 [2023-11-06 21:54:30,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 27 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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 21:54:30,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:30,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 255 [2023-11-06 21:54:30,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:30,331 INFO L124 PetriNetUnfolderBase]: 142/281 cut-off events. [2023-11-06 21:54:30,331 INFO L125 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2023-11-06 21:54:30,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 281 events. 142/281 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 972 event pairs, 17 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 1065. Up to 171 conditions per place. [2023-11-06 21:54:30,334 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 41 selfloop transitions, 10 changer transitions 7/58 dead transitions. [2023-11-06 21:54:30,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 446 flow [2023-11-06 21:54:30,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:54:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:54:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2023-11-06 21:54:30,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4447058823529412 [2023-11-06 21:54:30,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 567 transitions. [2023-11-06 21:54:30,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 567 transitions. [2023-11-06 21:54:30,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:30,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 567 transitions. [2023-11-06 21:54:30,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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 21:54:30,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 21:54:30,343 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 21:54:30,344 INFO L175 Difference]: Start difference. First operand has 53 places, 27 transitions, 161 flow. Second operand 5 states and 567 transitions. [2023-11-06 21:54:30,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 446 flow [2023-11-06 21:54:30,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 345 flow, removed 26 selfloop flow, removed 12 redundant places. [2023-11-06 21:54:30,348 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 181 flow [2023-11-06 21:54:30,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2023-11-06 21:54:30,349 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-11-06 21:54:30,349 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 181 flow [2023-11-06 21:54:30,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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 21:54:30,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:30,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:30,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:54:30,350 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:30,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:30,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2028929940, now seen corresponding path program 2 times [2023-11-06 21:54:30,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:30,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634961409] [2023-11-06 21:54:30,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:30,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,585 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 21:54:30,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634961409] [2023-11-06 21:54:30,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634961409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:30,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:30,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:30,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274179810] [2023-11-06 21:54:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:30,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:54:30,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:54:30,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:30,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 255 [2023-11-06 21:54:30,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states 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 21:54:30,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:30,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 255 [2023-11-06 21:54:30,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:30,723 INFO L124 PetriNetUnfolderBase]: 135/301 cut-off events. [2023-11-06 21:54:30,723 INFO L125 PetriNetUnfolderBase]: For 443/450 co-relation queries the response was YES. [2023-11-06 21:54:30,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 301 events. 135/301 cut-off events. For 443/450 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1204 event pairs, 32 based on Foata normal form. 3/300 useless extension candidates. Maximal degree in co-relation 1071. Up to 151 conditions per place. [2023-11-06 21:54:30,726 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 26 selfloop transitions, 1 changer transitions 28/57 dead transitions. [2023-11-06 21:54:30,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 389 flow [2023-11-06 21:54:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:54:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:54:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-11-06 21:54:30,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715686274509804 [2023-11-06 21:54:30,729 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-11-06 21:54:30,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-11-06 21:54:30,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:30,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-11-06 21:54:30,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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 21:54:30,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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 21:54:30,734 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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 21:54:30,734 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 181 flow. Second operand 4 states and 481 transitions. [2023-11-06 21:54:30,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 389 flow [2023-11-06 21:54:30,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 387 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-06 21:54:30,738 INFO L231 Difference]: Finished difference. Result has 49 places, 27 transitions, 135 flow [2023-11-06 21:54:30,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=49, PETRI_TRANSITIONS=27} [2023-11-06 21:54:30,739 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-11-06 21:54:30,739 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 27 transitions, 135 flow [2023-11-06 21:54:30,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states 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 21:54:30,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:30,740 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 21:54:30,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:54:30,740 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:30,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:30,741 INFO L85 PathProgramCache]: Analyzing trace with hash -517732364, now seen corresponding path program 3 times [2023-11-06 21:54:30,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:30,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531746340] [2023-11-06 21:54:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:30,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,811 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 21:54:31,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:31,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531746340] [2023-11-06 21:54:31,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531746340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:31,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:31,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:54:31,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230750284] [2023-11-06 21:54:31,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:31,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:54:31,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:31,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:54:31,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:31,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 255 [2023-11-06 21:54:31,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 27 transitions, 135 flow. Second operand has 7 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 0 states 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 21:54:31,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:31,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 255 [2023-11-06 21:54:31,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:32,111 INFO L124 PetriNetUnfolderBase]: 32/94 cut-off events. [2023-11-06 21:54:32,112 INFO L125 PetriNetUnfolderBase]: For 159/161 co-relation queries the response was YES. [2023-11-06 21:54:32,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 94 events. 32/94 cut-off events. For 159/161 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 268 event pairs, 4 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 336. Up to 37 conditions per place. [2023-11-06 21:54:32,113 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 23 selfloop transitions, 5 changer transitions 14/45 dead transitions. [2023-11-06 21:54:32,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 322 flow [2023-11-06 21:54:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:54:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 21:54:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 901 transitions. [2023-11-06 21:54:32,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2023-11-06 21:54:32,118 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 901 transitions. [2023-11-06 21:54:32,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 901 transitions. [2023-11-06 21:54:32,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:32,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 901 transitions. [2023-11-06 21:54:32,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.625) internal successors, (901), 8 states have internal predecessors, (901), 0 states have call successors, (0), 0 states 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 21:54:32,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states 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 21:54:32,127 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states 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 21:54:32,128 INFO L175 Difference]: Start difference. First operand has 49 places, 27 transitions, 135 flow. Second operand 8 states and 901 transitions. [2023-11-06 21:54:32,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 322 flow [2023-11-06 21:54:32,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 281 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-11-06 21:54:32,131 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 122 flow [2023-11-06 21:54:32,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-11-06 21:54:32,131 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-11-06 21:54:32,132 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 122 flow [2023-11-06 21:54:32,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 0 states 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 21:54:32,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:32,133 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 21:54:32,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:54:32,133 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:32,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:32,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1407330604, now seen corresponding path program 4 times [2023-11-06 21:54:32,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:32,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071149061] [2023-11-06 21:54:32,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:32,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:54:32,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:54:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:54:32,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:54:32,259 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:54:32,260 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 21:54:32,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 21:54:32,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 21:54:32,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 21:54:32,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 21:54:32,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 21:54:32,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 21:54:32,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 21:54:32,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 21:54:32,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 21:54:32,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 21:54:32,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 21:54:32,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 21:54:32,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:54:32,265 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:32,271 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 21:54:32,272 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:54:32,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:54:32 BasicIcfg [2023-11-06 21:54:32,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:54:32,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:54:32,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:54:32,342 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:54:32,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:17" (3/4) ... [2023-11-06 21:54:32,344 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:54:32,345 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:54:32,346 INFO L158 Benchmark]: Toolchain (without parser) took 16389.24ms. Allocated memory was 159.4MB in the beginning and 373.3MB in the end (delta: 213.9MB). Free memory was 111.1MB in the beginning and 228.2MB in the end (delta: -117.1MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2023-11-06 21:54:32,346 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:54:32,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 744.89ms. Allocated memory is still 159.4MB. Free memory was 111.1MB in the beginning and 86.8MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 21:54:32,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.12ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 83.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:54:32,347 INFO L158 Benchmark]: Boogie Preprocessor took 69.93ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:54:32,348 INFO L158 Benchmark]: RCFGBuilder took 920.46ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 82.2MB in the beginning and 155.6MB in the end (delta: -73.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-11-06 21:54:32,348 INFO L158 Benchmark]: TraceAbstraction took 14548.28ms. Allocated memory was 213.9MB in the beginning and 373.3MB in the end (delta: 159.4MB). Free memory was 155.6MB in the beginning and 229.3MB in the end (delta: -73.7MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2023-11-06 21:54:32,349 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 373.3MB. Free memory was 229.3MB in the beginning and 228.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:54:32,351 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.24ms. Allocated memory is still 159.4MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 744.89ms. Allocated memory is still 159.4MB. Free memory was 111.1MB in the beginning and 86.8MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.12ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 83.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.93ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 920.46ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 82.2MB in the beginning and 155.6MB in the end (delta: -73.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14548.28ms. Allocated memory was 213.9MB in the beginning and 373.3MB in the end (delta: 159.4MB). Free memory was 155.6MB in the beginning and 229.3MB in the end (delta: -73.7MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 373.3MB. Free memory was 229.3MB in the beginning and 228.2MB 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: 5.2s, 132 PlacesBefore, 40 PlacesAfterwards, 125 TransitionsBefore, 31 TransitionsAfterwards, 2464 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 127 TotalNumberOfCompositions, 6236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2681, independent: 2514, independent conditional: 0, independent unconditional: 2514, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1353, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2681, independent: 1201, independent conditional: 0, independent unconditional: 1201, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 1353, unknown conditional: 0, unknown unconditional: 1353] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L846] 0 pthread_t t156; [L847] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t156, ((void *)0), P0, ((void *)0))=-2, t156={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t157; [L849] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t157, ((void *)0), P1, ((void *)0))=-1, t156={5:0}, t157={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t158; [L851] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t158, ((void *)0), P2, ((void *)0))=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EAX = y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L821] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EBX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L866] 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", "mix006.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 851]: 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: 849]: 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 7 procedures, 154 locations, 13 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: 14.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 329 mSDsluCounter, 139 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1077 IncrementalHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 38 mSDtfsCounter, 1077 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=11, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 21:54:32,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:54:35,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:54:35,128 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 21:54:35,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:54:35,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:54:35,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:54:35,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:54:35,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:54:35,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:54:35,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:54:35,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:54:35,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:54:35,168 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:54:35,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:54:35,169 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:54:35,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:54:35,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:54:35,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:54:35,172 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:54:35,173 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:54:35,173 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:54:35,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:54:35,175 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:54:35,175 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:54:35,176 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:54:35,176 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:54:35,177 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:54:35,178 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:54:35,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:54:35,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:54:35,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:54:35,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:35,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:54:35,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:54:35,181 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:54:35,182 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:54:35,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:54:35,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:54:35,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:54:35,183 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:54:35,183 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:54:35,184 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_61a4db75-f002-4167-8a86-ab6fe40bdc12/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_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 -> 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 [2023-11-06 21:54:35,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:54:35,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:54:35,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:54:35,627 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:54:35,627 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:54:35,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix006.opt.i [2023-11-06 21:54:38,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:54:39,258 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:54:39,259 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/sv-benchmarks/c/pthread-wmm/mix006.opt.i [2023-11-06 21:54:39,280 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/data/1c5b10088/c34598bba3c84f6eaf972035e735e53c/FLAGc3b92e6e7 [2023-11-06 21:54:39,295 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/data/1c5b10088/c34598bba3c84f6eaf972035e735e53c [2023-11-06 21:54:39,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:54:39,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:54:39,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:39,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:54:39,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:54:39,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:39" (1/1) ... [2023-11-06 21:54:39,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276e15f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:39, skipping insertion in model container [2023-11-06 21:54:39,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:39" (1/1) ... [2023-11-06 21:54:39,361 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:54:39,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:39,871 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:54:39,963 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:40,019 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:54:40,019 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:54:40,027 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:54:40,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40 WrapperNode [2023-11-06 21:54:40,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:40,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:40,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:54:40,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:54:40,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (1/1) ... [2023-11-06 21:54:40,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (1/1) ... [2023-11-06 21:54:40,098 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2023-11-06 21:54:40,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:40,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:54:40,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:54:40,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:54:40,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (1/1) ... [2023-11-06 21:54:40,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (1/1) ... [2023-11-06 21:54:40,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (1/1) ... [2023-11-06 21:54:40,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (1/1) ... [2023-11-06 21:54:40,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (1/1) ... [2023-11-06 21:54:40,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (1/1) ... [2023-11-06 21:54:40,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (1/1) ... [2023-11-06 21:54:40,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (1/1) ... [2023-11-06 21:54:40,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:54:40,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:54:40,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:54:40,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:54:40,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (1/1) ... [2023-11-06 21:54:40,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:40,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:40,182 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:54:40,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:54:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:54:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:54:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:54:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:54:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 21:54:40,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:54:40,217 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 21:54:40,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 21:54:40,217 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 21:54:40,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 21:54:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 21:54:40,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 21:54:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:54:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:54:40,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:54:40,220 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 21:54:40,461 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:54:40,465 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:54:40,913 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:54:41,080 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:54:41,080 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:54:41,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:41 BoogieIcfgContainer [2023-11-06 21:54:41,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:54:41,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:54:41,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:54:41,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:54:41,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:54:39" (1/3) ... [2023-11-06 21:54:41,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8a97f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:41, skipping insertion in model container [2023-11-06 21:54:41,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:40" (2/3) ... [2023-11-06 21:54:41,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8a97f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:41, skipping insertion in model container [2023-11-06 21:54:41,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:41" (3/3) ... [2023-11-06 21:54:41,096 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2023-11-06 21:54:41,116 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:54:41,117 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 21:54:41,117 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:54:41,180 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:54:41,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 129 transitions, 270 flow [2023-11-06 21:54:41,299 INFO L124 PetriNetUnfolderBase]: 3/126 cut-off events. [2023-11-06 21:54:41,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:54:41,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 3/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 21:54:41,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 129 transitions, 270 flow [2023-11-06 21:54:41,315 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 126 transitions, 261 flow [2023-11-06 21:54:41,322 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:54:41,337 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 126 transitions, 261 flow [2023-11-06 21:54:41,345 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 126 transitions, 261 flow [2023-11-06 21:54:41,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 126 transitions, 261 flow [2023-11-06 21:54:41,401 INFO L124 PetriNetUnfolderBase]: 3/126 cut-off events. [2023-11-06 21:54:41,401 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:54:41,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 3/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 21:54:41,405 INFO L119 LiptonReduction]: Number of co-enabled transitions 2464 [2023-11-06 21:54:50,210 INFO L134 LiptonReduction]: Checked pairs total: 5976 [2023-11-06 21:54:50,211 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-11-06 21:54:50,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:54:50,233 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;@9dce48c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:54:50,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 21:54:50,235 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:54:50,236 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 21:54:50,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:54:50,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:50,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 21:54:50,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:50,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:50,243 INFO L85 PathProgramCache]: Analyzing trace with hash 591, now seen corresponding path program 1 times [2023-11-06 21:54:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:50,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406466678] [2023-11-06 21:54:50,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:50,258 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 21:54:50,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:50,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:50,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 21:54:50,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:50,398 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 21:54:50,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:50,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:50,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406466678] [2023-11-06 21:54:50,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406466678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:50,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:50,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 21:54:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017984011] [2023-11-06 21:54:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:50,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:54:50,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:50,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:54:50,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:54:50,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 254 [2023-11-06 21:54:50,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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 21:54:50,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:50,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 254 [2023-11-06 21:54:50,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:50,957 INFO L124 PetriNetUnfolderBase]: 1101/1670 cut-off events. [2023-11-06 21:54:50,957 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-06 21:54:50,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3343 conditions, 1670 events. 1101/1670 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8011 event pairs, 1101 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 3332. Up to 1637 conditions per place. [2023-11-06 21:54:50,979 INFO L140 encePairwiseOnDemand]: 247/254 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-11-06 21:54:50,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2023-11-06 21:54:50,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:54:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 21:54:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions. [2023-11-06 21:54:51,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137795275590551 [2023-11-06 21:54:51,006 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 261 transitions. [2023-11-06 21:54:51,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 261 transitions. [2023-11-06 21:54:51,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:51,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 261 transitions. [2023-11-06 21:54:51,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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 21:54:51,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states 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 21:54:51,024 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states 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 21:54:51,026 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 261 transitions. [2023-11-06 21:54:51,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2023-11-06 21:54:51,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:54:51,032 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-11-06 21:54:51,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-11-06 21:54:51,040 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-11-06 21:54:51,041 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-11-06 21:54:51,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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 21:54:51,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:51,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:51,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:51,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:51,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:51,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1918693655, now seen corresponding path program 1 times [2023-11-06 21:54:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:51,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983979910] [2023-11-06 21:54:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:51,254 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 21:54:51,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:51,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:51,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:54:51,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:51,419 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 21:54:51,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:51,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:51,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983979910] [2023-11-06 21:54:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983979910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:51,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:54:51,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343404312] [2023-11-06 21:54:51,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:51,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:51,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:51,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:51,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:51,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 254 [2023-11-06 21:54:51,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:51,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:51,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 254 [2023-11-06 21:54:51,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:51,759 INFO L124 PetriNetUnfolderBase]: 910/1452 cut-off events. [2023-11-06 21:54:51,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:54:51,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 1452 events. 910/1452 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7387 event pairs, 146 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 2845. Up to 1101 conditions per place. [2023-11-06 21:54:51,775 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 28 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2023-11-06 21:54:51,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 140 flow [2023-11-06 21:54:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:54:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-11-06 21:54:51,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49606299212598426 [2023-11-06 21:54:51,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-11-06 21:54:51,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-11-06 21:54:51,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:51,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-11-06 21:54:51,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 21:54:51,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states 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 21:54:51,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states 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 21:54:51,796 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 378 transitions. [2023-11-06 21:54:51,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 140 flow [2023-11-06 21:54:51,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:54:51,798 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-11-06 21:54:51,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-11-06 21:54:51,799 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-11-06 21:54:51,800 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-11-06 21:54:51,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:51,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:51,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:51,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:52,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:52,013 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:52,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1323571846, now seen corresponding path program 1 times [2023-11-06 21:54:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:52,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126344055] [2023-11-06 21:54:52,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:52,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:54:52,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:52,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:52,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:54:52,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:52,207 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 21:54:52,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:52,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:52,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126344055] [2023-11-06 21:54:52,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126344055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:52,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115341998] [2023-11-06 21:54:52,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:52,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:54:52,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:52,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:54:52,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:52,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 254 [2023-11-06 21:54:52,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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 21:54:52,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:52,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 254 [2023-11-06 21:54:52,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:52,578 INFO L124 PetriNetUnfolderBase]: 514/856 cut-off events. [2023-11-06 21:54:52,578 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-06 21:54:52,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1792 conditions, 856 events. 514/856 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4000 event pairs, 96 based on Foata normal form. 60/877 useless extension candidates. Maximal degree in co-relation 1788. Up to 609 conditions per place. [2023-11-06 21:54:52,585 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 29 selfloop transitions, 4 changer transitions 19/55 dead transitions. [2023-11-06 21:54:52,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 234 flow [2023-11-06 21:54:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:54:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:54:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-11-06 21:54:52,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4637795275590551 [2023-11-06 21:54:52,588 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-11-06 21:54:52,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-11-06 21:54:52,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:52,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-11-06 21:54:52,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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 21:54:52,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states 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 21:54:52,597 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states 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 21:54:52,597 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 589 transitions. [2023-11-06 21:54:52,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 234 flow [2023-11-06 21:54:52,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:54:52,602 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2023-11-06 21:54:52,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-06 21:54:52,604 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-06 21:54:52,604 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2023-11-06 21:54:52,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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 21:54:52,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:52,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:52,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:52,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:52,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:52,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1893955053, now seen corresponding path program 1 times [2023-11-06 21:54:52,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:52,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381021785] [2023-11-06 21:54:52,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:52,831 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 21:54:52,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:52,833 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:52,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:54:52,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:53,010 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 21:54:53,011 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:53,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381021785] [2023-11-06 21:54:53,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381021785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:53,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:53,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:54:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412304906] [2023-11-06 21:54:53,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:53,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:54:53,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:53,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:54:53,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:54:53,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 254 [2023-11-06 21:54:53,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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 21:54:53,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:53,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 254 [2023-11-06 21:54:53,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:53,349 INFO L124 PetriNetUnfolderBase]: 208/396 cut-off events. [2023-11-06 21:54:53,349 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-06 21:54:53,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 396 events. 208/396 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1625 event pairs, 44 based on Foata normal form. 36/419 useless extension candidates. Maximal degree in co-relation 1068. Up to 136 conditions per place. [2023-11-06 21:54:53,353 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 37 selfloop transitions, 7 changer transitions 19/66 dead transitions. [2023-11-06 21:54:53,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 338 flow [2023-11-06 21:54:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:54:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:54:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 707 transitions. [2023-11-06 21:54:53,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46391076115485563 [2023-11-06 21:54:53,357 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 707 transitions. [2023-11-06 21:54:53,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 707 transitions. [2023-11-06 21:54:53,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:53,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 707 transitions. [2023-11-06 21:54:53,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states 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 21:54:53,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states 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 21:54:53,366 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states 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 21:54:53,366 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 707 transitions. [2023-11-06 21:54:53,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 338 flow [2023-11-06 21:54:53,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 332 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 21:54:53,370 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2023-11-06 21:54:53,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-06 21:54:53,371 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-11-06 21:54:53,372 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2023-11-06 21:54:53,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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 21:54:53,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:53,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:53,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:53,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:53,584 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:53,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1999452771, now seen corresponding path program 1 times [2023-11-06 21:54:53,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:53,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389562479] [2023-11-06 21:54:53,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:53,586 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 21:54:53,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:53,587 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:53,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:54:53,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:53,800 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 21:54:53,800 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:53,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:53,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389562479] [2023-11-06 21:54:53,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389562479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:53,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:53,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:54:53,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819897844] [2023-11-06 21:54:53,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:53,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:53,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:53,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:53,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 254 [2023-11-06 21:54:53,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 21:54:53,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:53,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 254 [2023-11-06 21:54:53,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:54,154 INFO L124 PetriNetUnfolderBase]: 120/237 cut-off events. [2023-11-06 21:54:54,155 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2023-11-06 21:54:54,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 237 events. 120/237 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 836 event pairs, 39 based on Foata normal form. 10/243 useless extension candidates. Maximal degree in co-relation 708. Up to 90 conditions per place. [2023-11-06 21:54:54,157 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 34 selfloop transitions, 10 changer transitions 10/57 dead transitions. [2023-11-06 21:54:54,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 336 flow [2023-11-06 21:54:54,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:54:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2023-11-06 21:54:54,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.452755905511811 [2023-11-06 21:54:54,161 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2023-11-06 21:54:54,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2023-11-06 21:54:54,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:54,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2023-11-06 21:54:54,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states 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 21:54:54,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states 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 21:54:54,171 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states 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 21:54:54,171 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 805 transitions. [2023-11-06 21:54:54,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 336 flow [2023-11-06 21:54:54,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 300 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-06 21:54:54,176 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2023-11-06 21:54:54,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-11-06 21:54:54,177 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-11-06 21:54:54,178 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2023-11-06 21:54:54,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 21:54:54,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:54,178 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 21:54:54,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:54,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:54,390 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:54,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:54,390 INFO L85 PathProgramCache]: Analyzing trace with hash -338720146, now seen corresponding path program 1 times [2023-11-06 21:54:54,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:54,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177744694] [2023-11-06 21:54:54,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:54,391 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 21:54:54,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:54,395 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:54,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:54:54,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:54,599 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 21:54:54,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:54,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:54,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177744694] [2023-11-06 21:54:54,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177744694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:54,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:54,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:54,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118310246] [2023-11-06 21:54:54,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:54,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:54:54,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:54,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:54:54,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:54,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2023-11-06 21:54:54,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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 21:54:54,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:54,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2023-11-06 21:54:54,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:54,813 INFO L124 PetriNetUnfolderBase]: 151/307 cut-off events. [2023-11-06 21:54:54,813 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2023-11-06 21:54:54,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 307 events. 151/307 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1253 event pairs, 28 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 904. Up to 173 conditions per place. [2023-11-06 21:54:54,816 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 55 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-06 21:54:54,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 412 flow [2023-11-06 21:54:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:54:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:54:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-11-06 21:54:54,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484251968503937 [2023-11-06 21:54:54,819 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-11-06 21:54:54,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-11-06 21:54:54,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:54,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-11-06 21:54:54,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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 21:54:54,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states 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 21:54:54,824 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states 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 21:54:54,825 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 4 states and 492 transitions. [2023-11-06 21:54:54,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 412 flow [2023-11-06 21:54:54,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 332 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-06 21:54:54,830 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 115 flow [2023-11-06 21:54:54,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-11-06 21:54:54,831 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-11-06 21:54:54,831 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 115 flow [2023-11-06 21:54:54,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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 21:54:54,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:54,832 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 21:54:54,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:55,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:55,045 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:55,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash 894632724, now seen corresponding path program 2 times [2023-11-06 21:54:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:55,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372362766] [2023-11-06 21:54:55,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:54:55,046 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 21:54:55,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:55,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:55,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:55,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 21:54:55,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:54:55,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:54:55,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:55,232 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 21:54:55,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:55,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:55,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372362766] [2023-11-06 21:54:55,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372362766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:55,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:55,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:55,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637928182] [2023-11-06 21:54:55,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:55,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:55,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:55,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:55,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:55,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2023-11-06 21:54:55,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:55,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:55,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2023-11-06 21:54:55,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:55,418 INFO L124 PetriNetUnfolderBase]: 260/514 cut-off events. [2023-11-06 21:54:55,419 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2023-11-06 21:54:55,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 514 events. 260/514 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2492 event pairs, 111 based on Foata normal form. 1/507 useless extension candidates. Maximal degree in co-relation 1453. Up to 295 conditions per place. [2023-11-06 21:54:55,423 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 47 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-06 21:54:55,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 297 flow [2023-11-06 21:54:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:54:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-11-06 21:54:55,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494750656167979 [2023-11-06 21:54:55,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-11-06 21:54:55,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-11-06 21:54:55,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:55,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-11-06 21:54:55,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states 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 21:54:55,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states 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 21:54:55,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states 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 21:54:55,431 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 115 flow. Second operand 3 states and 377 transitions. [2023-11-06 21:54:55,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 297 flow [2023-11-06 21:54:55,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:54:55,438 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 126 flow [2023-11-06 21:54:55,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-06 21:54:55,439 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-11-06 21:54:55,439 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 126 flow [2023-11-06 21:54:55,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:55,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:55,440 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 21:54:55,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:55,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:55,659 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:54:55,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1688338280, now seen corresponding path program 3 times [2023-11-06 21:54:55,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:55,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302884280] [2023-11-06 21:54:55,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:54:55,661 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 21:54:55,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:55,662 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:55,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:55,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 21:54:55,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 21:54:55,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:54:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:54:56,028 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 21:54:56,028 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:54:56,029 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 21:54:56,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 21:54:56,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 21:54:56,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 21:54:56,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 21:54:56,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 21:54:56,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 21:54:56,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 21:54:56,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 21:54:56,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 21:54:56,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 21:54:56,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 21:54:56,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 21:54:56,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:56,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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 21:54:56,249 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-06 21:54:56,253 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 21:54:56,253 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:54:56,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:54:56 BasicIcfg [2023-11-06 21:54:56,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:54:56,356 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:54:56,356 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:54:56,356 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:54:56,357 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:41" (3/4) ... [2023-11-06 21:54:56,358 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:54:56,359 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:54:56,360 INFO L158 Benchmark]: Toolchain (without parser) took 17060.62ms. Allocated memory was 81.8MB in the beginning and 151.0MB in the end (delta: 69.2MB). Free memory was 56.6MB in the beginning and 117.2MB in the end (delta: -60.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2023-11-06 21:54:56,360 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 81.8MB. Free memory was 57.8MB in the beginning and 57.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:54:56,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 727.80ms. Allocated memory is still 81.8MB. Free memory was 56.4MB in the beginning and 53.7MB in the end (delta: 2.7MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2023-11-06 21:54:56,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.44ms. Allocated memory is still 81.8MB. Free memory was 53.7MB in the beginning and 51.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:54:56,362 INFO L158 Benchmark]: Boogie Preprocessor took 41.01ms. Allocated memory is still 81.8MB. Free memory was 51.0MB in the beginning and 48.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:54:56,362 INFO L158 Benchmark]: RCFGBuilder took 942.73ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 48.6MB in the beginning and 72.3MB in the end (delta: -23.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2023-11-06 21:54:56,362 INFO L158 Benchmark]: TraceAbstraction took 15267.77ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 71.5MB in the beginning and 118.2MB in the end (delta: -46.7MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2023-11-06 21:54:56,363 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 151.0MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:54:56,365 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 81.8MB. Free memory was 57.8MB in the beginning and 57.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 727.80ms. Allocated memory is still 81.8MB. Free memory was 56.4MB in the beginning and 53.7MB in the end (delta: 2.7MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.44ms. Allocated memory is still 81.8MB. Free memory was 53.7MB in the beginning and 51.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.01ms. Allocated memory is still 81.8MB. Free memory was 51.0MB in the beginning and 48.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 942.73ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 48.6MB in the beginning and 72.3MB in the end (delta: -23.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15267.77ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 71.5MB in the beginning and 118.2MB in the end (delta: -46.7MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 151.0MB. Free memory is still 117.2MB. 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: 8.9s, 133 PlacesBefore, 41 PlacesAfterwards, 126 TransitionsBefore, 32 TransitionsAfterwards, 2464 CoEnabledTransitionPairs, 6 FixpointIterations, 49 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 125 TotalNumberOfCompositions, 5976 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2925, independent: 2762, independent conditional: 0, independent unconditional: 2762, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1359, independent: 1323, independent conditional: 0, independent unconditional: 1323, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2925, independent: 1439, independent conditional: 0, independent unconditional: 1439, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 1359, unknown conditional: 0, unknown unconditional: 1359] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L846] 0 pthread_t t156; [L847] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t156, ((void *)0), P0, ((void *)0))=0, t156={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t157; [L849] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t157, ((void *)0), P1, ((void *)0))=1, t156={-6:0}, t157={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t158; [L851] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t158, ((void *)0), P2, ((void *)0))=2, t156={-6:0}, t157={-10:0}, t158={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EAX = y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L821] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EBX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={-6:0}, t157={-10:0}, t158={-2:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L866] 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", "mix006.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 851]: 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: 849]: 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 7 procedures, 155 locations, 13 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: 15.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 711 IncrementalHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 43 mSDtfsCounter, 711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 30, 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.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 206 SizeOfPredicates, 10 NumberOfNonLiveVariables, 780 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 21:54:56,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a4db75-f002-4167-8a86-ab6fe40bdc12/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