./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.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_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/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_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/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_a1926e05-8471-483a-9717-41492d8da13a/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 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:17:43,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:17:43,791 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:17:43,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:17:43,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:17:43,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:17:43,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:17:43,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:17:43,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:17:43,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:17:43,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:17:43,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:17:43,871 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:17:43,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:17:43,874 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:17:43,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:17:43,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:17:43,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:17:43,882 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:17:43,882 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:17:43,883 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:17:43,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:17:43,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:17:43,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:17:43,885 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:17:43,885 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:17:43,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:17:43,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:17:43,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:17:43,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:43,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:17:43,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:17:43,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:17:43,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:17:43,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:17:43,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:17:43,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:17:43,891 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:17:43,897 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_a1926e05-8471-483a-9717-41492d8da13a/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_a1926e05-8471-483a-9717-41492d8da13a/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 -> 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 [2023-11-06 22:17:44,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:17:44,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:17:44,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:17:44,279 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:17:44,281 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:17:44,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:17:47,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:17:47,787 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:17:47,788 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:17:47,809 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/data/16537f408/9685874c079e4c7eaa728b3af4d19f0e/FLAG31587d140 [2023-11-06 22:17:47,833 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/data/16537f408/9685874c079e4c7eaa728b3af4d19f0e [2023-11-06 22:17:47,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:17:47,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:17:47,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:47,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:17:47,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:17:47,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:47" (1/1) ... [2023-11-06 22:17:47,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f06ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:47, skipping insertion in model container [2023-11-06 22:17:47,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:47" (1/1) ... [2023-11-06 22:17:47,949 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:17:48,491 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:48,508 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:17:48,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:48,613 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:17:48,613 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:17:48,622 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:17:48,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48 WrapperNode [2023-11-06 22:17:48,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:48,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:48,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:17:48,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:17:48,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (1/1) ... [2023-11-06 22:17:48,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (1/1) ... [2023-11-06 22:17:48,737 INFO L138 Inliner]: procedures = 176, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2023-11-06 22:17:48,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:48,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:17:48,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:17:48,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:17:48,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (1/1) ... [2023-11-06 22:17:48,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (1/1) ... [2023-11-06 22:17:48,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (1/1) ... [2023-11-06 22:17:48,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (1/1) ... [2023-11-06 22:17:48,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (1/1) ... [2023-11-06 22:17:48,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (1/1) ... [2023-11-06 22:17:48,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (1/1) ... [2023-11-06 22:17:48,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (1/1) ... [2023-11-06 22:17:48,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:17:48,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:17:48,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:17:48,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:17:48,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (1/1) ... [2023-11-06 22:17:48,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:48,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:17:48,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:17:48,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:17:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:17:48,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:17:48,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:17:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:17:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:17:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:17:48,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:17:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:17:48,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:17:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:17:48,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:17:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:17:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:17:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:17:48,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:17:48,931 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:17:49,193 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:17:49,197 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:17:49,713 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:17:49,949 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:17:49,949 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:17:49,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:49 BoogieIcfgContainer [2023-11-06 22:17:49,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:17:49,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:17:49,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:17:49,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:17:49,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:17:47" (1/3) ... [2023-11-06 22:17:49,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c712ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:49, skipping insertion in model container [2023-11-06 22:17:49,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:48" (2/3) ... [2023-11-06 22:17:49,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c712ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:49, skipping insertion in model container [2023-11-06 22:17:49,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:49" (3/3) ... [2023-11-06 22:17:49,963 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:17:49,987 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:17:49,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:17:49,987 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:17:50,066 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:17:50,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 134 transitions, 280 flow [2023-11-06 22:17:50,192 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-11-06 22:17:50,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:50,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-06 22:17:50,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 134 transitions, 280 flow [2023-11-06 22:17:50,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 131 transitions, 271 flow [2023-11-06 22:17:50,210 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:17:50,223 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 131 transitions, 271 flow [2023-11-06 22:17:50,226 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 131 transitions, 271 flow [2023-11-06 22:17:50,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 271 flow [2023-11-06 22:17:50,267 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-11-06 22:17:50,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:50,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-06 22:17:50,273 INFO L119 LiptonReduction]: Number of co-enabled transitions 3032 [2023-11-06 22:17:56,036 INFO L134 LiptonReduction]: Checked pairs total: 8463 [2023-11-06 22:17:56,036 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-11-06 22:17:56,063 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:17:56,073 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;@754e1ae2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:17:56,073 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:17:56,075 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:17:56,075 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:17:56,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:56,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:56,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:17:56,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:17:56,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash 595, now seen corresponding path program 1 times [2023-11-06 22:17:56,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:56,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699169310] [2023-11-06 22:17:56,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:56,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:56,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:56,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699169310] [2023-11-06 22:17:56,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699169310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:56,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:56,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:17:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159611285] [2023-11-06 22:17:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:56,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:17:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:17:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:17:56,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 269 [2023-11-06 22:17:56,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:56,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:56,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 269 [2023-11-06 22:17:56,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:57,117 INFO L124 PetriNetUnfolderBase]: 2494/3615 cut-off events. [2023-11-06 22:17:57,118 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-06 22:17:57,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7287 conditions, 3615 events. 2494/3615 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17189 event pairs, 2494 based on Foata normal form. 0/3086 useless extension candidates. Maximal degree in co-relation 7276. Up to 3606 conditions per place. [2023-11-06 22:17:57,160 INFO L140 encePairwiseOnDemand]: 262/269 looper letters, 25 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-11-06 22:17:57,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 113 flow [2023-11-06 22:17:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:17:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:17:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 272 transitions. [2023-11-06 22:17:57,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055762081784386 [2023-11-06 22:17:57,185 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 272 transitions. [2023-11-06 22:17:57,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 272 transitions. [2023-11-06 22:17:57,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:57,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 272 transitions. [2023-11-06 22:17:57,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 136.0) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,206 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,208 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 77 flow. Second operand 2 states and 272 transitions. [2023-11-06 22:17:57,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 113 flow [2023-11-06 22:17:57,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:17:57,218 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2023-11-06 22:17:57,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-11-06 22:17:57,226 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2023-11-06 22:17:57,226 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2023-11-06 22:17:57,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:57,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:17:57,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:17:57,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:17:57,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash 584583, now seen corresponding path program 1 times [2023-11-06 22:17:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:57,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329337718] [2023-11-06 22:17:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329337718] [2023-11-06 22:17:57,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329337718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:57,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:17:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796795536] [2023-11-06 22:17:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:57,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:17:57,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:57,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:17:57,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:17:57,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 269 [2023-11-06 22:17:57,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:57,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 269 [2023-11-06 22:17:57,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:58,155 INFO L124 PetriNetUnfolderBase]: 1951/2976 cut-off events. [2023-11-06 22:17:58,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:58,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5869 conditions, 2976 events. 1951/2976 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 15278 event pairs, 498 based on Foata normal form. 0/2735 useless extension candidates. Maximal degree in co-relation 5866. Up to 2296 conditions per place. [2023-11-06 22:17:58,178 INFO L140 encePairwiseOnDemand]: 266/269 looper letters, 39 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-11-06 22:17:58,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 186 flow [2023-11-06 22:17:58,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:17:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:17:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-11-06 22:17:58,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4969021065675341 [2023-11-06 22:17:58,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-11-06 22:17:58,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-11-06 22:17:58,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:58,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-11-06 22:17:58,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,189 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 401 transitions. [2023-11-06 22:17:58,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 186 flow [2023-11-06 22:17:58,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:17:58,191 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 60 flow [2023-11-06 22:17:58,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-11-06 22:17:58,193 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2023-11-06 22:17:58,193 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 60 flow [2023-11-06 22:17:58,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:58,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:58,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:17:58,194 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:17:58,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash 175873667, now seen corresponding path program 1 times [2023-11-06 22:17:58,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:58,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121663806] [2023-11-06 22:17:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:58,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121663806] [2023-11-06 22:17:58,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121663806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:58,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:58,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:17:58,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402162801] [2023-11-06 22:17:58,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:58,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:17:58,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:58,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:17:58,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:17:58,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 269 [2023-11-06 22:17:58,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:58,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 269 [2023-11-06 22:17:58,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:58,903 INFO L124 PetriNetUnfolderBase]: 1541/2392 cut-off events. [2023-11-06 22:17:58,904 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2023-11-06 22:17:58,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4889 conditions, 2392 events. 1541/2392 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12263 event pairs, 527 based on Foata normal form. 0/2319 useless extension candidates. Maximal degree in co-relation 4885. Up to 1519 conditions per place. [2023-11-06 22:17:58,924 INFO L140 encePairwiseOnDemand]: 266/269 looper letters, 35 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-11-06 22:17:58,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 166 flow [2023-11-06 22:17:58,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:17:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:17:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-11-06 22:17:58,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857496902106567 [2023-11-06 22:17:58,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-11-06 22:17:58,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-11-06 22:17:58,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:58,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-11-06 22:17:58,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,935 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 60 flow. Second operand 3 states and 392 transitions. [2023-11-06 22:17:58,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 166 flow [2023-11-06 22:17:58,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:17:58,938 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 64 flow [2023-11-06 22:17:58,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-11-06 22:17:58,939 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2023-11-06 22:17:58,940 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 64 flow [2023-11-06 22:17:58,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:58,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:58,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:17:58,941 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:17:58,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1157116963, now seen corresponding path program 1 times [2023-11-06 22:17:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:58,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293320191] [2023-11-06 22:17:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:59,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:59,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293320191] [2023-11-06 22:17:59,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293320191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:59,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:59,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749172005] [2023-11-06 22:17:59,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:59,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:17:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:59,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:17:59,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:17:59,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 269 [2023-11-06 22:17:59,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:59,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:59,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 269 [2023-11-06 22:17:59,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:00,319 INFO L124 PetriNetUnfolderBase]: 1485/2226 cut-off events. [2023-11-06 22:18:00,320 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2023-11-06 22:18:00,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4824 conditions, 2226 events. 1485/2226 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10452 event pairs, 254 based on Foata normal form. 144/2369 useless extension candidates. Maximal degree in co-relation 4819. Up to 1453 conditions per place. [2023-11-06 22:18:00,338 INFO L140 encePairwiseOnDemand]: 262/269 looper letters, 38 selfloop transitions, 4 changer transitions 13/57 dead transitions. [2023-11-06 22:18:00,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 57 transitions, 247 flow [2023-11-06 22:18:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:18:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:18:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2023-11-06 22:18:00,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4256505576208178 [2023-11-06 22:18:00,343 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2023-11-06 22:18:00,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2023-11-06 22:18:00,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:00,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2023-11-06 22:18:00,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:00,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:00,353 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:00,353 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 64 flow. Second operand 6 states and 687 transitions. [2023-11-06 22:18:00,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 57 transitions, 247 flow [2023-11-06 22:18:00,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:18:00,356 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 76 flow [2023-11-06 22:18:00,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2023-11-06 22:18:00,359 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-11-06 22:18:00,359 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 76 flow [2023-11-06 22:18:00,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:00,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:00,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:00,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:18:00,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:00,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash -480320654, now seen corresponding path program 1 times [2023-11-06 22:18:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:00,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629667861] [2023-11-06 22:18:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:00,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:00,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629667861] [2023-11-06 22:18:00,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629667861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:00,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:00,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:18:00,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019550076] [2023-11-06 22:18:00,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:00,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:18:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:00,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:18:00,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:18:01,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 269 [2023-11-06 22:18:01,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:01,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:01,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 269 [2023-11-06 22:18:01,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:01,636 INFO L124 PetriNetUnfolderBase]: 1255/1985 cut-off events. [2023-11-06 22:18:01,637 INFO L125 PetriNetUnfolderBase]: For 335/335 co-relation queries the response was YES. [2023-11-06 22:18:01,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 1985 events. 1255/1985 cut-off events. For 335/335 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9845 event pairs, 180 based on Foata normal form. 80/2065 useless extension candidates. Maximal degree in co-relation 4388. Up to 1225 conditions per place. [2023-11-06 22:18:01,653 INFO L140 encePairwiseOnDemand]: 263/269 looper letters, 38 selfloop transitions, 5 changer transitions 11/56 dead transitions. [2023-11-06 22:18:01,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 258 flow [2023-11-06 22:18:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:18:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:18:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 685 transitions. [2023-11-06 22:18:01,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42441140024783147 [2023-11-06 22:18:01,657 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 685 transitions. [2023-11-06 22:18:01,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 685 transitions. [2023-11-06 22:18:01,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:01,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 685 transitions. [2023-11-06 22:18:01,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:01,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:01,668 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:01,668 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 76 flow. Second operand 6 states and 685 transitions. [2023-11-06 22:18:01,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 258 flow [2023-11-06 22:18:01,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 244 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-06 22:18:01,675 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 93 flow [2023-11-06 22:18:01,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=93, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-11-06 22:18:01,678 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-11-06 22:18:01,678 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 93 flow [2023-11-06 22:18:01,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:01,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:01,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:01,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:18:01,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:01,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash 312078513, now seen corresponding path program 1 times [2023-11-06 22:18:01,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:01,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546835833] [2023-11-06 22:18:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:01,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:01,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546835833] [2023-11-06 22:18:01,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546835833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:01,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:18:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672547971] [2023-11-06 22:18:01,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:01,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:18:01,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:01,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:18:01,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:18:01,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 269 [2023-11-06 22:18:01,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:01,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:01,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 269 [2023-11-06 22:18:01,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:02,288 INFO L124 PetriNetUnfolderBase]: 823/1333 cut-off events. [2023-11-06 22:18:02,288 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2023-11-06 22:18:02,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3175 conditions, 1333 events. 823/1333 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6325 event pairs, 166 based on Foata normal form. 120/1449 useless extension candidates. Maximal degree in co-relation 3166. Up to 774 conditions per place. [2023-11-06 22:18:02,298 INFO L140 encePairwiseOnDemand]: 263/269 looper letters, 39 selfloop transitions, 4 changer transitions 25/70 dead transitions. [2023-11-06 22:18:02,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 349 flow [2023-11-06 22:18:02,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:18:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:18:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-11-06 22:18:02,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728624535315985 [2023-11-06 22:18:02,302 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-11-06 22:18:02,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-11-06 22:18:02,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:02,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-11-06 22:18:02,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:02,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:02,309 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:02,309 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 93 flow. Second operand 5 states and 636 transitions. [2023-11-06 22:18:02,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 349 flow [2023-11-06 22:18:02,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 70 transitions, 337 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-06 22:18:02,313 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 122 flow [2023-11-06 22:18:02,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-11-06 22:18:02,314 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2023-11-06 22:18:02,314 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 122 flow [2023-11-06 22:18:02,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:02,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:02,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:02,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:18:02,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:02,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash -48081653, now seen corresponding path program 1 times [2023-11-06 22:18:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757502910] [2023-11-06 22:18:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:02,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:02,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757502910] [2023-11-06 22:18:02,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757502910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:02,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:02,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:18:02,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42038170] [2023-11-06 22:18:02,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:02,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:18:02,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:02,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:18:02,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:18:02,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 269 [2023-11-06 22:18:02,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:02,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:02,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 269 [2023-11-06 22:18:02,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:02,808 INFO L124 PetriNetUnfolderBase]: 376/669 cut-off events. [2023-11-06 22:18:02,809 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-11-06 22:18:02,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 669 events. 376/669 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2863 event pairs, 111 based on Foata normal form. 60/725 useless extension candidates. Maximal degree in co-relation 1920. Up to 203 conditions per place. [2023-11-06 22:18:02,814 INFO L140 encePairwiseOnDemand]: 263/269 looper letters, 50 selfloop transitions, 7 changer transitions 25/84 dead transitions. [2023-11-06 22:18:02,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 470 flow [2023-11-06 22:18:02,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:18:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:18:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions. [2023-11-06 22:18:02,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47335811648079307 [2023-11-06 22:18:02,819 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 764 transitions. [2023-11-06 22:18:02,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions. [2023-11-06 22:18:02,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:02,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions. [2023-11-06 22:18:02,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:02,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:02,826 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:02,826 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 122 flow. Second operand 6 states and 764 transitions. [2023-11-06 22:18:02,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 470 flow [2023-11-06 22:18:02,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 464 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:18:02,832 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 172 flow [2023-11-06 22:18:02,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2023-11-06 22:18:02,833 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-11-06 22:18:02,833 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 172 flow [2023-11-06 22:18:02,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:02,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:02,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:02,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:18:02,834 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:02,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:02,835 INFO L85 PathProgramCache]: Analyzing trace with hash 144869073, now seen corresponding path program 1 times [2023-11-06 22:18:02,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:02,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546086399] [2023-11-06 22:18:02,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:02,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:03,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546086399] [2023-11-06 22:18:03,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546086399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:03,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:03,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:18:03,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757849171] [2023-11-06 22:18:03,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:03,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:18:03,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:03,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:18:03,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:18:03,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 269 [2023-11-06 22:18:03,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:03,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:03,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 269 [2023-11-06 22:18:03,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:03,392 INFO L124 PetriNetUnfolderBase]: 246/444 cut-off events. [2023-11-06 22:18:03,392 INFO L125 PetriNetUnfolderBase]: For 490/490 co-relation queries the response was YES. [2023-11-06 22:18:03,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 444 events. 246/444 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1791 event pairs, 106 based on Foata normal form. 13/453 useless extension candidates. Maximal degree in co-relation 1343. Up to 203 conditions per place. [2023-11-06 22:18:03,397 INFO L140 encePairwiseOnDemand]: 263/269 looper letters, 47 selfloop transitions, 10 changer transitions 13/72 dead transitions. [2023-11-06 22:18:03,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 452 flow [2023-11-06 22:18:03,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:18:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:18:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2023-11-06 22:18:03,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4599044078597982 [2023-11-06 22:18:03,403 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2023-11-06 22:18:03,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2023-11-06 22:18:03,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:03,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2023-11-06 22:18:03,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:03,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:03,415 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:03,415 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 172 flow. Second operand 7 states and 866 transitions. [2023-11-06 22:18:03,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 452 flow [2023-11-06 22:18:03,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 386 flow, removed 18 selfloop flow, removed 7 redundant places. [2023-11-06 22:18:03,422 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 158 flow [2023-11-06 22:18:03,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=158, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2023-11-06 22:18:03,425 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-11-06 22:18:03,425 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 158 flow [2023-11-06 22:18:03,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:03,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:03,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:03,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:18:03,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:03,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:03,427 INFO L85 PathProgramCache]: Analyzing trace with hash -791915175, now seen corresponding path program 1 times [2023-11-06 22:18:03,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:03,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334159665] [2023-11-06 22:18:03,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:04,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:04,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334159665] [2023-11-06 22:18:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334159665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:04,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:04,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:18:04,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959815798] [2023-11-06 22:18:04,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:04,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:18:04,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:04,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:18:04,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:18:04,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 269 [2023-11-06 22:18:04,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 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 22:18:04,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:04,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 269 [2023-11-06 22:18:04,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:05,701 INFO L124 PetriNetUnfolderBase]: 668/1179 cut-off events. [2023-11-06 22:18:05,701 INFO L125 PetriNetUnfolderBase]: For 1274/1274 co-relation queries the response was YES. [2023-11-06 22:18:05,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3457 conditions, 1179 events. 668/1179 cut-off events. For 1274/1274 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5646 event pairs, 71 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 3446. Up to 289 conditions per place. [2023-11-06 22:18:05,721 INFO L140 encePairwiseOnDemand]: 256/269 looper letters, 125 selfloop transitions, 32 changer transitions 0/157 dead transitions. [2023-11-06 22:18:05,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 157 transitions, 1011 flow [2023-11-06 22:18:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:18:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:18:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1079 transitions. [2023-11-06 22:18:05,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44568360181743083 [2023-11-06 22:18:05,727 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1079 transitions. [2023-11-06 22:18:05,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1079 transitions. [2023-11-06 22:18:05,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:05,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1079 transitions. [2023-11-06 22:18:05,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:05,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:05,741 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:05,741 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 158 flow. Second operand 9 states and 1079 transitions. [2023-11-06 22:18:05,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 157 transitions, 1011 flow [2023-11-06 22:18:05,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 157 transitions, 861 flow, removed 48 selfloop flow, removed 6 redundant places. [2023-11-06 22:18:05,759 INFO L231 Difference]: Finished difference. Result has 58 places, 64 transitions, 379 flow [2023-11-06 22:18:05,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=379, PETRI_PLACES=58, PETRI_TRANSITIONS=64} [2023-11-06 22:18:05,760 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2023-11-06 22:18:05,761 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 64 transitions, 379 flow [2023-11-06 22:18:05,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 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 22:18:05,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:05,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:05,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:18:05,762 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:05,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:05,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1326074999, now seen corresponding path program 2 times [2023-11-06 22:18:05,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:05,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608583397] [2023-11-06 22:18:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:05,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:06,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:06,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608583397] [2023-11-06 22:18:06,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608583397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:06,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:18:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110141988] [2023-11-06 22:18:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:06,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:18:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:06,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:18:06,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:18:06,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 269 [2023-11-06 22:18:06,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 64 transitions, 379 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:06,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:06,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 269 [2023-11-06 22:18:06,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:06,914 INFO L124 PetriNetUnfolderBase]: 868/1567 cut-off events. [2023-11-06 22:18:06,914 INFO L125 PetriNetUnfolderBase]: For 3437/3466 co-relation queries the response was YES. [2023-11-06 22:18:06,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6337 conditions, 1567 events. 868/1567 cut-off events. For 3437/3466 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8252 event pairs, 130 based on Foata normal form. 27/1587 useless extension candidates. Maximal degree in co-relation 6322. Up to 675 conditions per place. [2023-11-06 22:18:06,931 INFO L140 encePairwiseOnDemand]: 261/269 looper letters, 126 selfloop transitions, 45 changer transitions 0/174 dead transitions. [2023-11-06 22:18:06,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 174 transitions, 1418 flow [2023-11-06 22:18:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:18:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:18:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1089 transitions. [2023-11-06 22:18:06,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44981412639405205 [2023-11-06 22:18:06,937 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1089 transitions. [2023-11-06 22:18:06,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1089 transitions. [2023-11-06 22:18:06,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:06,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1089 transitions. [2023-11-06 22:18:06,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.0) internal successors, (1089), 9 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:06,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:06,948 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:06,948 INFO L175 Difference]: Start difference. First operand has 58 places, 64 transitions, 379 flow. Second operand 9 states and 1089 transitions. [2023-11-06 22:18:06,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 174 transitions, 1418 flow [2023-11-06 22:18:06,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 174 transitions, 1418 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:18:06,970 INFO L231 Difference]: Finished difference. Result has 70 places, 112 transitions, 868 flow [2023-11-06 22:18:06,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=868, PETRI_PLACES=70, PETRI_TRANSITIONS=112} [2023-11-06 22:18:06,972 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-11-06 22:18:06,972 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 112 transitions, 868 flow [2023-11-06 22:18:06,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:06,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:06,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:06,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:18:06,973 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:06,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash -425665617, now seen corresponding path program 3 times [2023-11-06 22:18:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402902715] [2023-11-06 22:18:06,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:08,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:08,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402902715] [2023-11-06 22:18:08,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402902715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:08,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:08,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:18:08,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850610494] [2023-11-06 22:18:08,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:08,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:18:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:18:08,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:18:08,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 269 [2023-11-06 22:18:08,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 112 transitions, 868 flow. Second operand has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 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 22:18:08,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:08,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 269 [2023-11-06 22:18:08,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:09,304 INFO L124 PetriNetUnfolderBase]: 1111/2005 cut-off events. [2023-11-06 22:18:09,305 INFO L125 PetriNetUnfolderBase]: For 5141/5141 co-relation queries the response was YES. [2023-11-06 22:18:09,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8638 conditions, 2005 events. 1111/2005 cut-off events. For 5141/5141 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11219 event pairs, 120 based on Foata normal form. 1/2006 useless extension candidates. Maximal degree in co-relation 8618. Up to 729 conditions per place. [2023-11-06 22:18:09,326 INFO L140 encePairwiseOnDemand]: 256/269 looper letters, 137 selfloop transitions, 87 changer transitions 0/224 dead transitions. [2023-11-06 22:18:09,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 224 transitions, 2064 flow [2023-11-06 22:18:09,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:18:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:18:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1068 transitions. [2023-11-06 22:18:09,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44114002478314746 [2023-11-06 22:18:09,332 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1068 transitions. [2023-11-06 22:18:09,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1068 transitions. [2023-11-06 22:18:09,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:09,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1068 transitions. [2023-11-06 22:18:09,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.66666666666667) internal successors, (1068), 9 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:09,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:09,344 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:09,344 INFO L175 Difference]: Start difference. First operand has 70 places, 112 transitions, 868 flow. Second operand 9 states and 1068 transitions. [2023-11-06 22:18:09,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 224 transitions, 2064 flow [2023-11-06 22:18:09,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 224 transitions, 2052 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-11-06 22:18:09,426 INFO L231 Difference]: Finished difference. Result has 84 places, 151 transitions, 1520 flow [2023-11-06 22:18:09,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1520, PETRI_PLACES=84, PETRI_TRANSITIONS=151} [2023-11-06 22:18:09,427 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2023-11-06 22:18:09,427 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 151 transitions, 1520 flow [2023-11-06 22:18:09,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 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 22:18:09,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:09,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:09,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:18:09,428 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:09,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:09,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2118708241, now seen corresponding path program 4 times [2023-11-06 22:18:09,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:09,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368311432] [2023-11-06 22:18:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:09,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:18:09,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:18:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:18:09,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:18:09,585 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:18:09,586 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:18:09,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:18:09,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:18:09,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:18:09,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:18:09,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:18:09,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:18:09,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:18:09,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:18:09,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:18:09,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:18:09,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:18:09,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:18:09,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:18:09,594 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:09,600 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:18:09,601 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:18:09,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:18:09 BasicIcfg [2023-11-06 22:18:09,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:18:09,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:18:09,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:18:09,725 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:18:09,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:49" (3/4) ... [2023-11-06 22:18:09,728 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:18:09,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:18:09,730 INFO L158 Benchmark]: Toolchain (without parser) took 21891.90ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 134.4MB in the beginning and 204.2MB in the end (delta: -69.8MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2023-11-06 22:18:09,730 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 119.5MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:18:09,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 783.02ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 111.3MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:18:09,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.02ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 108.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:18:09,731 INFO L158 Benchmark]: Boogie Preprocessor took 81.13ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:18:09,732 INFO L158 Benchmark]: RCFGBuilder took 1131.56ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 126.2MB in the end (delta: -19.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-06 22:18:09,733 INFO L158 Benchmark]: TraceAbstraction took 19769.79ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 126.2MB in the beginning and 204.2MB in the end (delta: -78.0MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2023-11-06 22:18:09,733 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 295.7MB. Free memory is still 204.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:18:09,735 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 119.5MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 783.02ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 111.3MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.02ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 108.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.13ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1131.56ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 126.2MB in the end (delta: -19.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19769.79ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 126.2MB in the beginning and 204.2MB in the end (delta: -78.0MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 295.7MB. Free memory is still 204.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: 5.8s, 138 PlacesBefore, 43 PlacesAfterwards, 131 TransitionsBefore, 34 TransitionsAfterwards, 3032 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 135 TotalNumberOfCompositions, 8463 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3547, independent: 3324, independent conditional: 0, independent unconditional: 3324, dependent: 223, dependent conditional: 0, dependent unconditional: 223, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1689, independent: 1641, independent conditional: 0, independent unconditional: 1641, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3547, independent: 1683, independent conditional: 0, independent unconditional: 1683, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 1689, unknown conditional: 0, unknown unconditional: 1689] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [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; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool b$flush_delayed; [L723] 0 int b$mem_tmp; [L724] 0 _Bool b$r_buff0_thd0; [L725] 0 _Bool b$r_buff0_thd1; [L726] 0 _Bool b$r_buff0_thd2; [L727] 0 _Bool b$r_buff0_thd3; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$read_delayed; [L733] 0 int *b$read_delayed_var; [L734] 0 int b$w_buff0; [L735] 0 _Bool b$w_buff0_used; [L736] 0 int b$w_buff1; [L737] 0 _Bool b$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t873; [L854] FCALL, FORK 0 pthread_create(&t873, ((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, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t873, ((void *)0), P0, ((void *)0))=-2, t873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t874; [L856] FCALL, FORK 0 pthread_create(&t874, ((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, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t874, ((void *)0), P1, ((void *)0))=-1, t873={5:0}, t874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t875; [L858] FCALL, FORK 0 pthread_create(&t875, ((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, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t875, ((void *)0), P2, ((void *)0))=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] 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", "mix033_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 858]: 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: 854]: 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, 164 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: 19.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 764 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 617 mSDsluCounter, 289 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 243 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2302 IncrementalHoareTripleChecker+Invalid, 2387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 46 mSDtfsCounter, 2302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1520occurred in iteration=11, InterpolantAutomatonStates: 65, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 1789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:18:09,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/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_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/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_a1926e05-8471-483a-9717-41492d8da13a/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 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:18:12,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:18:12,749 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:18:12,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:18:12,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:18:12,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:18:12,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:18:12,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:18:12,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:18:12,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:18:12,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:18:12,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:18:12,815 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:18:12,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:18:12,818 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:18:12,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:18:12,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:18:12,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:18:12,820 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:18:12,821 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:18:12,821 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:18:12,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:18:12,822 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:18:12,823 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:18:12,823 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:18:12,824 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:18:12,824 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:18:12,824 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:18:12,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:18:12,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:18:12,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:18:12,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:18:12,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:18:12,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:18:12,829 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:18:12,829 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:18:12,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:18:12,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:18:12,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:18:12,831 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:18:12,831 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:18:12,832 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_a1926e05-8471-483a-9717-41492d8da13a/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_a1926e05-8471-483a-9717-41492d8da13a/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 -> 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 [2023-11-06 22:18:13,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:18:13,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:18:13,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:18:13,292 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:18:13,292 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:18:13,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:18:16,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:18:16,914 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:18:16,914 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:18:16,952 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/data/588c633b7/7a92e0cc32d44842931ccde1a0a269a4/FLAG27a17438e [2023-11-06 22:18:16,972 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/data/588c633b7/7a92e0cc32d44842931ccde1a0a269a4 [2023-11-06 22:18:16,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:18:16,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:18:16,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:18:16,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:18:16,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:18:16,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:18:16" (1/1) ... [2023-11-06 22:18:16,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67438c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:16, skipping insertion in model container [2023-11-06 22:18:16,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:18:16" (1/1) ... [2023-11-06 22:18:17,071 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:18:17,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:18:17,603 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:18:17,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:18:17,747 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:18:17,747 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:18:17,757 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:18:17,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17 WrapperNode [2023-11-06 22:18:17,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:18:17,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:18:17,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:18:17,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:18:17,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (1/1) ... [2023-11-06 22:18:17,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (1/1) ... [2023-11-06 22:18:17,832 INFO L138 Inliner]: procedures = 179, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2023-11-06 22:18:17,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:18:17,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:18:17,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:18:17,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:18:17,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (1/1) ... [2023-11-06 22:18:17,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (1/1) ... [2023-11-06 22:18:17,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (1/1) ... [2023-11-06 22:18:17,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (1/1) ... [2023-11-06 22:18:17,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (1/1) ... [2023-11-06 22:18:17,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (1/1) ... [2023-11-06 22:18:17,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (1/1) ... [2023-11-06 22:18:17,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (1/1) ... [2023-11-06 22:18:17,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:18:17,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:18:17,886 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:18:17,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:18:17,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (1/1) ... [2023-11-06 22:18:17,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:18:17,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:18:17,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:18:17,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:18:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:18:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:18:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:18:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:18:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:18:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:18:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:18:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:18:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:18:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:18:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:18:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:18:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:18:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:18:18,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:18:18,012 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:18:18,212 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:18:18,215 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:18:18,691 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:18:18,911 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:18:18,911 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:18:18,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:18 BoogieIcfgContainer [2023-11-06 22:18:18,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:18:18,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:18:18,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:18:18,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:18:18,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:18:16" (1/3) ... [2023-11-06 22:18:18,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743de6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:18, skipping insertion in model container [2023-11-06 22:18:18,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:17" (2/3) ... [2023-11-06 22:18:18,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743de6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:18, skipping insertion in model container [2023-11-06 22:18:18,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:18" (3/3) ... [2023-11-06 22:18:18,930 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:18:18,954 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:18:18,954 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:18:18,955 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:18:19,058 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:18:19,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 135 transitions, 282 flow [2023-11-06 22:18:19,231 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2023-11-06 22:18:19,232 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:18:19,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 3/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-06 22:18:19,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 135 transitions, 282 flow [2023-11-06 22:18:19,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 132 transitions, 273 flow [2023-11-06 22:18:19,255 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:18:19,272 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 132 transitions, 273 flow [2023-11-06 22:18:19,277 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 132 transitions, 273 flow [2023-11-06 22:18:19,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 132 transitions, 273 flow [2023-11-06 22:18:19,335 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2023-11-06 22:18:19,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:18:19,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 3/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-06 22:18:19,344 INFO L119 LiptonReduction]: Number of co-enabled transitions 3032 [2023-11-06 22:18:29,617 INFO L134 LiptonReduction]: Checked pairs total: 7727 [2023-11-06 22:18:29,617 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-11-06 22:18:29,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:18:29,640 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;@397e8a55, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:18:29,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:18:29,642 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:18:29,642 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:18:29,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:18:29,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:29,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:18:29,644 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:29,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:29,649 INFO L85 PathProgramCache]: Analyzing trace with hash 599, now seen corresponding path program 1 times [2023-11-06 22:18:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:29,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766603636] [2023-11-06 22:18:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:29,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:29,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:29,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:18:29,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:18:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:29,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:18:29,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:29,790 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:29,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:29,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766603636] [2023-11-06 22:18:29,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766603636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:29,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:29,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:18:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005916373] [2023-11-06 22:18:29,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:29,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:18:29,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:29,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:18:29,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:18:29,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 272 [2023-11-06 22:18:29,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:29,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:29,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 272 [2023-11-06 22:18:29,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:30,767 INFO L124 PetriNetUnfolderBase]: 2494/3619 cut-off events. [2023-11-06 22:18:30,768 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-11-06 22:18:30,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7291 conditions, 3619 events. 2494/3619 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17273 event pairs, 2494 based on Foata normal form. 0/3085 useless extension candidates. Maximal degree in co-relation 7280. Up to 3606 conditions per place. [2023-11-06 22:18:30,809 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 25 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-11-06 22:18:30,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 113 flow [2023-11-06 22:18:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:18:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:18:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 274 transitions. [2023-11-06 22:18:30,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036764705882353 [2023-11-06 22:18:30,835 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 274 transitions. [2023-11-06 22:18:30,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 274 transitions. [2023-11-06 22:18:30,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:30,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 274 transitions. [2023-11-06 22:18:30,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 137.0) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:30,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:30,856 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:30,857 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 77 flow. Second operand 2 states and 274 transitions. [2023-11-06 22:18:30,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 113 flow [2023-11-06 22:18:30,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:18:30,864 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2023-11-06 22:18:30,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-11-06 22:18:30,871 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2023-11-06 22:18:30,872 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2023-11-06 22:18:30,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:30,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:30,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:18:30,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/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 22:18:31,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:31,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:31,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash 590412, now seen corresponding path program 1 times [2023-11-06 22:18:31,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:31,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691012702] [2023-11-06 22:18:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:31,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:31,089 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:18:31,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:18:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:31,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:18:31,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:31,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:31,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:31,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691012702] [2023-11-06 22:18:31,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691012702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:31,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:31,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:18:31,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284899555] [2023-11-06 22:18:31,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:31,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:18:31,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:31,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:18:31,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:18:31,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 272 [2023-11-06 22:18:31,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:31,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:31,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 272 [2023-11-06 22:18:31,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:31,855 INFO L124 PetriNetUnfolderBase]: 1951/2977 cut-off events. [2023-11-06 22:18:31,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:18:31,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5870 conditions, 2977 events. 1951/2977 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15279 event pairs, 498 based on Foata normal form. 0/2735 useless extension candidates. Maximal degree in co-relation 5867. Up to 2296 conditions per place. [2023-11-06 22:18:31,883 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 39 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-11-06 22:18:31,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 186 flow [2023-11-06 22:18:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:18:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:18:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-11-06 22:18:31,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950980392156863 [2023-11-06 22:18:31,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-11-06 22:18:31,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-11-06 22:18:31,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:31,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-11-06 22:18:31,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:31,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:31,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:31,909 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 404 transitions. [2023-11-06 22:18:31,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 186 flow [2023-11-06 22:18:31,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:18:31,912 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 60 flow [2023-11-06 22:18:31,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-11-06 22:18:31,913 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2023-11-06 22:18:31,913 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 60 flow [2023-11-06 22:18:31,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:31,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:31,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:31,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/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 22:18:32,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:32,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:32,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1621348632, now seen corresponding path program 1 times [2023-11-06 22:18:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:32,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710108285] [2023-11-06 22:18:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:32,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:32,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:32,132 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:18:32,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:18:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:32,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:18:32,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:32,314 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:32,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:32,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710108285] [2023-11-06 22:18:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710108285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:32,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:32,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:18:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419468365] [2023-11-06 22:18:32,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:32,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:18:32,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:32,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:18:32,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:18:32,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-11-06 22:18:32,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:32,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:32,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-11-06 22:18:32,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:32,853 INFO L124 PetriNetUnfolderBase]: 991/1590 cut-off events. [2023-11-06 22:18:32,853 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-11-06 22:18:32,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 1590 events. 991/1590 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7746 event pairs, 184 based on Foata normal form. 120/1646 useless extension candidates. Maximal degree in co-relation 3343. Up to 1032 conditions per place. [2023-11-06 22:18:32,865 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 35 selfloop transitions, 4 changer transitions 25/66 dead transitions. [2023-11-06 22:18:32,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 66 transitions, 280 flow [2023-11-06 22:18:32,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:18:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:18:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-11-06 22:18:32,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713235294117647 [2023-11-06 22:18:32,870 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-11-06 22:18:32,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-11-06 22:18:32,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:32,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-11-06 22:18:32,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:32,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:32,879 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:32,880 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 60 flow. Second operand 5 states and 641 transitions. [2023-11-06 22:18:32,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 66 transitions, 280 flow [2023-11-06 22:18:32,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 66 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:18:32,883 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 92 flow [2023-11-06 22:18:32,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-06 22:18:32,886 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-06 22:18:32,886 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 92 flow [2023-11-06 22:18:32,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:32,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:32,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:32,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/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)] Ended with exit code 0 [2023-11-06 22:18:33,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:33,100 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:33,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash 486373568, now seen corresponding path program 1 times [2023-11-06 22:18:33,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:33,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139843340] [2023-11-06 22:18:33,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:33,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:33,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:33,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:18:33,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:18:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:33,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:18:33,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:33,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:33,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:33,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139843340] [2023-11-06 22:18:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139843340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:33,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:33,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:18:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131103204] [2023-11-06 22:18:33,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:33,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:18:33,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:18:33,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:18:33,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-11-06 22:18:33,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:33,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:33,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-11-06 22:18:33,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:33,704 INFO L124 PetriNetUnfolderBase]: 388/693 cut-off events. [2023-11-06 22:18:33,704 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2023-11-06 22:18:33,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 693 events. 388/693 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3013 event pairs, 117 based on Foata normal form. 60/736 useless extension candidates. Maximal degree in co-relation 1784. Up to 203 conditions per place. [2023-11-06 22:18:33,710 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 46 selfloop transitions, 7 changer transitions 25/80 dead transitions. [2023-11-06 22:18:33,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 80 transitions, 396 flow [2023-11-06 22:18:33,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:18:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:18:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2023-11-06 22:18:33,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47181372549019607 [2023-11-06 22:18:33,714 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2023-11-06 22:18:33,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2023-11-06 22:18:33,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:33,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2023-11-06 22:18:33,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:33,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:33,724 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:33,724 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 92 flow. Second operand 6 states and 770 transitions. [2023-11-06 22:18:33,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 80 transitions, 396 flow [2023-11-06 22:18:33,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 80 transitions, 390 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:18:33,729 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 142 flow [2023-11-06 22:18:33,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=142, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-06 22:18:33,731 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-11-06 22:18:33,731 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 142 flow [2023-11-06 22:18:33,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:33,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:33,732 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 22:18:33,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:33,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:33,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:33,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash 763092378, now seen corresponding path program 1 times [2023-11-06 22:18:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:33,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049926159] [2023-11-06 22:18:33,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:33,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:33,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:33,947 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:18:33,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:18:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:34,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:18:34,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:34,160 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:34,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:34,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049926159] [2023-11-06 22:18:34,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049926159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:34,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:34,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:18:34,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121167426] [2023-11-06 22:18:34,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:34,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:18:34,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:34,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:18:34,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:18:34,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-11-06 22:18:34,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:34,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:34,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-11-06 22:18:34,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:34,650 INFO L124 PetriNetUnfolderBase]: 246/444 cut-off events. [2023-11-06 22:18:34,650 INFO L125 PetriNetUnfolderBase]: For 389/389 co-relation queries the response was YES. [2023-11-06 22:18:34,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 444 events. 246/444 cut-off events. For 389/389 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1792 event pairs, 112 based on Foata normal form. 13/452 useless extension candidates. Maximal degree in co-relation 1220. Up to 203 conditions per place. [2023-11-06 22:18:34,655 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 43 selfloop transitions, 10 changer transitions 13/68 dead transitions. [2023-11-06 22:18:34,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 382 flow [2023-11-06 22:18:34,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:18:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:18:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2023-11-06 22:18:34,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585084033613445 [2023-11-06 22:18:34,660 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2023-11-06 22:18:34,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2023-11-06 22:18:34,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:34,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2023-11-06 22:18:34,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:34,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:34,671 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:34,671 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 142 flow. Second operand 7 states and 873 transitions. [2023-11-06 22:18:34,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 382 flow [2023-11-06 22:18:34,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 346 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-06 22:18:34,678 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 144 flow [2023-11-06 22:18:34,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-11-06 22:18:34,679 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2023-11-06 22:18:34,679 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 144 flow [2023-11-06 22:18:34,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:34,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:34,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:34,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:34,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:34,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:34,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash 959341808, now seen corresponding path program 1 times [2023-11-06 22:18:34,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:34,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486534530] [2023-11-06 22:18:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:34,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:34,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:34,910 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:18:34,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:18:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:35,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:18:35,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:35,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:35,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:35,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486534530] [2023-11-06 22:18:35,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486534530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:35,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:35,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:18:35,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307610990] [2023-11-06 22:18:35,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:35,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:18:35,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:35,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:18:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:18:35,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-11-06 22:18:35,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 144 flow. Second operand has 7 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:35,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:35,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-11-06 22:18:35,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:36,007 INFO L124 PetriNetUnfolderBase]: 264/501 cut-off events. [2023-11-06 22:18:36,007 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2023-11-06 22:18:36,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 501 events. 264/501 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2162 event pairs, 27 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1382. Up to 213 conditions per place. [2023-11-06 22:18:36,013 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 70 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2023-11-06 22:18:36,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 78 transitions, 514 flow [2023-11-06 22:18:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:18:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:18:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2023-11-06 22:18:36,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45483193277310924 [2023-11-06 22:18:36,017 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2023-11-06 22:18:36,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2023-11-06 22:18:36,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:36,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2023-11-06 22:18:36,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:36,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:36,026 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:36,026 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 144 flow. Second operand 7 states and 866 transitions. [2023-11-06 22:18:36,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 78 transitions, 514 flow [2023-11-06 22:18:36,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 428 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-06 22:18:36,032 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 130 flow [2023-11-06 22:18:36,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-11-06 22:18:36,033 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2023-11-06 22:18:36,033 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 130 flow [2023-11-06 22:18:36,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:36,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:36,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:36,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/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)] Ended with exit code 0 [2023-11-06 22:18:36,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:36,247 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:36,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:36,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1826319646, now seen corresponding path program 2 times [2023-11-06 22:18:36,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:36,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659064897] [2023-11-06 22:18:36,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:18:36,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:36,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:36,250 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:18:36,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:18:36,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:18:36,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:18:36,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:18:36,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:36,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:36,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:36,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659064897] [2023-11-06 22:18:36,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659064897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:36,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:36,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:18:36,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278597602] [2023-11-06 22:18:36,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:36,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:18:36,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:36,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:18:36,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:18:36,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 272 [2023-11-06 22:18:36,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:36,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:36,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 272 [2023-11-06 22:18:36,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:36,696 INFO L124 PetriNetUnfolderBase]: 479/877 cut-off events. [2023-11-06 22:18:36,696 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2023-11-06 22:18:36,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 877 events. 479/877 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4331 event pairs, 186 based on Foata normal form. 1/873 useless extension candidates. Maximal degree in co-relation 2464. Up to 488 conditions per place. [2023-11-06 22:18:36,706 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 57 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-06 22:18:36,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 356 flow [2023-11-06 22:18:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:18:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:18:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-11-06 22:18:36,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4877450980392157 [2023-11-06 22:18:36,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-11-06 22:18:36,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-11-06 22:18:36,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:36,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-11-06 22:18:36,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:36,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:36,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:36,716 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 130 flow. Second operand 3 states and 398 transitions. [2023-11-06 22:18:36,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 356 flow [2023-11-06 22:18:36,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 348 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:18:36,727 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 136 flow [2023-11-06 22:18:36,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-11-06 22:18:36,729 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2023-11-06 22:18:36,729 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 136 flow [2023-11-06 22:18:36,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:36,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:36,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:36,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/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 22:18:36,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:36,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:36,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1714867500, now seen corresponding path program 3 times [2023-11-06 22:18:36,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:36,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069731622] [2023-11-06 22:18:36,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:18:36,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:36,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:36,948 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:18:36,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:18:37,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:18:37,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:18:37,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:18:37,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:37,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:37,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:37,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069731622] [2023-11-06 22:18:37,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069731622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:37,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:37,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:18:37,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454392016] [2023-11-06 22:18:37,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:37,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:18:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:37,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:18:37,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:18:37,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 272 [2023-11-06 22:18:37,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:37,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:37,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 272 [2023-11-06 22:18:37,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:37,537 INFO L124 PetriNetUnfolderBase]: 675/1240 cut-off events. [2023-11-06 22:18:37,538 INFO L125 PetriNetUnfolderBase]: For 895/896 co-relation queries the response was YES. [2023-11-06 22:18:37,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3639 conditions, 1240 events. 675/1240 cut-off events. For 895/896 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6354 event pairs, 178 based on Foata normal form. 1/1240 useless extension candidates. Maximal degree in co-relation 3629. Up to 601 conditions per place. [2023-11-06 22:18:37,550 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 63 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-06 22:18:37,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 401 flow [2023-11-06 22:18:37,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:18:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:18:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-11-06 22:18:37,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724264705882353 [2023-11-06 22:18:37,554 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-11-06 22:18:37,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-11-06 22:18:37,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:37,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-11-06 22:18:37,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 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 22:18:37,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:37,561 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:37,562 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 136 flow. Second operand 4 states and 514 transitions. [2023-11-06 22:18:37,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 401 flow [2023-11-06 22:18:37,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:18:37,569 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 147 flow [2023-11-06 22:18:37,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2023-11-06 22:18:37,573 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-11-06 22:18:37,576 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 147 flow [2023-11-06 22:18:37,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:37,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:37,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:37,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/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 22:18:37,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:37,790 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:18:37,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:37,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2065236872, now seen corresponding path program 4 times [2023-11-06 22:18:37,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:37,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300027096] [2023-11-06 22:18:37,795 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:18:37,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:37,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:37,797 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:18:37,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:18:37,964 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:18:37,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:18:37,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:18:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:18:38,181 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:18:38,182 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:18:38,183 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:18:38,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:18:38,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:18:38,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:18:38,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:18:38,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:18:38,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:18:38,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:18:38,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:18:38,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:18:38,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:18:38,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:18:38,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:18:38,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:38,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:38,401 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-11-06 22:18:38,408 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:18:38,409 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:18:38,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:18:38 BasicIcfg [2023-11-06 22:18:38,492 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:18:38,493 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:18:38,493 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:18:38,493 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:18:38,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:18" (3/4) ... [2023-11-06 22:18:38,495 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:18:38,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:18:38,497 INFO L158 Benchmark]: Toolchain (without parser) took 21516.51ms. Allocated memory was 94.4MB in the beginning and 224.4MB in the end (delta: 130.0MB). Free memory was 68.8MB in the beginning and 62.4MB in the end (delta: 6.3MB). Peak memory consumption was 136.6MB. Max. memory is 16.1GB. [2023-11-06 22:18:38,497 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 65.0MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:18:38,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 773.51ms. Allocated memory is still 94.4MB. Free memory was 68.5MB in the beginning and 65.6MB in the end (delta: 2.9MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2023-11-06 22:18:38,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.22ms. Allocated memory is still 94.4MB. Free memory was 65.6MB in the beginning and 63.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:18:38,499 INFO L158 Benchmark]: Boogie Preprocessor took 52.07ms. Allocated memory is still 94.4MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:18:38,499 INFO L158 Benchmark]: RCFGBuilder took 1030.22ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 50.7MB in the end (delta: 10.0MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2023-11-06 22:18:38,499 INFO L158 Benchmark]: TraceAbstraction took 19573.51ms. Allocated memory was 94.4MB in the beginning and 224.4MB in the end (delta: 130.0MB). Free memory was 50.2MB in the beginning and 63.5MB in the end (delta: -13.3MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. [2023-11-06 22:18:38,500 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 224.4MB. Free memory was 63.5MB in the beginning and 62.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:18:38,502 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.32ms. Allocated memory is still 65.0MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 773.51ms. Allocated memory is still 94.4MB. Free memory was 68.5MB in the beginning and 65.6MB in the end (delta: 2.9MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.22ms. Allocated memory is still 94.4MB. Free memory was 65.6MB in the beginning and 63.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.07ms. Allocated memory is still 94.4MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1030.22ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 50.7MB in the end (delta: 10.0MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19573.51ms. Allocated memory was 94.4MB in the beginning and 224.4MB in the end (delta: 130.0MB). Free memory was 50.2MB in the beginning and 63.5MB in the end (delta: -13.3MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 224.4MB. Free memory was 63.5MB in the beginning and 62.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.3s, 139 PlacesBefore, 43 PlacesAfterwards, 132 TransitionsBefore, 34 TransitionsAfterwards, 3032 CoEnabledTransitionPairs, 6 FixpointIterations, 55 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 137 TotalNumberOfCompositions, 7727 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3480, independent: 3290, independent conditional: 0, independent unconditional: 3290, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1687, independent: 1642, independent conditional: 0, independent unconditional: 1642, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3480, independent: 1648, independent conditional: 0, independent unconditional: 1648, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 1687, unknown conditional: 0, unknown unconditional: 1687] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, 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; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool b$flush_delayed; [L723] 0 int b$mem_tmp; [L724] 0 _Bool b$r_buff0_thd0; [L725] 0 _Bool b$r_buff0_thd1; [L726] 0 _Bool b$r_buff0_thd2; [L727] 0 _Bool b$r_buff0_thd3; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$read_delayed; [L733] 0 int *b$read_delayed_var; [L734] 0 int b$w_buff0; [L735] 0 _Bool b$w_buff0_used; [L736] 0 int b$w_buff1; [L737] 0 _Bool b$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t873; [L854] FCALL, FORK 0 pthread_create(&t873, ((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, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t873, ((void *)0), P0, ((void *)0))=0, t873={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t874; [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t874, ((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, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t874, ((void *)0), P1, ((void *)0))=1, t873={-6:0}, t874={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t875; [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t875, ((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, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t875, ((void *)0), P2, ((void *)0))=2, t873={-6:0}, t874={-10:0}, t875={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L806] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873={-6:0}, t874={-10:0}, t875={-2:0}, weak$$choice2=0, x=2, y=1, z=1] [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] 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", "mix033_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 858]: 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: 854]: 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, 165 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: 19.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1025 IncrementalHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 13 mSDtfsCounter, 1025 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=8, InterpolantAutomatonStates: 37, 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.8s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 461 SizeOfPredicates, 7 NumberOfNonLiveVariables, 947 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:18:38,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1926e05-8471-483a-9717-41492d8da13a/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