./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 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_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 02:11:56,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:11:56,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:11:56,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:11:56,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:11:56,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:11:56,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:11:56,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:11:56,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:11:56,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:11:56,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:11:56,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:11:56,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:11:56,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:11:56,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:11:56,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:11:56,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:11:56,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:11:56,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:11:56,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:11:56,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:11:56,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:11:56,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:11:56,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:11:56,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:11:56,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:11:56,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:11:56,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:11:56,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:11:56,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:11:56,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:11:56,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:11:56,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:11:56,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:11:56,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:11:56,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:11:56,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:11:56,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:11:56,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:11:56,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:11:56,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:11:56,961 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 02:11:57,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:11:57,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:11:57,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:11:57,013 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:11:57,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:11:57,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:11:57,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:11:57,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:11:57,016 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:11:57,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:11:57,018 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:11:57,018 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:11:57,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:11:57,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:11:57,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:11:57,019 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:11:57,020 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:11:57,020 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:11:57,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:11:57,020 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:11:57,021 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:11:57,021 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:11:57,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:11:57,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:11:57,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:11:57,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:11:57,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:11:57,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:11:57,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:11:57,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:11:57,024 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:11:57,024 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:11:57,025 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:11:57,025 INFO L138 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_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/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_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 [2022-11-23 02:11:57,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:11:57,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:11:57,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:11:57,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:11:57,445 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:11:57,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/rfi004.i [2022-11-23 02:12:00,621 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:12:00,889 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:12:00,890 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/sv-benchmarks/c/pthread-wmm/rfi004.i [2022-11-23 02:12:00,904 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/data/0c3b3e3c3/167890a7700d47d89473431cee84c581/FLAG865e6e249 [2022-11-23 02:12:00,919 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/data/0c3b3e3c3/167890a7700d47d89473431cee84c581 [2022-11-23 02:12:00,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:12:00,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:12:00,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:12:00,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:12:00,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:12:00,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:12:00" (1/1) ... [2022-11-23 02:12:00,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c6cf78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:00, skipping insertion in model container [2022-11-23 02:12:00,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:12:00" (1/1) ... [2022-11-23 02:12:00,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:12:01,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:12:01,186 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/sv-benchmarks/c/pthread-wmm/rfi004.i[983,996] [2022-11-23 02:12:01,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:12:01,544 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:12:01,558 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/sv-benchmarks/c/pthread-wmm/rfi004.i[983,996] [2022-11-23 02:12:01,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:12:01,659 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:12:01,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01 WrapperNode [2022-11-23 02:12:01,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:12:01,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:12:01,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:12:01,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:12:01,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (1/1) ... [2022-11-23 02:12:01,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (1/1) ... [2022-11-23 02:12:01,772 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2022-11-23 02:12:01,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:12:01,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:12:01,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:12:01,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:12:01,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (1/1) ... [2022-11-23 02:12:01,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (1/1) ... [2022-11-23 02:12:01,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (1/1) ... [2022-11-23 02:12:01,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (1/1) ... [2022-11-23 02:12:01,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (1/1) ... [2022-11-23 02:12:01,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (1/1) ... [2022-11-23 02:12:01,830 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (1/1) ... [2022-11-23 02:12:01,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (1/1) ... [2022-11-23 02:12:01,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:12:01,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:12:01,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:12:01,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:12:01,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (1/1) ... [2022-11-23 02:12:01,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:12:01,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:12:01,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:12:01,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:12:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:12:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:12:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:12:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:12:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:12:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 02:12:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 02:12:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 02:12:01,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 02:12:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:12:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:12:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:12:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:12:01,958 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:12:02,199 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:12:02,201 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:12:02,541 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:12:02,872 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:12:02,872 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:12:02,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:12:02 BoogieIcfgContainer [2022-11-23 02:12:02,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:12:02,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:12:02,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:12:02,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:12:02,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:12:00" (1/3) ... [2022-11-23 02:12:02,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1094bfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:12:02, skipping insertion in model container [2022-11-23 02:12:02,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:01" (2/3) ... [2022-11-23 02:12:02,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1094bfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:12:02, skipping insertion in model container [2022-11-23 02:12:02,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:12:02" (3/3) ... [2022-11-23 02:12:02,887 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2022-11-23 02:12:02,919 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:12:02,920 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-23 02:12:02,920 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:12:02,992 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:12:03,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 106 transitions, 222 flow [2022-11-23 02:12:03,101 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-11-23 02:12:03,101 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:12:03,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2022-11-23 02:12:03,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 106 transitions, 222 flow [2022-11-23 02:12:03,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 104 transitions, 214 flow [2022-11-23 02:12:03,119 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:12:03,148 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 104 transitions, 214 flow [2022-11-23 02:12:03,160 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 104 transitions, 214 flow [2022-11-23 02:12:03,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 104 transitions, 214 flow [2022-11-23 02:12:03,211 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-11-23 02:12:03,213 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:12:03,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2022-11-23 02:12:03,217 INFO L119 LiptonReduction]: Number of co-enabled transitions 1316 [2022-11-23 02:12:08,796 INFO L134 LiptonReduction]: Checked pairs total: 2991 [2022-11-23 02:12:08,797 INFO L136 LiptonReduction]: Total number of compositions: 104 [2022-11-23 02:12:08,831 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:12:08,840 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;@21bdaf66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:12:08,840 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-23 02:12:08,842 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 02:12:08,843 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:12:08,843 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:08,844 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 02:12:08,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash 459, now seen corresponding path program 1 times [2022-11-23 02:12:08,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:12:08,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115046172] [2022-11-23 02:12:08,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:08,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:12:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:09,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:12:09,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115046172] [2022-11-23 02:12:09,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115046172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:09,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:09,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 02:12:09,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369612536] [2022-11-23 02:12:09,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:09,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 02:12:09,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:12:09,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 02:12:09,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 02:12:09,059 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2022-11-23 02:12:09,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:09,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:09,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2022-11-23 02:12:09,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:09,214 INFO L130 PetriNetUnfolder]: 211/396 cut-off events. [2022-11-23 02:12:09,215 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-23 02:12:09,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 396 events. 211/396 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1647 event pairs, 211 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 764. Up to 365 conditions per place. [2022-11-23 02:12:09,220 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 17 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-11-23 02:12:09,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 78 flow [2022-11-23 02:12:09,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 02:12:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 02:12:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 214 transitions. [2022-11-23 02:12:09,234 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2022-11-23 02:12:09,235 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 214 transitions. [2022-11-23 02:12:09,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 214 transitions. [2022-11-23 02:12:09,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:09,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 214 transitions. [2022-11-23 02:12:09,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 107.0) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:09,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:09,248 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:09,250 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 2 states and 214 transitions. [2022-11-23 02:12:09,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 78 flow [2022-11-23 02:12:09,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:12:09,255 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2022-11-23 02:12:09,257 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2022-11-23 02:12:09,261 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2022-11-23 02:12:09,261 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2022-11-23 02:12:09,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:09,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:09,262 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:12:09,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:12:09,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:09,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:09,263 INFO L85 PathProgramCache]: Analyzing trace with hash 432993790, now seen corresponding path program 1 times [2022-11-23 02:12:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:12:09,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314936494] [2022-11-23 02:12:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:12:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:09,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:12:09,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314936494] [2022-11-23 02:12:09,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314936494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:09,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:09,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:12:09,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077437678] [2022-11-23 02:12:09,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:09,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:12:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:12:09,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:12:09,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:12:09,596 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 210 [2022-11-23 02:12:09,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:09,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:09,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 210 [2022-11-23 02:12:09,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:09,726 INFO L130 PetriNetUnfolder]: 173/330 cut-off events. [2022-11-23 02:12:09,727 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:12:09,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 330 events. 173/330 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1304 event pairs, 21 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 642. Up to 249 conditions per place. [2022-11-23 02:12:09,733 INFO L137 encePairwiseOnDemand]: 207/210 looper letters, 20 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2022-11-23 02:12:09,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 26 transitions, 104 flow [2022-11-23 02:12:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:12:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:12:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-11-23 02:12:09,741 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2022-11-23 02:12:09,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2022-11-23 02:12:09,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2022-11-23 02:12:09,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:09,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2022-11-23 02:12:09,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:09,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:09,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:09,750 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 310 transitions. [2022-11-23 02:12:09,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 26 transitions, 104 flow [2022-11-23 02:12:09,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:12:09,752 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2022-11-23 02:12:09,752 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2022-11-23 02:12:09,753 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2022-11-23 02:12:09,753 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2022-11-23 02:12:09,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:09,754 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:09,755 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:09,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:12:09,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash -504747771, now seen corresponding path program 1 times [2022-11-23 02:12:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:12:09,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765871379] [2022-11-23 02:12:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:12:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:12:09,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765871379] [2022-11-23 02:12:09,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765871379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:09,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:09,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:12:09,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259775342] [2022-11-23 02:12:09,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:09,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:12:09,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:12:09,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:12:09,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:12:10,003 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 210 [2022-11-23 02:12:10,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:10,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:10,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 210 [2022-11-23 02:12:10,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:10,096 INFO L130 PetriNetUnfolder]: 128/253 cut-off events. [2022-11-23 02:12:10,096 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-23 02:12:10,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 253 events. 128/253 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 943 event pairs, 47 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 509. Up to 150 conditions per place. [2022-11-23 02:12:10,098 INFO L137 encePairwiseOnDemand]: 207/210 looper letters, 19 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2022-11-23 02:12:10,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 23 transitions, 96 flow [2022-11-23 02:12:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:12:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:12:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2022-11-23 02:12:10,101 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2022-11-23 02:12:10,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2022-11-23 02:12:10,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2022-11-23 02:12:10,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:10,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2022-11-23 02:12:10,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:10,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:10,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:10,105 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 3 states and 304 transitions. [2022-11-23 02:12:10,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 23 transitions, 96 flow [2022-11-23 02:12:10,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:12:10,107 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 46 flow [2022-11-23 02:12:10,107 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, 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=46, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2022-11-23 02:12:10,108 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2022-11-23 02:12:10,108 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 46 flow [2022-11-23 02:12:10,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:10,109 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:10,109 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:10,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:12:10,110 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:10,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:10,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1532688718, now seen corresponding path program 1 times [2022-11-23 02:12:10,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:12:10,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003827805] [2022-11-23 02:12:10,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:12:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:10,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:12:10,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003827805] [2022-11-23 02:12:10,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003827805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:10,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:10,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:12:10,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842527077] [2022-11-23 02:12:10,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:10,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:12:10,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:12:10,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:12:10,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:12:10,606 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 210 [2022-11-23 02:12:10,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:10,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:10,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 210 [2022-11-23 02:12:10,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:10,749 INFO L130 PetriNetUnfolder]: 128/241 cut-off events. [2022-11-23 02:12:10,749 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-23 02:12:10,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 241 events. 128/241 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 845 event pairs, 40 based on Foata normal form. 20/261 useless extension candidates. Maximal degree in co-relation 525. Up to 173 conditions per place. [2022-11-23 02:12:10,751 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 15 selfloop transitions, 2 changer transitions 8/26 dead transitions. [2022-11-23 02:12:10,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 117 flow [2022-11-23 02:12:10,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:12:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:12:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-11-23 02:12:10,757 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4247619047619048 [2022-11-23 02:12:10,757 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 446 transitions. [2022-11-23 02:12:10,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 446 transitions. [2022-11-23 02:12:10,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:10,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 446 transitions. [2022-11-23 02:12:10,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:10,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:10,763 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:10,763 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 46 flow. Second operand 5 states and 446 transitions. [2022-11-23 02:12:10,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 117 flow [2022-11-23 02:12:10,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 111 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:12:10,765 INFO L231 Difference]: Finished difference. Result has 27 places, 15 transitions, 42 flow [2022-11-23 02:12:10,765 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=42, PETRI_PLACES=27, PETRI_TRANSITIONS=15} [2022-11-23 02:12:10,767 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-11-23 02:12:10,767 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 15 transitions, 42 flow [2022-11-23 02:12:10,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:10,768 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:10,768 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:10,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:12:10,769 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash 267215720, now seen corresponding path program 1 times [2022-11-23 02:12:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:12:10,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795876710] [2022-11-23 02:12:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:12:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:10,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:12:10,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795876710] [2022-11-23 02:12:10,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795876710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:10,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:10,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:12:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011799267] [2022-11-23 02:12:10,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:10,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:12:10,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:12:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:12:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:12:11,014 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2022-11-23 02:12:11,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:11,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2022-11-23 02:12:11,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:11,137 INFO L130 PetriNetUnfolder]: 60/134 cut-off events. [2022-11-23 02:12:11,137 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 02:12:11,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 134 events. 60/134 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 425 event pairs, 13 based on Foata normal form. 20/154 useless extension candidates. Maximal degree in co-relation 296. Up to 60 conditions per place. [2022-11-23 02:12:11,139 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 20 selfloop transitions, 3 changer transitions 15/39 dead transitions. [2022-11-23 02:12:11,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 39 transitions, 173 flow [2022-11-23 02:12:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:12:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:12:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2022-11-23 02:12:11,141 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-11-23 02:12:11,142 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 500 transitions. [2022-11-23 02:12:11,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 500 transitions. [2022-11-23 02:12:11,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:11,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 500 transitions. [2022-11-23 02:12:11,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,148 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,148 INFO L175 Difference]: Start difference. First operand has 27 places, 15 transitions, 42 flow. Second operand 5 states and 500 transitions. [2022-11-23 02:12:11,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 39 transitions, 173 flow [2022-11-23 02:12:11,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 39 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:12:11,151 INFO L231 Difference]: Finished difference. Result has 30 places, 17 transitions, 66 flow [2022-11-23 02:12:11,152 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2022-11-23 02:12:11,155 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-11-23 02:12:11,156 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 66 flow [2022-11-23 02:12:11,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,156 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:11,157 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:11,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:12:11,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:11,158 INFO L85 PathProgramCache]: Analyzing trace with hash -818976137, now seen corresponding path program 1 times [2022-11-23 02:12:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:12:11,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111558182] [2022-11-23 02:12:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:12:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:11,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:12:11,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111558182] [2022-11-23 02:12:11,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111558182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:11,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:11,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:12:11,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913657551] [2022-11-23 02:12:11,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:11,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:12:11,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:12:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:12:11,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:12:11,404 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2022-11-23 02:12:11,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:11,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2022-11-23 02:12:11,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:11,513 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2022-11-23 02:12:11,513 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-23 02:12:11,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 67 events. 24/67 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 149 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 188. Up to 29 conditions per place. [2022-11-23 02:12:11,514 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 18 selfloop transitions, 5 changer transitions 8/32 dead transitions. [2022-11-23 02:12:11,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 173 flow [2022-11-23 02:12:11,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:12:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:12:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2022-11-23 02:12:11,516 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2022-11-23 02:12:11,517 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 585 transitions. [2022-11-23 02:12:11,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 585 transitions. [2022-11-23 02:12:11,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:11,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 585 transitions. [2022-11-23 02:12:11,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,522 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,522 INFO L175 Difference]: Start difference. First operand has 30 places, 17 transitions, 66 flow. Second operand 6 states and 585 transitions. [2022-11-23 02:12:11,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 173 flow [2022-11-23 02:12:11,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 154 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-23 02:12:11,525 INFO L231 Difference]: Finished difference. Result has 33 places, 17 transitions, 73 flow [2022-11-23 02:12:11,525 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=73, PETRI_PLACES=33, PETRI_TRANSITIONS=17} [2022-11-23 02:12:11,526 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-11-23 02:12:11,526 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 17 transitions, 73 flow [2022-11-23 02:12:11,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,526 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:11,526 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:11,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:12:11,527 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:11,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1970088022, now seen corresponding path program 1 times [2022-11-23 02:12:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:12:11,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246399418] [2022-11-23 02:12:11,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:11,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:12:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:11,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:12:11,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246399418] [2022-11-23 02:12:11,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246399418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:11,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:11,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:12:11,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608190822] [2022-11-23 02:12:11,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:11,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:12:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:12:11,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:12:11,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:12:11,754 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 210 [2022-11-23 02:12:11,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 17 transitions, 73 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) [2022-11-23 02:12:11,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:11,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 210 [2022-11-23 02:12:11,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:11,852 INFO L130 PetriNetUnfolder]: 24/71 cut-off events. [2022-11-23 02:12:11,852 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-11-23 02:12:11,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 71 events. 24/71 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 180 event pairs, 1 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 208. Up to 41 conditions per place. [2022-11-23 02:12:11,853 INFO L137 encePairwiseOnDemand]: 204/210 looper letters, 21 selfloop transitions, 7 changer transitions 9/37 dead transitions. [2022-11-23 02:12:11,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 228 flow [2022-11-23 02:12:11,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:12:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:12:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-11-23 02:12:11,856 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4561904761904762 [2022-11-23 02:12:11,856 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 479 transitions. [2022-11-23 02:12:11,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 479 transitions. [2022-11-23 02:12:11,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:11,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 479 transitions. [2022-11-23 02:12:11,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:11,861 INFO L175 Difference]: Start difference. First operand has 33 places, 17 transitions, 73 flow. Second operand 5 states and 479 transitions. [2022-11-23 02:12:11,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 228 flow [2022-11-23 02:12:11,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 197 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-11-23 02:12:11,864 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 93 flow [2022-11-23 02:12:11,864 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-11-23 02:12:11,865 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-11-23 02:12:11,865 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 93 flow [2022-11-23 02:12:11,865 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) [2022-11-23 02:12:11,866 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:11,866 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:11,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:12:11,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:11,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:11,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1790255562, now seen corresponding path program 2 times [2022-11-23 02:12:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:12:11,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476783384] [2022-11-23 02:12:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:12:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:12:12,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476783384] [2022-11-23 02:12:12,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476783384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:12,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:12,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:12:12,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334471031] [2022-11-23 02:12:12,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:12,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:12:12,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:12:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:12:12,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:12:12,086 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 210 [2022-11-23 02:12:12,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:12,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:12,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 210 [2022-11-23 02:12:12,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:12,247 INFO L130 PetriNetUnfolder]: 23/78 cut-off events. [2022-11-23 02:12:12,247 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-11-23 02:12:12,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 78 events. 23/78 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 216 event pairs, 3 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 255. Up to 36 conditions per place. [2022-11-23 02:12:12,248 INFO L137 encePairwiseOnDemand]: 204/210 looper letters, 16 selfloop transitions, 3 changer transitions 18/37 dead transitions. [2022-11-23 02:12:12,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 229 flow [2022-11-23 02:12:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:12:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:12:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 568 transitions. [2022-11-23 02:12:12,252 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4507936507936508 [2022-11-23 02:12:12,252 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 568 transitions. [2022-11-23 02:12:12,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 568 transitions. [2022-11-23 02:12:12,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:12,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 568 transitions. [2022-11-23 02:12:12,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:12,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:12,258 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:12,258 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 93 flow. Second operand 6 states and 568 transitions. [2022-11-23 02:12:12,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 229 flow [2022-11-23 02:12:12,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:12:12,261 INFO L231 Difference]: Finished difference. Result has 38 places, 17 transitions, 78 flow [2022-11-23 02:12:12,261 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=17} [2022-11-23 02:12:12,262 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2022-11-23 02:12:12,262 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 17 transitions, 78 flow [2022-11-23 02:12:12,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:12,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:12,263 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:12,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:12:12,263 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1121999022, now seen corresponding path program 3 times [2022-11-23 02:12:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:12:12,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984890869] [2022-11-23 02:12:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:12:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:12,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:12:12,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984890869] [2022-11-23 02:12:12,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984890869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:12,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:12,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:12:12,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077826082] [2022-11-23 02:12:12,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:12,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:12:12,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:12:12,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:12:12,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:12:12,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2022-11-23 02:12:12,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 17 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:12,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:12,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2022-11-23 02:12:12,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:13,093 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-11-23 02:12:13,094 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-11-23 02:12:13,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 36 events. 6/36 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 120. Up to 18 conditions per place. [2022-11-23 02:12:13,095 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 14 selfloop transitions, 2 changer transitions 10/27 dead transitions. [2022-11-23 02:12:13,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 177 flow [2022-11-23 02:12:13,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:12:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:12:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-11-23 02:12:13,103 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4515873015873016 [2022-11-23 02:12:13,103 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 569 transitions. [2022-11-23 02:12:13,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 569 transitions. [2022-11-23 02:12:13,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:13,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 569 transitions. [2022-11-23 02:12:13,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:13,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:13,110 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:13,110 INFO L175 Difference]: Start difference. First operand has 38 places, 17 transitions, 78 flow. Second operand 6 states and 569 transitions. [2022-11-23 02:12:13,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 177 flow [2022-11-23 02:12:13,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 161 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-11-23 02:12:13,113 INFO L231 Difference]: Finished difference. Result has 38 places, 17 transitions, 77 flow [2022-11-23 02:12:13,113 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=30, 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=6, PETRI_FLOW=77, PETRI_PLACES=38, PETRI_TRANSITIONS=17} [2022-11-23 02:12:13,114 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2022-11-23 02:12:13,114 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 17 transitions, 77 flow [2022-11-23 02:12:13,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:13,115 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:13,115 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:13,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 02:12:13,115 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:13,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:13,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1078663036, now seen corresponding path program 4 times [2022-11-23 02:12:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:12:13,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756358920] [2022-11-23 02:12:13,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:13,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:12:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:12:13,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:12:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:12:13,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:12:13,275 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:12:13,277 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-23 02:12:13,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-23 02:12:13,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-23 02:12:13,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-23 02:12:13,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-23 02:12:13,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-23 02:12:13,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-23 02:12:13,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-23 02:12:13,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-23 02:12:13,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-23 02:12:13,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:12:13,283 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:13,289 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:12:13,289 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:12:13,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:12:13 BasicIcfg [2022-11-23 02:12:13,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:12:13,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:12:13,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:12:13,375 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:12:13,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:12:02" (3/4) ... [2022-11-23 02:12:13,378 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 02:12:13,378 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:12:13,379 INFO L158 Benchmark]: Toolchain (without parser) took 12455.42ms. Allocated memory was 115.3MB in the beginning and 243.3MB in the end (delta: 127.9MB). Free memory was 70.7MB in the beginning and 139.9MB in the end (delta: -69.2MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2022-11-23 02:12:13,379 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 115.3MB. Free memory was 83.5MB in the beginning and 83.5MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:12:13,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.49ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 70.3MB in the beginning and 136.6MB in the end (delta: -66.3MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2022-11-23 02:12:13,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.04ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 136.3MB in the end (delta: 181.5kB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2022-11-23 02:12:13,380 INFO L158 Benchmark]: Boogie Preprocessor took 66.55ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 134.2MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 02:12:13,380 INFO L158 Benchmark]: RCFGBuilder took 1035.00ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 104.9MB in the end (delta: 29.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-23 02:12:13,384 INFO L158 Benchmark]: TraceAbstraction took 10495.09ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 103.8MB in the beginning and 139.9MB in the end (delta: -36.1MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2022-11-23 02:12:13,384 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 243.3MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:12:13,386 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 115.3MB. Free memory was 83.5MB in the beginning and 83.5MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.49ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 70.3MB in the beginning and 136.6MB in the end (delta: -66.3MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.04ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 136.3MB in the end (delta: 181.5kB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.55ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 134.2MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1035.00ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 104.9MB in the end (delta: 29.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10495.09ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 103.8MB in the beginning and 139.9MB in the end (delta: -36.1MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 243.3MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: 5.6s, 109 PlacesBefore, 30 PlacesAfterwards, 104 TransitionsBefore, 24 TransitionsAfterwards, 1316 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 2991 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1721, independent: 1595, independent conditional: 0, independent unconditional: 1595, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 981, independent: 939, independent conditional: 0, independent unconditional: 939, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 981, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 459, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 428, dependent conditional: 0, dependent unconditional: 428, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1721, independent: 656, independent conditional: 0, independent unconditional: 656, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 981, unknown conditional: 0, unknown unconditional: 981] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1649; [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649, ((void *)0), P0, ((void *)0))=-2, t1649={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1650; [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1650, ((void *)0), P1, ((void *)0))=-1, t1649={5:0}, t1650={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 z = 1 [L787] 2 __unbuffered_p1_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 __unbuffered_p1_EBX = x VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 x = 1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EAX = y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L793] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [#in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 19]: 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: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 125 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: 10.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 584 IncrementalHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 19 mSDtfsCounter, 584 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, InterpolantAutomatonStates: 41, 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.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 [2022-11-23 02:12:13,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/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_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 02:12:16,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:12:16,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:12:16,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:12:16,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:12:16,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:12:16,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:12:16,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:12:16,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:12:16,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:12:16,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:12:16,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:12:16,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:12:16,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:12:16,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:12:16,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:12:16,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:12:16,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:12:16,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:12:16,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:12:16,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:12:16,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:12:16,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:12:16,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:12:16,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:12:16,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:12:16,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:12:16,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:12:16,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:12:16,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:12:16,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:12:16,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:12:16,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:12:16,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:12:16,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:12:16,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:12:16,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:12:16,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:12:16,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:12:16,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:12:16,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:12:16,274 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 02:12:16,316 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:12:16,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:12:16,318 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:12:16,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:12:16,319 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:12:16,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:12:16,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:12:16,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:12:16,321 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:12:16,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:12:16,322 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:12:16,323 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:12:16,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:12:16,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:12:16,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:12:16,324 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:12:16,324 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:12:16,324 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:12:16,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:12:16,325 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:12:16,325 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 02:12:16,325 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 02:12:16,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:12:16,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:12:16,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:12:16,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:12:16,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:12:16,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:12:16,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:12:16,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:12:16,328 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 02:12:16,329 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 02:12:16,329 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:12:16,329 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:12:16,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:12:16,330 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 02:12:16,330 INFO L138 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_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/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_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 [2022-11-23 02:12:16,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:12:16,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:12:16,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:12:16,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:12:16,791 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:12:16,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/rfi004.i [2022-11-23 02:12:19,920 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:12:20,248 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:12:20,249 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/sv-benchmarks/c/pthread-wmm/rfi004.i [2022-11-23 02:12:20,264 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/data/6217606f9/30e92d6dcbd64bdc9b79650322457535/FLAGc6568958d [2022-11-23 02:12:20,512 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/data/6217606f9/30e92d6dcbd64bdc9b79650322457535 [2022-11-23 02:12:20,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:12:20,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:12:20,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:12:20,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:12:20,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:12:20,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:12:20" (1/1) ... [2022-11-23 02:12:20,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c95d67d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:20, skipping insertion in model container [2022-11-23 02:12:20,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:12:20" (1/1) ... [2022-11-23 02:12:20,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:12:20,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:12:20,781 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/sv-benchmarks/c/pthread-wmm/rfi004.i[983,996] [2022-11-23 02:12:21,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:12:21,035 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:12:21,055 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/sv-benchmarks/c/pthread-wmm/rfi004.i[983,996] [2022-11-23 02:12:21,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:12:21,249 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:12:21,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21 WrapperNode [2022-11-23 02:12:21,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:12:21,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:12:21,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:12:21,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:12:21,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (1/1) ... [2022-11-23 02:12:21,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (1/1) ... [2022-11-23 02:12:21,363 INFO L138 Inliner]: procedures = 178, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2022-11-23 02:12:21,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:12:21,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:12:21,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:12:21,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:12:21,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (1/1) ... [2022-11-23 02:12:21,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (1/1) ... [2022-11-23 02:12:21,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (1/1) ... [2022-11-23 02:12:21,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (1/1) ... [2022-11-23 02:12:21,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (1/1) ... [2022-11-23 02:12:21,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (1/1) ... [2022-11-23 02:12:21,438 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (1/1) ... [2022-11-23 02:12:21,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (1/1) ... [2022-11-23 02:12:21,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:12:21,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:12:21,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:12:21,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:12:21,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (1/1) ... [2022-11-23 02:12:21,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:12:21,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:12:21,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:12:21,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:12:21,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:12:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:12:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:12:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:12:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 02:12:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 02:12:21,569 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 02:12:21,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 02:12:21,569 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 02:12:21,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 02:12:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:12:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:12:21,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:12:21,572 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:12:21,771 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:12:21,785 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:12:22,279 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:12:22,524 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:12:22,524 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:12:22,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:12:22 BoogieIcfgContainer [2022-11-23 02:12:22,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:12:22,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:12:22,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:12:22,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:12:22,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:12:20" (1/3) ... [2022-11-23 02:12:22,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f64d871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:12:22, skipping insertion in model container [2022-11-23 02:12:22,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:21" (2/3) ... [2022-11-23 02:12:22,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f64d871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:12:22, skipping insertion in model container [2022-11-23 02:12:22,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:12:22" (3/3) ... [2022-11-23 02:12:22,539 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2022-11-23 02:12:22,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:12:22,558 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-23 02:12:22,558 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:12:22,638 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:12:22,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 224 flow [2022-11-23 02:12:22,757 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-11-23 02:12:22,758 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:12:22,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2022-11-23 02:12:22,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 107 transitions, 224 flow [2022-11-23 02:12:22,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 105 transitions, 216 flow [2022-11-23 02:12:22,788 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:12:22,817 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 216 flow [2022-11-23 02:12:22,826 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 216 flow [2022-11-23 02:12:22,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 216 flow [2022-11-23 02:12:22,866 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-11-23 02:12:22,866 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:12:22,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2022-11-23 02:12:22,868 INFO L119 LiptonReduction]: Number of co-enabled transitions 1316 [2022-11-23 02:12:31,082 INFO L134 LiptonReduction]: Checked pairs total: 3198 [2022-11-23 02:12:31,082 INFO L136 LiptonReduction]: Total number of compositions: 104 [2022-11-23 02:12:31,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:12:31,125 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;@1e76459d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:12:31,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-23 02:12:31,127 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 02:12:31,128 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:12:31,128 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:31,129 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 02:12:31,129 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:31,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash 461, now seen corresponding path program 1 times [2022-11-23 02:12:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:12:31,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644647022] [2022-11-23 02:12:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:31,149 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 [2022-11-23 02:12:31,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:12:31,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:12:31,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:31,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 02:12:31,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:12:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:31,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:12:31,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:12:31,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644647022] [2022-11-23 02:12:31,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644647022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:31,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:31,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 02:12:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830404217] [2022-11-23 02:12:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:31,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 02:12:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:12:31,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 02:12:31,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 02:12:31,290 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 211 [2022-11-23 02:12:31,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:31,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:31,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 211 [2022-11-23 02:12:31,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:31,541 INFO L130 PetriNetUnfolder]: 211/372 cut-off events. [2022-11-23 02:12:31,542 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-23 02:12:31,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 372 events. 211/372 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1424 event pairs, 211 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 740. Up to 365 conditions per place. [2022-11-23 02:12:31,563 INFO L137 encePairwiseOnDemand]: 207/211 looper letters, 17 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2022-11-23 02:12:31,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 76 flow [2022-11-23 02:12:31,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 02:12:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 02:12:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 215 transitions. [2022-11-23 02:12:31,594 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.509478672985782 [2022-11-23 02:12:31,600 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 215 transitions. [2022-11-23 02:12:31,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 215 transitions. [2022-11-23 02:12:31,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:31,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 215 transitions. [2022-11-23 02:12:31,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:31,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:31,668 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:31,670 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 2 states and 215 transitions. [2022-11-23 02:12:31,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 76 flow [2022-11-23 02:12:31,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:12:31,675 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2022-11-23 02:12:31,677 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, 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} [2022-11-23 02:12:31,680 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2022-11-23 02:12:31,687 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2022-11-23 02:12:31,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:31,687 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:31,688 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:12:31,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:31,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:12:31,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:31,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash 434963836, now seen corresponding path program 1 times [2022-11-23 02:12:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:12:31,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276668703] [2022-11-23 02:12:31,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:31,891 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 [2022-11-23 02:12:31,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:12:31,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:12:31,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:32,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:12:32,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:12:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:32,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:12:32,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:12:32,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276668703] [2022-11-23 02:12:32,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276668703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:32,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:32,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:12:32,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805083605] [2022-11-23 02:12:32,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:32,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:12:32,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:12:32,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:12:32,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:12:32,056 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 211 [2022-11-23 02:12:32,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:32,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:32,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 211 [2022-11-23 02:12:32,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:32,225 INFO L130 PetriNetUnfolder]: 173/326 cut-off events. [2022-11-23 02:12:32,225 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:12:32,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 326 events. 173/326 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1305 event pairs, 21 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 638. Up to 249 conditions per place. [2022-11-23 02:12:32,229 INFO L137 encePairwiseOnDemand]: 208/211 looper letters, 20 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2022-11-23 02:12:32,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 25 transitions, 102 flow [2022-11-23 02:12:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:12:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:12:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2022-11-23 02:12:32,233 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49447077409162715 [2022-11-23 02:12:32,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2022-11-23 02:12:32,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2022-11-23 02:12:32,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:32,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2022-11-23 02:12:32,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:32,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:32,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:32,240 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 313 transitions. [2022-11-23 02:12:32,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 25 transitions, 102 flow [2022-11-23 02:12:32,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:12:32,242 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2022-11-23 02:12:32,242 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, 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} [2022-11-23 02:12:32,243 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2022-11-23 02:12:32,243 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2022-11-23 02:12:32,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:32,244 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:32,244 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:32,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-23 02:12:32,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:12:32,456 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:32,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1388473160, now seen corresponding path program 1 times [2022-11-23 02:12:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:12:32,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450363875] [2022-11-23 02:12:32,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:32,458 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 [2022-11-23 02:12:32,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:12:32,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:12:32,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:32,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:12:32,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:12:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:32,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:12:32,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:12:32,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450363875] [2022-11-23 02:12:32,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450363875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:32,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:32,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:12:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712916108] [2022-11-23 02:12:32,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:32,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:12:32,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:12:32,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:12:32,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:12:32,644 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2022-11-23 02:12:32,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:32,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:32,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2022-11-23 02:12:32,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:32,838 INFO L130 PetriNetUnfolder]: 69/153 cut-off events. [2022-11-23 02:12:32,839 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-23 02:12:32,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 153 events. 69/153 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 515 event pairs, 14 based on Foata normal form. 20/165 useless extension candidates. Maximal degree in co-relation 326. Up to 79 conditions per place. [2022-11-23 02:12:32,841 INFO L137 encePairwiseOnDemand]: 206/211 looper letters, 21 selfloop transitions, 3 changer transitions 15/40 dead transitions. [2022-11-23 02:12:32,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 40 transitions, 174 flow [2022-11-23 02:12:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:12:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:12:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2022-11-23 02:12:32,846 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47962085308056873 [2022-11-23 02:12:32,847 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2022-11-23 02:12:32,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2022-11-23 02:12:32,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:32,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2022-11-23 02:12:32,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:32,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:32,855 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:32,855 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 5 states and 506 transitions. [2022-11-23 02:12:32,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 40 transitions, 174 flow [2022-11-23 02:12:32,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:12:32,857 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 63 flow [2022-11-23 02:12:32,858 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, 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} [2022-11-23 02:12:32,858 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-11-23 02:12:32,859 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 63 flow [2022-11-23 02:12:32,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:32,860 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:32,860 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:32,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:33,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:12:33,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:33,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1153325033, now seen corresponding path program 1 times [2022-11-23 02:12:33,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:12:33,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977578781] [2022-11-23 02:12:33,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:33,074 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 [2022-11-23 02:12:33,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:12:33,080 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:12:33,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:33,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:12:33,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:12:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:33,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:12:33,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:12:33,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977578781] [2022-11-23 02:12:33,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977578781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:33,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:33,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:12:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717334935] [2022-11-23 02:12:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:33,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:12:33,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:12:33,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:12:33,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:12:33,322 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2022-11-23 02:12:33,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:33,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:33,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2022-11-23 02:12:33,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:33,525 INFO L130 PetriNetUnfolder]: 24/68 cut-off events. [2022-11-23 02:12:33,525 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-23 02:12:33,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 68 events. 24/68 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 151 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 180. Up to 29 conditions per place. [2022-11-23 02:12:33,526 INFO L137 encePairwiseOnDemand]: 206/211 looper letters, 19 selfloop transitions, 5 changer transitions 8/33 dead transitions. [2022-11-23 02:12:33,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 169 flow [2022-11-23 02:12:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:12:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:12:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 592 transitions. [2022-11-23 02:12:33,531 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4676145339652449 [2022-11-23 02:12:33,531 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 592 transitions. [2022-11-23 02:12:33,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 592 transitions. [2022-11-23 02:12:33,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:33,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 592 transitions. [2022-11-23 02:12:33,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:33,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:33,542 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:33,543 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 63 flow. Second operand 6 states and 592 transitions. [2022-11-23 02:12:33,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 169 flow [2022-11-23 02:12:33,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 156 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-23 02:12:33,547 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 74 flow [2022-11-23 02:12:33,547 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, 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} [2022-11-23 02:12:33,549 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-11-23 02:12:33,550 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 74 flow [2022-11-23 02:12:33,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:33,551 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:33,552 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:33,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:33,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:12:33,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:33,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1495002115, now seen corresponding path program 1 times [2022-11-23 02:12:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:12:33,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565273696] [2022-11-23 02:12:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:33,774 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 [2022-11-23 02:12:33,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:12:33,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:12:33,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:33,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:12:33,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:12:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:33,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:12:33,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:12:33,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565273696] [2022-11-23 02:12:33,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565273696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:33,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:33,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:12:33,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084007684] [2022-11-23 02:12:33,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:33,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:12:33,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:12:33,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:12:33,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:12:33,965 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2022-11-23 02:12:33,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:33,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:33,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2022-11-23 02:12:33,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:34,122 INFO L130 PetriNetUnfolder]: 24/73 cut-off events. [2022-11-23 02:12:34,123 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-11-23 02:12:34,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 73 events. 24/73 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 189 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 208. Up to 46 conditions per place. [2022-11-23 02:12:34,124 INFO L137 encePairwiseOnDemand]: 208/211 looper letters, 32 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-11-23 02:12:34,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 211 flow [2022-11-23 02:12:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:12:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:12:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 403 transitions. [2022-11-23 02:12:34,128 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4774881516587678 [2022-11-23 02:12:34,128 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 403 transitions. [2022-11-23 02:12:34,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 403 transitions. [2022-11-23 02:12:34,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:34,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 403 transitions. [2022-11-23 02:12:34,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:34,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:34,134 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:34,135 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 74 flow. Second operand 4 states and 403 transitions. [2022-11-23 02:12:34,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 211 flow [2022-11-23 02:12:34,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 180 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-11-23 02:12:34,138 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 71 flow [2022-11-23 02:12:34,138 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-11-23 02:12:34,139 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-11-23 02:12:34,140 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 71 flow [2022-11-23 02:12:34,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:34,141 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:34,141 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:34,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:34,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:12:34,355 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:34,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:34,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1276097349, now seen corresponding path program 2 times [2022-11-23 02:12:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:12:34,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311577401] [2022-11-23 02:12:34,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:12:34,356 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 [2022-11-23 02:12:34,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:12:34,357 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:12:34,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:34,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 02:12:34,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:12:34,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 02:12:34,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:12:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:34,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:12:34,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:12:34,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311577401] [2022-11-23 02:12:34,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311577401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:34,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:34,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:12:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318264119] [2022-11-23 02:12:34,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:34,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:12:34,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:12:34,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:12:34,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:12:34,690 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 211 [2022-11-23 02:12:34,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:34,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:34,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 211 [2022-11-23 02:12:34,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:34,872 INFO L130 PetriNetUnfolder]: 22/85 cut-off events. [2022-11-23 02:12:34,873 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-11-23 02:12:34,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 85 events. 22/85 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 245 event pairs, 6 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 243. Up to 24 conditions per place. [2022-11-23 02:12:34,874 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 24 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2022-11-23 02:12:34,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 187 flow [2022-11-23 02:12:34,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:12:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:12:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 664 transitions. [2022-11-23 02:12:34,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44955991875423157 [2022-11-23 02:12:34,878 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 664 transitions. [2022-11-23 02:12:34,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 664 transitions. [2022-11-23 02:12:34,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:34,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 664 transitions. [2022-11-23 02:12:34,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:34,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:34,885 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:34,885 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 71 flow. Second operand 7 states and 664 transitions. [2022-11-23 02:12:34,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 187 flow [2022-11-23 02:12:34,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:12:34,888 INFO L231 Difference]: Finished difference. Result has 38 places, 21 transitions, 94 flow [2022-11-23 02:12:34,888 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2022-11-23 02:12:34,889 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2022-11-23 02:12:34,889 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 94 flow [2022-11-23 02:12:34,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:34,890 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:34,890 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:34,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:35,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:12:35,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:35,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:35,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1214743444, now seen corresponding path program 1 times [2022-11-23 02:12:35,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:12:35,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880470073] [2022-11-23 02:12:35,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:12:35,106 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 [2022-11-23 02:12:35,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:12:35,107 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:12:35,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:12:35,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 02:12:35,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:12:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:12:35,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:12:35,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:12:35,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880470073] [2022-11-23 02:12:35,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880470073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:12:35,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:12:35,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:12:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290013525] [2022-11-23 02:12:35,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:12:35,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:12:35,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:12:35,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:12:35,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:12:35,707 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 211 [2022-11-23 02:12:35,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:35,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:12:35,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 211 [2022-11-23 02:12:35,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:12:35,838 INFO L130 PetriNetUnfolder]: 22/81 cut-off events. [2022-11-23 02:12:35,838 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-11-23 02:12:35,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 81 events. 22/81 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 229 event pairs, 5 based on Foata normal form. 4/85 useless extension candidates. Maximal degree in co-relation 268. Up to 72 conditions per place. [2022-11-23 02:12:35,839 INFO L137 encePairwiseOnDemand]: 208/211 looper letters, 14 selfloop transitions, 2 changer transitions 6/23 dead transitions. [2022-11-23 02:12:35,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 23 transitions, 148 flow [2022-11-23 02:12:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:12:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:12:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2022-11-23 02:12:35,842 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42417061611374407 [2022-11-23 02:12:35,842 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 358 transitions. [2022-11-23 02:12:35,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 358 transitions. [2022-11-23 02:12:35,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:12:35,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 358 transitions. [2022-11-23 02:12:35,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:35,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:35,847 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:35,847 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 94 flow. Second operand 4 states and 358 transitions. [2022-11-23 02:12:35,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 23 transitions, 148 flow [2022-11-23 02:12:35,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 23 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 02:12:35,850 INFO L231 Difference]: Finished difference. Result has 37 places, 17 transitions, 74 flow [2022-11-23 02:12:35,850 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=37, PETRI_TRANSITIONS=17} [2022-11-23 02:12:35,851 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2022-11-23 02:12:35,851 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 17 transitions, 74 flow [2022-11-23 02:12:35,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:12:35,852 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:12:35,852 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:12:35,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:36,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:12:36,078 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 02:12:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:12:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash -813742189, now seen corresponding path program 3 times [2022-11-23 02:12:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:12:36,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558115644] [2022-11-23 02:12:36,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:12:36,081 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 [2022-11-23 02:12:36,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:12:36,082 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:12:36,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:36,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 02:12:36,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 02:12:36,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:12:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:12:36,357 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-23 02:12:36,358 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:12:36,359 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-23 02:12:36,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-23 02:12:36,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-23 02:12:36,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-23 02:12:36,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-23 02:12:36,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-23 02:12:36,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-23 02:12:36,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-23 02:12:36,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-23 02:12:36,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-23 02:12:36,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:12:36,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:12:36,584 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-11-23 02:12:36,591 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:12:36,592 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:12:36,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:12:36 BasicIcfg [2022-11-23 02:12:36,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:12:36,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:12:36,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:12:36,647 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:12:36,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:12:22" (3/4) ... [2022-11-23 02:12:36,663 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 02:12:36,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:12:36,664 INFO L158 Benchmark]: Toolchain (without parser) took 16146.12ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 67.2MB in the beginning and 54.6MB in the end (delta: 12.6MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2022-11-23 02:12:36,664 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 62.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:12:36,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.23ms. Allocated memory is still 90.2MB. Free memory was 67.2MB in the beginning and 68.2MB in the end (delta: -987.4kB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2022-11-23 02:12:36,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.42ms. Allocated memory is still 90.2MB. Free memory was 68.2MB in the beginning and 65.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:12:36,665 INFO L158 Benchmark]: Boogie Preprocessor took 85.31ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 63.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:12:36,666 INFO L158 Benchmark]: RCFGBuilder took 1071.88ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 61.6MB in the end (delta: 2.0MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2022-11-23 02:12:36,667 INFO L158 Benchmark]: TraceAbstraction took 14115.71ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 61.1MB in the beginning and 55.6MB in the end (delta: 5.5MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2022-11-23 02:12:36,667 INFO L158 Benchmark]: Witness Printer took 16.40ms. Allocated memory is still 132.1MB. Free memory was 55.6MB in the beginning and 54.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:12:36,669 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 62.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.23ms. Allocated memory is still 90.2MB. Free memory was 67.2MB in the beginning and 68.2MB in the end (delta: -987.4kB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.42ms. Allocated memory is still 90.2MB. Free memory was 68.2MB in the beginning and 65.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.31ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 63.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1071.88ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 61.6MB in the end (delta: 2.0MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14115.71ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 61.1MB in the beginning and 55.6MB in the end (delta: 5.5MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * Witness Printer took 16.40ms. Allocated memory is still 132.1MB. Free memory was 55.6MB in the beginning and 54.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation 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: 8.3s, 110 PlacesBefore, 29 PlacesAfterwards, 105 TransitionsBefore, 22 TransitionsAfterwards, 1316 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 3198 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1813, independent: 1674, independent conditional: 0, independent unconditional: 1674, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1021, independent: 976, independent conditional: 0, independent unconditional: 976, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1021, independent: 969, independent conditional: 0, independent unconditional: 969, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 399, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 361, dependent conditional: 0, dependent unconditional: 361, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1813, independent: 698, independent conditional: 0, independent unconditional: 698, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 1021, unknown conditional: 0, unknown unconditional: 1021] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1649; [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649, ((void *)0), P0, ((void *)0))=-1, t1649={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1650; [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1650, ((void *)0), P1, ((void *)0))=0, t1649={3:0}, t1650={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 z = 1 [L787] 2 __unbuffered_p1_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 __unbuffered_p1_EBX = x VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 x = 1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EAX = y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L793] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={3:0}, t1650={7:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [#in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 19]: 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: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 126 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: 13.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 474 IncrementalHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 7 mSDtfsCounter, 474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 61 ConstructedInterpolants, 12 QuantifiedInterpolants, 502 SizeOfPredicates, 9 NumberOfNonLiveVariables, 670 ConjunctsInSsa, 44 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 [2022-11-23 02:12:36,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c9d9df2-d865-468f-add6-f328eb3fd8eb/bin/uautomizer-QkZJyEgLgS/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