./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff 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_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:58:50,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:58:50,912 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:58:50,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:58:50,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:58:50,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:58:50,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:58:50,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:58:50,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:58:50,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:58:50,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:58:50,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:58:50,949 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:58:50,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:58:50,950 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:58:50,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:58:50,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:58:50,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:58:50,953 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:58:50,953 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:58:50,954 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:58:50,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:58:50,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:58:50,956 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:58:50,956 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:58:50,957 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:58:50,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:58:50,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:58:50,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:58:50,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:58:50,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:58:50,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:58:50,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:58:50,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:58:50,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:58:50,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:58:50,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:58:50,964 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:58:50,964 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_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/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_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a [2023-11-19 07:58:51,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:58:51,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:58:51,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:58:51,370 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:58:51,371 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:58:51,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:58:54,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:58:54,918 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:58:54,918 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:58:54,938 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/data/e8f41c120/ba8cc73c66704b7585b28c331f661980/FLAG583e45c7f [2023-11-19 07:58:54,959 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/data/e8f41c120/ba8cc73c66704b7585b28c331f661980 [2023-11-19 07:58:54,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:58:54,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:58:54,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:54,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:58:54,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:58:54,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:54" (1/1) ... [2023-11-19 07:58:54,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b105a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:54, skipping insertion in model container [2023-11-19 07:58:54,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:54" (1/1) ... [2023-11-19 07:58:55,068 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:58:55,575 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:55,592 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:58:55,711 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:55,772 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:58:55,773 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:58:55,783 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:58:55,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55 WrapperNode [2023-11-19 07:58:55,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:55,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:55,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:58:55,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:58:55,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,890 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 117 [2023-11-19 07:58:55,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:55,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:58:55,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:58:55,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:58:55,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:58:55,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:58:55,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:58:55,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:58:55,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:58:55,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:58:55,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:58:56,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:58:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:58:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:58:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:58:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:58:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:58:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:58:56,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:58:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:58:56,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:58:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:58:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:58:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:58:56,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:58:56,124 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:58:56,286 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:58:56,289 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:58:56,613 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:58:56,793 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:58:56,793 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:58:56,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:56 BoogieIcfgContainer [2023-11-19 07:58:56,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:58:56,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:58:56,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:58:56,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:58:56,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:58:54" (1/3) ... [2023-11-19 07:58:56,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7218de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:56, skipping insertion in model container [2023-11-19 07:58:56,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (2/3) ... [2023-11-19 07:58:56,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7218de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:56, skipping insertion in model container [2023-11-19 07:58:56,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:56" (3/3) ... [2023-11-19 07:58:56,808 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:58:56,832 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:58:56,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 07:58:56,833 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:58:56,893 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:58:56,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 106 transitions, 220 flow [2023-11-19 07:58:56,997 INFO L124 PetriNetUnfolderBase]: 5/104 cut-off events. [2023-11-19 07:58:56,998 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:58:57,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 104 events. 5/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2023-11-19 07:58:57,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 106 transitions, 220 flow [2023-11-19 07:58:57,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 104 transitions, 214 flow [2023-11-19 07:58:57,017 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:58:57,030 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 104 transitions, 214 flow [2023-11-19 07:58:57,034 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 104 transitions, 214 flow [2023-11-19 07:58:57,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 104 transitions, 214 flow [2023-11-19 07:58:57,069 INFO L124 PetriNetUnfolderBase]: 5/104 cut-off events. [2023-11-19 07:58:57,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:58:57,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 104 events. 5/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2023-11-19 07:58:57,074 INFO L119 LiptonReduction]: Number of co-enabled transitions 1708 [2023-11-19 07:59:01,641 INFO L134 LiptonReduction]: Checked pairs total: 2936 [2023-11-19 07:59:01,641 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-11-19 07:59:01,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:59:01,684 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;@44476fca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:59:01,685 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 07:59:01,686 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:59:01,687 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:59:01,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:01,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:01,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:59:01,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:01,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash 497, now seen corresponding path program 1 times [2023-11-19 07:59:01,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:01,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764446138] [2023-11-19 07:59:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:01,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:59:01,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:01,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764446138] [2023-11-19 07:59:01,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764446138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:59:01,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914610556] [2023-11-19 07:59:01,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:01,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:59:01,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:01,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:59:01,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:59:01,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 224 [2023-11-19 07:59:01,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:01,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:01,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 224 [2023-11-19 07:59:01,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:02,129 INFO L124 PetriNetUnfolderBase]: 204/357 cut-off events. [2023-11-19 07:59:02,135 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:59:02,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 357 events. 204/357 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1365 event pairs, 204 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 714. Up to 354 conditions per place. [2023-11-19 07:59:02,149 INFO L140 encePairwiseOnDemand]: 219/224 looper letters, 17 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-11-19 07:59:02,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 76 flow [2023-11-19 07:59:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:59:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:59:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 208 transitions. [2023-11-19 07:59:02,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2023-11-19 07:59:02,175 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 208 transitions. [2023-11-19 07:59:02,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 208 transitions. [2023-11-19 07:59:02,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:02,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 208 transitions. [2023-11-19 07:59:02,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 104.0) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:02,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:02,197 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:02,200 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 52 flow. Second operand 2 states and 208 transitions. [2023-11-19 07:59:02,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 76 flow [2023-11-19 07:59:02,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:59:02,206 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-11-19 07:59:02,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-11-19 07:59:02,215 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-11-19 07:59:02,216 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-11-19 07:59:02,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:02,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:02,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:59:02,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:59:02,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:02,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:02,219 INFO L85 PathProgramCache]: Analyzing trace with hash 468885931, now seen corresponding path program 1 times [2023-11-19 07:59:02,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:02,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940023367] [2023-11-19 07:59:02,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:02,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:02,760 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-19 07:59:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940023367] [2023-11-19 07:59:02,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940023367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:02,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:02,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:59:02,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706257807] [2023-11-19 07:59:02,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:02,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:59:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:02,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:59:02,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:59:02,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 224 [2023-11-19 07:59:02,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:02,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:02,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 224 [2023-11-19 07:59:02,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:02,907 INFO L124 PetriNetUnfolderBase]: 159/308 cut-off events. [2023-11-19 07:59:02,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:02,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 308 events. 159/308 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1256 event pairs, 24 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 598. Up to 220 conditions per place. [2023-11-19 07:59:02,913 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 21 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2023-11-19 07:59:02,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 106 flow [2023-11-19 07:59:02,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:59:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:59:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-11-19 07:59:02,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2023-11-19 07:59:02,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-11-19 07:59:02,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-11-19 07:59:02,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:02,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-11-19 07:59:02,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:02,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:02,932 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:02,932 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 302 transitions. [2023-11-19 07:59:02,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 106 flow [2023-11-19 07:59:02,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:59:02,938 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-11-19 07:59:02,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-11-19 07:59:02,940 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-11-19 07:59:02,941 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-11-19 07:59:02,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:02,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:02,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:02,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:59:02,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:02,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:02,954 INFO L85 PathProgramCache]: Analyzing trace with hash -372134633, now seen corresponding path program 1 times [2023-11-19 07:59:02,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:02,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290106810] [2023-11-19 07:59:02,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:02,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:03,365 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-19 07:59:03,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:03,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290106810] [2023-11-19 07:59:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290106810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:03,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:03,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:59:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549660049] [2023-11-19 07:59:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:03,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:59:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:03,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:59:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:59:03,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 224 [2023-11-19 07:59:03,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 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-19 07:59:03,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:03,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 224 [2023-11-19 07:59:03,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:03,553 INFO L124 PetriNetUnfolderBase]: 232/422 cut-off events. [2023-11-19 07:59:03,554 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-19 07:59:03,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 422 events. 232/422 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1866 event pairs, 68 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 884. Up to 234 conditions per place. [2023-11-19 07:59:03,558 INFO L140 encePairwiseOnDemand]: 218/224 looper letters, 23 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2023-11-19 07:59:03,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 124 flow [2023-11-19 07:59:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:59:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:59:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-19 07:59:03,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2023-11-19 07:59:03,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-19 07:59:03,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-19 07:59:03,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:03,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-19 07:59:03,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:03,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:03,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:03,568 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 3 states and 296 transitions. [2023-11-19 07:59:03,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 124 flow [2023-11-19 07:59:03,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:59:03,570 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 70 flow [2023-11-19 07:59:03,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2023-11-19 07:59:03,572 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2023-11-19 07:59:03,572 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 70 flow [2023-11-19 07:59:03,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 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-19 07:59:03,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:03,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:03,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:59:03,579 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:03,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1348726484, now seen corresponding path program 1 times [2023-11-19 07:59:03,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:03,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126744645] [2023-11-19 07:59:03,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:03,855 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-19 07:59:03,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:03,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126744645] [2023-11-19 07:59:03,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126744645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:03,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:03,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:59:03,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740381565] [2023-11-19 07:59:03,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:03,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:59:03,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:03,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:59:03,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:59:03,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 224 [2023-11-19 07:59:03,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:03,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:03,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 224 [2023-11-19 07:59:03,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:04,025 INFO L124 PetriNetUnfolderBase]: 90/207 cut-off events. [2023-11-19 07:59:04,025 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-19 07:59:04,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 207 events. 90/207 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 827 event pairs, 19 based on Foata normal form. 25/232 useless extension candidates. Maximal degree in co-relation 525. Up to 122 conditions per place. [2023-11-19 07:59:04,028 INFO L140 encePairwiseOnDemand]: 219/224 looper letters, 23 selfloop transitions, 3 changer transitions 15/43 dead transitions. [2023-11-19 07:59:04,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 43 transitions, 232 flow [2023-11-19 07:59:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:59:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:59:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2023-11-19 07:59:04,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4133928571428571 [2023-11-19 07:59:04,032 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 463 transitions. [2023-11-19 07:59:04,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 463 transitions. [2023-11-19 07:59:04,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:04,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 463 transitions. [2023-11-19 07:59:04,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:04,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:04,039 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:04,039 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 70 flow. Second operand 5 states and 463 transitions. [2023-11-19 07:59:04,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 43 transitions, 232 flow [2023-11-19 07:59:04,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 43 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:59:04,043 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 87 flow [2023-11-19 07:59:04,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-19 07:59:04,044 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-11-19 07:59:04,044 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 87 flow [2023-11-19 07:59:04,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:04,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:04,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:04,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:59:04,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:04,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash 393297652, now seen corresponding path program 1 times [2023-11-19 07:59:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:04,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927068077] [2023-11-19 07:59:04,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:04,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-19 07:59:04,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:04,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927068077] [2023-11-19 07:59:04,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927068077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:04,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:04,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:59:04,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569548143] [2023-11-19 07:59:04,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:04,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:59:04,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:04,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:59:04,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:04,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 224 [2023-11-19 07:59:04,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:04,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:04,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 224 [2023-11-19 07:59:04,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:04,448 INFO L124 PetriNetUnfolderBase]: 29/85 cut-off events. [2023-11-19 07:59:04,449 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-11-19 07:59:04,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 85 events. 29/85 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 242 event pairs, 8 based on Foata normal form. 12/96 useless extension candidates. Maximal degree in co-relation 261. Up to 33 conditions per place. [2023-11-19 07:59:04,450 INFO L140 encePairwiseOnDemand]: 219/224 looper letters, 21 selfloop transitions, 5 changer transitions 8/36 dead transitions. [2023-11-19 07:59:04,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 209 flow [2023-11-19 07:59:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:59:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:59:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2023-11-19 07:59:04,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40327380952380953 [2023-11-19 07:59:04,455 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2023-11-19 07:59:04,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2023-11-19 07:59:04,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:04,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2023-11-19 07:59:04,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:04,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:04,465 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:04,465 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 87 flow. Second operand 6 states and 542 transitions. [2023-11-19 07:59:04,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 209 flow [2023-11-19 07:59:04,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 196 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-19 07:59:04,470 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 98 flow [2023-11-19 07:59:04,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2023-11-19 07:59:04,471 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2023-11-19 07:59:04,471 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 98 flow [2023-11-19 07:59:04,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:04,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:04,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:04,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:59:04,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:04,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:04,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1580500392, now seen corresponding path program 1 times [2023-11-19 07:59:04,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400444621] [2023-11-19 07:59:04,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:04,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:04,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:04,608 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:59:04,609 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-19 07:59:04,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-19 07:59:04,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 07:59:04,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-19 07:59:04,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 07:59:04,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 07:59:04,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 07:59:04,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-19 07:59:04,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-19 07:59:04,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 07:59:04,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:59:04,614 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-19 07:59:04,621 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:59:04,621 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:59:04,660 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:59:04,663 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:59:04,676 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 07:59:04,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:59:04 BasicIcfg [2023-11-19 07:59:04,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:59:04,691 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:59:04,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:59:04,691 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:59:04,692 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:56" (3/4) ... [2023-11-19 07:59:04,694 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:59:04,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:59:04,696 INFO L158 Benchmark]: Toolchain (without parser) took 9728.98ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 112.5MB in the beginning and 144.9MB in the end (delta: -32.3MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2023-11-19 07:59:04,696 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 102.8MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:59:04,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 815.43ms. Allocated memory is still 151.0MB. Free memory was 112.1MB in the beginning and 90.2MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-19 07:59:04,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.28ms. Allocated memory is still 151.0MB. Free memory was 90.2MB in the beginning and 87.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:59:04,706 INFO L158 Benchmark]: Boogie Preprocessor took 44.59ms. Allocated memory is still 151.0MB. Free memory was 87.4MB in the beginning and 86.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:59:04,707 INFO L158 Benchmark]: RCFGBuilder took 860.38ms. Allocated memory is still 151.0MB. Free memory was 85.7MB in the beginning and 93.0MB in the end (delta: -7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 07:59:04,707 INFO L158 Benchmark]: TraceAbstraction took 7889.83ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 92.2MB in the beginning and 145.9MB in the end (delta: -53.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2023-11-19 07:59:04,708 INFO L158 Benchmark]: Witness Printer took 4.51ms. Allocated memory is still 220.2MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:59:04,710 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.27ms. Allocated memory is still 102.8MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 815.43ms. Allocated memory is still 151.0MB. Free memory was 112.1MB in the beginning and 90.2MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.28ms. Allocated memory is still 151.0MB. Free memory was 90.2MB in the beginning and 87.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.59ms. Allocated memory is still 151.0MB. Free memory was 87.4MB in the beginning and 86.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 860.38ms. Allocated memory is still 151.0MB. Free memory was 85.7MB in the beginning and 93.0MB in the end (delta: -7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7889.83ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 92.2MB in the beginning and 145.9MB in the end (delta: -53.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Witness Printer took 4.51ms. Allocated memory is still 220.2MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 106 PlacesBefore, 29 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1708 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 4 ChoiceCompositions, 118 TotalNumberOfCompositions, 2936 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1740, independent: 1636, independent conditional: 0, independent unconditional: 1636, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 933, independent: 899, independent conditional: 0, independent unconditional: 899, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1740, independent: 737, independent conditional: 0, independent unconditional: 737, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 933, unknown conditional: 0, unknown unconditional: 933] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: 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: 801]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 804]: 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: 806]: 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 5 procedures, 122 locations, 10 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: 7.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 226 IncrementalHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 3 mSDtfsCounter, 226 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=5, InterpolantAutomatonStates: 19, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-19 07:59:04,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:59:07,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:59:08,016 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 07:59:08,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:59:08,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:59:08,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:59:08,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:59:08,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:59:08,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:59:08,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:59:08,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:59:08,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:59:08,093 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:59:08,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:59:08,096 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:59:08,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:59:08,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:59:08,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:59:08,098 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:59:08,099 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:59:08,100 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:59:08,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:59:08,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:59:08,102 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:59:08,102 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:59:08,103 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:59:08,103 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:59:08,104 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:59:08,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:59:08,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:59:08,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:59:08,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:59:08,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:59:08,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:59:08,108 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:59:08,109 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:59:08,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:59:08,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:59:08,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:59:08,110 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:59:08,110 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:59:08,111 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_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/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_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a [2023-11-19 07:59:08,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:59:08,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:59:08,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:59:08,624 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:59:08,625 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:59:08,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:59:12,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:59:12,331 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:59:12,331 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:59:12,347 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/data/80973be12/de2b687d3f15423e889d0f405e6da8ae/FLAGf7980a443 [2023-11-19 07:59:12,362 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/data/80973be12/de2b687d3f15423e889d0f405e6da8ae [2023-11-19 07:59:12,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:59:12,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:59:12,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:12,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:59:12,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:59:12,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:12" (1/1) ... [2023-11-19 07:59:12,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177b3c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:12, skipping insertion in model container [2023-11-19 07:59:12,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:12" (1/1) ... [2023-11-19 07:59:12,445 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:59:12,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:12,913 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:59:13,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:13,099 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:59:13,099 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:59:13,107 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:59:13,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13 WrapperNode [2023-11-19 07:59:13,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:13,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:13,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:59:13,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:59:13,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (1/1) ... [2023-11-19 07:59:13,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (1/1) ... [2023-11-19 07:59:13,184 INFO L138 Inliner]: procedures = 178, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 118 [2023-11-19 07:59:13,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:13,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:59:13,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:59:13,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:59:13,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (1/1) ... [2023-11-19 07:59:13,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (1/1) ... [2023-11-19 07:59:13,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (1/1) ... [2023-11-19 07:59:13,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (1/1) ... [2023-11-19 07:59:13,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (1/1) ... [2023-11-19 07:59:13,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (1/1) ... [2023-11-19 07:59:13,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (1/1) ... [2023-11-19 07:59:13,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (1/1) ... [2023-11-19 07:59:13,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:59:13,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:59:13,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:59:13,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:59:13,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (1/1) ... [2023-11-19 07:59:13,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:59:13,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:13,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:59:13,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:59:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:59:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:59:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:59:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:59:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 07:59:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:59:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:59:13,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:59:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:59:13,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:59:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:59:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:59:13,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:59:13,326 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:59:13,513 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:59:13,516 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:59:13,975 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:59:14,159 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:59:14,160 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:59:14,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:14 BoogieIcfgContainer [2023-11-19 07:59:14,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:59:14,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:59:14,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:59:14,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:59:14,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:59:12" (1/3) ... [2023-11-19 07:59:14,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3300dd2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:59:14, skipping insertion in model container [2023-11-19 07:59:14,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:13" (2/3) ... [2023-11-19 07:59:14,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3300dd2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:59:14, skipping insertion in model container [2023-11-19 07:59:14,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:14" (3/3) ... [2023-11-19 07:59:14,181 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:59:14,204 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:59:14,204 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 07:59:14,205 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:59:14,282 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:59:14,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 107 transitions, 222 flow [2023-11-19 07:59:14,410 INFO L124 PetriNetUnfolderBase]: 5/105 cut-off events. [2023-11-19 07:59:14,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:14,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 5/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2023-11-19 07:59:14,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 107 transitions, 222 flow [2023-11-19 07:59:14,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 105 transitions, 216 flow [2023-11-19 07:59:14,432 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:59:14,443 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 105 transitions, 216 flow [2023-11-19 07:59:14,447 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 105 transitions, 216 flow [2023-11-19 07:59:14,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 216 flow [2023-11-19 07:59:14,482 INFO L124 PetriNetUnfolderBase]: 5/105 cut-off events. [2023-11-19 07:59:14,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:14,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 5/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2023-11-19 07:59:14,486 INFO L119 LiptonReduction]: Number of co-enabled transitions 1708 [2023-11-19 07:59:21,397 INFO L134 LiptonReduction]: Checked pairs total: 2844 [2023-11-19 07:59:21,397 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-11-19 07:59:21,413 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:59:21,419 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;@1d4dec2c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:59:21,420 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 07:59:21,422 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:59:21,422 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 07:59:21,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:21,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:21,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:59:21,423 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:21,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash 496, now seen corresponding path program 1 times [2023-11-19 07:59:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:21,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429578392] [2023-11-19 07:59:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:21,438 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-19 07:59:21,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:21,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:21,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:21,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 07:59:21,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:21,563 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-19 07:59:21,563 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:59:21,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:59:21,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429578392] [2023-11-19 07:59:21,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429578392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:21,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:21,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:59:21,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256345756] [2023-11-19 07:59:21,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:21,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:59:21,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:59:21,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:59:21,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:59:21,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 223 [2023-11-19 07:59:21,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:21,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:21,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 223 [2023-11-19 07:59:21,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:21,784 INFO L124 PetriNetUnfolderBase]: 204/357 cut-off events. [2023-11-19 07:59:21,784 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:59:21,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 357 events. 204/357 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1363 event pairs, 204 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 714. Up to 354 conditions per place. [2023-11-19 07:59:21,790 INFO L140 encePairwiseOnDemand]: 218/223 looper letters, 17 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-11-19 07:59:21,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 76 flow [2023-11-19 07:59:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:59:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:59:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 210 transitions. [2023-11-19 07:59:21,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47085201793721976 [2023-11-19 07:59:21,806 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 210 transitions. [2023-11-19 07:59:21,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 210 transitions. [2023-11-19 07:59:21,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:21,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 210 transitions. [2023-11-19 07:59:21,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:21,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:21,821 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:21,823 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 52 flow. Second operand 2 states and 210 transitions. [2023-11-19 07:59:21,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 76 flow [2023-11-19 07:59:21,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:59:21,828 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-11-19 07:59:21,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-11-19 07:59:21,834 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-11-19 07:59:21,835 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-11-19 07:59:21,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:21,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:21,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:59:21,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:22,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:22,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:22,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash 468034549, now seen corresponding path program 1 times [2023-11-19 07:59:22,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:22,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551703638] [2023-11-19 07:59:22,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:22,044 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-19 07:59:22,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:22,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:22,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:22,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:59:22,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:22,217 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-19 07:59:22,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:59:22,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:59:22,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551703638] [2023-11-19 07:59:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551703638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:22,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:22,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:59:22,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293265497] [2023-11-19 07:59:22,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:22,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:59:22,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:59:22,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:59:22,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:59:22,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 223 [2023-11-19 07:59:22,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:22,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:22,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 223 [2023-11-19 07:59:22,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:22,415 INFO L124 PetriNetUnfolderBase]: 159/308 cut-off events. [2023-11-19 07:59:22,416 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:22,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 308 events. 159/308 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1252 event pairs, 24 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 598. Up to 220 conditions per place. [2023-11-19 07:59:22,425 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 21 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2023-11-19 07:59:22,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 106 flow [2023-11-19 07:59:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:59:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:59:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-11-19 07:59:22,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45590433482810166 [2023-11-19 07:59:22,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-11-19 07:59:22,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-11-19 07:59:22,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:22,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-11-19 07:59:22,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:22,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:22,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:22,450 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 305 transitions. [2023-11-19 07:59:22,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 106 flow [2023-11-19 07:59:22,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:59:22,453 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-11-19 07:59:22,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-11-19 07:59:22,454 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-11-19 07:59:22,454 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-11-19 07:59:22,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:22,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:22,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:22,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:22,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:22,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:22,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1754730269, now seen corresponding path program 1 times [2023-11-19 07:59:22,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:22,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782656511] [2023-11-19 07:59:22,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:22,658 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-19 07:59:22,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:22,664 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:22,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:22,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 07:59:22,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:22,834 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-19 07:59:22,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:59:22,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:59:22,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782656511] [2023-11-19 07:59:22,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782656511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:22,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:22,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:59:22,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021355015] [2023-11-19 07:59:22,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:22,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:59:22,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:59:22,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:59:22,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:59:22,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 223 [2023-11-19 07:59:22,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:22,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:22,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 223 [2023-11-19 07:59:22,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:23,056 INFO L124 PetriNetUnfolderBase]: 62/141 cut-off events. [2023-11-19 07:59:23,058 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-19 07:59:23,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 141 events. 62/141 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 468 event pairs, 13 based on Foata normal form. 16/150 useless extension candidates. Maximal degree in co-relation 303. Up to 82 conditions per place. [2023-11-19 07:59:23,062 INFO L140 encePairwiseOnDemand]: 218/223 looper letters, 20 selfloop transitions, 3 changer transitions 13/37 dead transitions. [2023-11-19 07:59:23,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 37 transitions, 162 flow [2023-11-19 07:59:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:59:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:59:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-11-19 07:59:23,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43318385650224217 [2023-11-19 07:59:23,069 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-11-19 07:59:23,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-11-19 07:59:23,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:23,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-11-19 07:59:23,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:23,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:23,079 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:23,080 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 5 states and 483 transitions. [2023-11-19 07:59:23,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 37 transitions, 162 flow [2023-11-19 07:59:23,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:59:23,082 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 63 flow [2023-11-19 07:59:23,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-11-19 07:59:23,084 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-11-19 07:59:23,085 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 63 flow [2023-11-19 07:59:23,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:23,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:23,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:23,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:59:23,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:23,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:23,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:23,290 INFO L85 PathProgramCache]: Analyzing trace with hash 110083258, now seen corresponding path program 1 times [2023-11-19 07:59:23,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:23,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085030982] [2023-11-19 07:59:23,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:23,291 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-19 07:59:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:23,292 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:23,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:23,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:59:23,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:23,474 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-19 07:59:23,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:59:23,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:59:23,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085030982] [2023-11-19 07:59:23,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085030982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:23,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:23,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:59:23,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706440453] [2023-11-19 07:59:23,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:23,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:59:23,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:59:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:59:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:23,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 223 [2023-11-19 07:59:23,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:23,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:23,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 223 [2023-11-19 07:59:23,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:23,718 INFO L124 PetriNetUnfolderBase]: 20/60 cut-off events. [2023-11-19 07:59:23,718 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-19 07:59:23,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 60 events. 20/60 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 124 event pairs, 8 based on Foata normal form. 7/66 useless extension candidates. Maximal degree in co-relation 161. Up to 24 conditions per place. [2023-11-19 07:59:23,719 INFO L140 encePairwiseOnDemand]: 218/223 looper letters, 18 selfloop transitions, 5 changer transitions 7/31 dead transitions. [2023-11-19 07:59:23,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 161 flow [2023-11-19 07:59:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:59:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:59:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 566 transitions. [2023-11-19 07:59:23,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42301943198804187 [2023-11-19 07:59:23,723 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 566 transitions. [2023-11-19 07:59:23,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 566 transitions. [2023-11-19 07:59:23,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:23,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 566 transitions. [2023-11-19 07:59:23,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:23,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:23,736 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:23,736 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 63 flow. Second operand 6 states and 566 transitions. [2023-11-19 07:59:23,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 161 flow [2023-11-19 07:59:23,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 148 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-19 07:59:23,741 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 74 flow [2023-11-19 07:59:23,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-11-19 07:59:23,743 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2023-11-19 07:59:23,749 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 74 flow [2023-11-19 07:59:23,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:23,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:23,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:23,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:23,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:23,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:23,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:23,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1886547759, now seen corresponding path program 1 times [2023-11-19 07:59:23,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:23,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524420762] [2023-11-19 07:59:23,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:23,955 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-19 07:59:23,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:23,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:23,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:24,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-19 07:59:24,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:59:24,357 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:59:24,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:59:24,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524420762] [2023-11-19 07:59:24,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524420762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:24,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:24,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:59:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570959544] [2023-11-19 07:59:24,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:24,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:59:24,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:59:24,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:59:24,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:59:24,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 223 [2023-11-19 07:59:24,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:24,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:24,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 223 [2023-11-19 07:59:24,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:24,523 INFO L124 PetriNetUnfolderBase]: 15/48 cut-off events. [2023-11-19 07:59:24,523 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-19 07:59:24,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 15/48 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 131. Up to 39 conditions per place. [2023-11-19 07:59:24,524 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-11-19 07:59:24,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 20 transitions, 121 flow [2023-11-19 07:59:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:59:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:59:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2023-11-19 07:59:24,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3834080717488789 [2023-11-19 07:59:24,527 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 342 transitions. [2023-11-19 07:59:24,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 342 transitions. [2023-11-19 07:59:24,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:24,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 342 transitions. [2023-11-19 07:59:24,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:24,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:24,533 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:24,533 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 74 flow. Second operand 4 states and 342 transitions. [2023-11-19 07:59:24,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 20 transitions, 121 flow [2023-11-19 07:59:24,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 104 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-19 07:59:24,537 INFO L231 Difference]: Finished difference. Result has 28 places, 17 transitions, 60 flow [2023-11-19 07:59:24,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=28, PETRI_TRANSITIONS=17} [2023-11-19 07:59:24,540 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-11-19 07:59:24,540 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 60 flow [2023-11-19 07:59:24,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:24,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:24,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:24,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:24,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:24,745 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:24,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:24,746 INFO L85 PathProgramCache]: Analyzing trace with hash 935798300, now seen corresponding path program 1 times [2023-11-19 07:59:24,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:24,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910140074] [2023-11-19 07:59:24,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:24,747 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-19 07:59:24,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:24,748 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:24,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:24,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:59:24,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:59:24,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:59:24,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:59:24,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910140074] [2023-11-19 07:59:24,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910140074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:24,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:24,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:59:24,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287386947] [2023-11-19 07:59:24,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:24,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:59:24,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:59:24,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:59:24,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:59:24,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 223 [2023-11-19 07:59:24,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:24,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:24,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 223 [2023-11-19 07:59:24,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:25,023 INFO L124 PetriNetUnfolderBase]: 21/66 cut-off events. [2023-11-19 07:59:25,024 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-19 07:59:25,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 66 events. 21/66 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 9 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 182. Up to 46 conditions per place. [2023-11-19 07:59:25,024 INFO L140 encePairwiseOnDemand]: 219/223 looper letters, 17 selfloop transitions, 2 changer transitions 8/27 dead transitions. [2023-11-19 07:59:25,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 150 flow [2023-11-19 07:59:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:59:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:59:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions. [2023-11-19 07:59:25,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4260089686098655 [2023-11-19 07:59:25,028 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 380 transitions. [2023-11-19 07:59:25,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions. [2023-11-19 07:59:25,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:25,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions. [2023-11-19 07:59:25,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:25,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:25,034 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:25,034 INFO L175 Difference]: Start difference. First operand has 28 places, 17 transitions, 60 flow. Second operand 4 states and 380 transitions. [2023-11-19 07:59:25,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 150 flow [2023-11-19 07:59:25,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:59:25,036 INFO L231 Difference]: Finished difference. Result has 31 places, 17 transitions, 67 flow [2023-11-19 07:59:25,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2023-11-19 07:59:25,037 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-11-19 07:59:25,038 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 67 flow [2023-11-19 07:59:25,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:25,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:25,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:25,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-19 07:59:25,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:25,242 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:25,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:25,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1222047104, now seen corresponding path program 2 times [2023-11-19 07:59:25,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:25,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193029983] [2023-11-19 07:59:25,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:59:25,244 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-19 07:59:25,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:25,245 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:25,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:25,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-19 07:59:25,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:59:25,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-19 07:59:25,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:25,507 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-19 07:59:25,507 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:59:25,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:59:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193029983] [2023-11-19 07:59:25,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193029983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:25,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:25,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:59:25,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954069333] [2023-11-19 07:59:25,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:25,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:59:25,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:59:25,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:59:25,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:59:25,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 223 [2023-11-19 07:59:25,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 17 transitions, 67 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:25,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:25,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 223 [2023-11-19 07:59:25,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:25,757 INFO L124 PetriNetUnfolderBase]: 6/34 cut-off events. [2023-11-19 07:59:25,757 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-19 07:59:25,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 34 events. 6/34 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 1/35 useless extension candidates. Maximal degree in co-relation 105. Up to 13 conditions per place. [2023-11-19 07:59:25,758 INFO L140 encePairwiseOnDemand]: 216/223 looper letters, 13 selfloop transitions, 4 changer transitions 9/27 dead transitions. [2023-11-19 07:59:25,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 164 flow [2023-11-19 07:59:25,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:59:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:59:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 711 transitions. [2023-11-19 07:59:25,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.398542600896861 [2023-11-19 07:59:25,764 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 711 transitions. [2023-11-19 07:59:25,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 711 transitions. [2023-11-19 07:59:25,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:25,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 711 transitions. [2023-11-19 07:59:25,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.875) internal successors, (711), 8 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:25,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:25,772 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:25,772 INFO L175 Difference]: Start difference. First operand has 31 places, 17 transitions, 67 flow. Second operand 8 states and 711 transitions. [2023-11-19 07:59:25,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 164 flow [2023-11-19 07:59:25,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 149 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-19 07:59:25,776 INFO L231 Difference]: Finished difference. Result has 36 places, 17 transitions, 73 flow [2023-11-19 07:59:25,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=73, PETRI_PLACES=36, PETRI_TRANSITIONS=17} [2023-11-19 07:59:25,777 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-11-19 07:59:25,778 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 17 transitions, 73 flow [2023-11-19 07:59:25,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:59:25,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:25,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:25,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:25,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:25,990 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:59:25,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash -250484146, now seen corresponding path program 3 times [2023-11-19 07:59:25,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:25,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149621567] [2023-11-19 07:59:25,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:59:25,992 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-19 07:59:25,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:25,993 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:25,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:26,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-19 07:59:26,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-19 07:59:26,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:26,211 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-19 07:59:26,211 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:59:26,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-19 07:59:26,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-19 07:59:26,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 07:59:26,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-19 07:59:26,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 07:59:26,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 07:59:26,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 07:59:26,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-19 07:59:26,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-19 07:59:26,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 07:59:26,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:26,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:59:26,420 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-19 07:59:26,425 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:59:26,425 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:59:26,463 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:59:26,474 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:59:26,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 07:59:26,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:59:26 BasicIcfg [2023-11-19 07:59:26,488 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:59:26,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:59:26,489 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:59:26,489 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:59:26,490 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:14" (3/4) ... [2023-11-19 07:59:26,491 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:59:26,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:59:26,493 INFO L158 Benchmark]: Toolchain (without parser) took 14126.83ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 68.8MB in the beginning and 74.6MB in the end (delta: -5.9MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2023-11-19 07:59:26,493 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:59:26,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 740.40ms. Allocated memory is still 94.4MB. Free memory was 68.5MB in the beginning and 65.5MB in the end (delta: 3.1MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2023-11-19 07:59:26,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.44ms. Allocated memory is still 94.4MB. Free memory was 65.5MB in the beginning and 63.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:59:26,495 INFO L158 Benchmark]: Boogie Preprocessor took 39.40ms. Allocated memory is still 94.4MB. Free memory was 63.4MB in the beginning and 61.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:59:26,495 INFO L158 Benchmark]: RCFGBuilder took 940.97ms. Allocated memory is still 94.4MB. Free memory was 61.3MB in the beginning and 56.5MB in the end (delta: 4.7MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2023-11-19 07:59:26,496 INFO L158 Benchmark]: TraceAbstraction took 12318.25ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 56.0MB in the beginning and 74.6MB in the end (delta: -18.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2023-11-19 07:59:26,496 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 136.3MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:59:26,498 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.23ms. Allocated memory is still 71.3MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 740.40ms. Allocated memory is still 94.4MB. Free memory was 68.5MB in the beginning and 65.5MB in the end (delta: 3.1MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.44ms. Allocated memory is still 94.4MB. Free memory was 65.5MB in the beginning and 63.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.40ms. Allocated memory is still 94.4MB. Free memory was 63.4MB in the beginning and 61.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 940.97ms. Allocated memory is still 94.4MB. Free memory was 61.3MB in the beginning and 56.5MB in the end (delta: 4.7MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12318.25ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 56.0MB in the beginning and 74.6MB in the end (delta: -18.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 136.3MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 107 PlacesBefore, 29 PlacesAfterwards, 105 TransitionsBefore, 23 TransitionsAfterwards, 1708 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 116 TotalNumberOfCompositions, 2844 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1611, independent: 1517, independent conditional: 0, independent unconditional: 1517, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 908, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1611, independent: 636, independent conditional: 0, independent unconditional: 636, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 908, unknown conditional: 0, unknown unconditional: 908] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={3:0}, t2562={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={3:0}, t2562={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: 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: 801]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 804]: 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: 806]: 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 5 procedures, 123 locations, 10 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: 12.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 16 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=4, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 480 SizeOfPredicates, 8 NumberOfNonLiveVariables, 634 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 07:59:26,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f210f42-5d5d-4b9e-8b38-909fd925eabf/bin/uautomizer-verify-uCwYo4JHxu/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