./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN --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 a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 --- 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-6b4ec56 [2022-11-20 12:35:34,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:35:34,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:35:34,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:35:34,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:35:34,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:35:34,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:35:34,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:35:34,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:35:34,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:35:34,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:35:34,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:35:34,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:35:34,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:35:34,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:35:34,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:35:34,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:35:34,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:35:34,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:35:34,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:35:34,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:35:34,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:35:34,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:35:34,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:35:34,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:35:34,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:35:34,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:35:34,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:35:34,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:35:34,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:35:34,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:35:34,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:35:34,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:35:34,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:35:34,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:35:34,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:35:34,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:35:34,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:35:34,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:35:34,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:35:34,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:35:34,944 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 12:35:35,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:35:35,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:35:35,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:35:35,015 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:35:35,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:35:35,016 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:35:35,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:35:35,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:35:35,018 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:35:35,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:35:35,019 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:35:35,019 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:35:35,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:35:35,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:35:35,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:35:35,021 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 12:35:35,021 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 12:35:35,021 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 12:35:35,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:35:35,022 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 12:35:35,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:35:35,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:35:35,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:35:35,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:35:35,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:35:35,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:35:35,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:35:35,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:35:35,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:35:35,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:35:35,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN 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 -> a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 [2022-11-20 12:35:35,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:35:35,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:35:35,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:35:35,370 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:35:35,370 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:35:35,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2022-11-20 12:35:38,518 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:35:38,877 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:35:38,878 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2022-11-20 12:35:38,893 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/data/4e0cc8205/d7aab71acbd4426ebaff9cf58d4db162/FLAG7159b22ee [2022-11-20 12:35:38,910 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/data/4e0cc8205/d7aab71acbd4426ebaff9cf58d4db162 [2022-11-20 12:35:38,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:35:38,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:35:38,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:35:38,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:35:38,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:35:38,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:35:38" (1/1) ... [2022-11-20 12:35:38,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bc5288c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:38, skipping insertion in model container [2022-11-20 12:35:38,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:35:38" (1/1) ... [2022-11-20 12:35:38,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:35:38,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:35:39,146 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_33983606-e6d8-4b3c-b8eb-6898f11b6455/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i[995,1008] [2022-11-20 12:35:39,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:35:39,494 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:35:39,510 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_33983606-e6d8-4b3c-b8eb-6898f11b6455/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i[995,1008] [2022-11-20 12:35:39,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:35:39,666 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:35:39,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39 WrapperNode [2022-11-20 12:35:39,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:35:39,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:35:39,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:35:39,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:35:39,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (1/1) ... [2022-11-20 12:35:39,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (1/1) ... [2022-11-20 12:35:39,768 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 152 [2022-11-20 12:35:39,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:35:39,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:35:39,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:35:39,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:35:39,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (1/1) ... [2022-11-20 12:35:39,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (1/1) ... [2022-11-20 12:35:39,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (1/1) ... [2022-11-20 12:35:39,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (1/1) ... [2022-11-20 12:35:39,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (1/1) ... [2022-11-20 12:35:39,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (1/1) ... [2022-11-20 12:35:39,849 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (1/1) ... [2022-11-20 12:35:39,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (1/1) ... [2022-11-20 12:35:39,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:35:39,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:35:39,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:35:39,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:35:39,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (1/1) ... [2022-11-20 12:35:39,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:35:39,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:35:39,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:35:39,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:35:39,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:35:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:35:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:35:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:35:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:35:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:35:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:35:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:35:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:35:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:35:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 12:35:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 12:35:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 12:35:39,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 12:35:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:35:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:35:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:35:39,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:35:39,960 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:35:40,135 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:35:40,138 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:35:40,830 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:35:41,564 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:35:41,565 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:35:41,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:35:41 BoogieIcfgContainer [2022-11-20 12:35:41,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:35:41,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:35:41,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:35:41,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:35:41,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:35:38" (1/3) ... [2022-11-20 12:35:41,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8ae6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:35:41, skipping insertion in model container [2022-11-20 12:35:41,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:39" (2/3) ... [2022-11-20 12:35:41,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8ae6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:35:41, skipping insertion in model container [2022-11-20 12:35:41,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:35:41" (3/3) ... [2022-11-20 12:35:41,580 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2022-11-20 12:35:41,603 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:35:41,603 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-11-20 12:35:41,603 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:35:41,842 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:35:41,891 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 12:35:41,911 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 202 transitions, 424 flow [2022-11-20 12:35:41,916 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 202 transitions, 424 flow [2022-11-20 12:35:41,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 202 transitions, 424 flow [2022-11-20 12:35:42,057 INFO L130 PetriNetUnfolder]: 2/198 cut-off events. [2022-11-20 12:35:42,057 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:35:42,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 198 events. 2/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 283 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-11-20 12:35:42,072 INFO L119 LiptonReduction]: Number of co-enabled transitions 8980 [2022-11-20 12:36:17,199 INFO L134 LiptonReduction]: Checked pairs total: 28961 [2022-11-20 12:36:17,199 INFO L136 LiptonReduction]: Total number of compositions: 190 [2022-11-20 12:36:17,209 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 84 transitions, 188 flow [2022-11-20 12:36:24,199 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 158768 states, 144334 states have (on average 4.86396829575845) internal successors, (702036), 158767 states have internal predecessors, (702036), 0 states have call successors, (0), 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-20 12:36:24,258 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:36:24,290 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=FINITE_AUTOMATA, 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;@7be79a56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:36:24,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2022-11-20 12:36:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 158768 states, 144334 states have (on average 4.86396829575845) internal successors, (702036), 158767 states have internal predecessors, (702036), 0 states have call successors, (0), 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-20 12:36:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 12:36:24,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:24,607 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 12:36:24,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:24,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1200, now seen corresponding path program 1 times [2022-11-20 12:36:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:24,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003943627] [2022-11-20 12:36:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:24,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:24,804 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-20 12:36:24,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:24,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003943627] [2022-11-20 12:36:24,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003943627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:24,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:24,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 12:36:24,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157991949] [2022-11-20 12:36:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:24,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:36:24,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:24,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:36:24,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:36:25,582 INFO L87 Difference]: Start difference. First operand has 158768 states, 144334 states have (on average 4.86396829575845) internal successors, (702036), 158767 states have internal predecessors, (702036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-20 12:36:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:26,250 INFO L93 Difference]: Finished difference Result 14186 states and 58394 transitions. [2022-11-20 12:36:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:36:26,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-20 12:36:26,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:26,490 INFO L225 Difference]: With dead ends: 14186 [2022-11-20 12:36:26,490 INFO L226 Difference]: Without dead ends: 14186 [2022-11-20 12:36:26,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:36:26,495 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:26,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:36:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14186 states. [2022-11-20 12:36:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14186 to 14186. [2022-11-20 12:36:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14186 states, 13782 states have (on average 4.236975765491221) internal successors, (58394), 14185 states have internal predecessors, (58394), 0 states have call successors, (0), 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-20 12:36:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 58394 transitions. [2022-11-20 12:36:28,062 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 58394 transitions. Word has length 1 [2022-11-20 12:36:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:28,063 INFO L495 AbstractCegarLoop]: Abstraction has 14186 states and 58394 transitions. [2022-11-20 12:36:28,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-20 12:36:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 58394 transitions. [2022-11-20 12:36:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 12:36:28,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:28,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 12:36:28,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:36:28,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:28,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1183666, now seen corresponding path program 1 times [2022-11-20 12:36:28,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:28,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513668051] [2022-11-20 12:36:28,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:28,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:28,338 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-20 12:36:28,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:28,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513668051] [2022-11-20 12:36:28,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513668051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:28,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:28,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:36:28,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374164259] [2022-11-20 12:36:28,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:28,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:36:28,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:36:28,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:36:28,347 INFO L87 Difference]: Start difference. First operand 14186 states and 58394 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 12:36:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:28,681 INFO L93 Difference]: Finished difference Result 11330 states and 42881 transitions. [2022-11-20 12:36:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:36:28,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 12:36:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:28,760 INFO L225 Difference]: With dead ends: 11330 [2022-11-20 12:36:28,760 INFO L226 Difference]: Without dead ends: 11312 [2022-11-20 12:36:28,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:36:28,762 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:28,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:36:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11312 states. [2022-11-20 12:36:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11312 to 9788. [2022-11-20 12:36:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9788 states, 9659 states have (on average 4.052593436173517) internal successors, (39144), 9787 states have internal predecessors, (39144), 0 states have call successors, (0), 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-20 12:36:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9788 states to 9788 states and 39144 transitions. [2022-11-20 12:36:29,367 INFO L78 Accepts]: Start accepts. Automaton has 9788 states and 39144 transitions. Word has length 3 [2022-11-20 12:36:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:29,367 INFO L495 AbstractCegarLoop]: Abstraction has 9788 states and 39144 transitions. [2022-11-20 12:36:29,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 12:36:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 9788 states and 39144 transitions. [2022-11-20 12:36:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 12:36:29,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:29,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 12:36:29,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:36:29,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1183667, now seen corresponding path program 1 times [2022-11-20 12:36:29,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:29,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321953270] [2022-11-20 12:36:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:29,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:29,499 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-20 12:36:29,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:29,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321953270] [2022-11-20 12:36:29,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321953270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:29,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:29,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:36:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178442306] [2022-11-20 12:36:29,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:29,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:36:29,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:29,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:36:29,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:36:29,503 INFO L87 Difference]: Start difference. First operand 9788 states and 39144 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 12:36:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:29,673 INFO L93 Difference]: Finished difference Result 5519 states and 20718 transitions. [2022-11-20 12:36:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:36:29,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 12:36:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:29,706 INFO L225 Difference]: With dead ends: 5519 [2022-11-20 12:36:29,707 INFO L226 Difference]: Without dead ends: 5387 [2022-11-20 12:36:29,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:36:29,711 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:29,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:36:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2022-11-20 12:36:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5387. [2022-11-20 12:36:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5387 states, 5353 states have (on average 3.7861012516345975) internal successors, (20267), 5386 states have internal predecessors, (20267), 0 states have call successors, (0), 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-20 12:36:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5387 states to 5387 states and 20267 transitions. [2022-11-20 12:36:30,190 INFO L78 Accepts]: Start accepts. Automaton has 5387 states and 20267 transitions. Word has length 3 [2022-11-20 12:36:30,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:30,191 INFO L495 AbstractCegarLoop]: Abstraction has 5387 states and 20267 transitions. [2022-11-20 12:36:30,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 12:36:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 20267 transitions. [2022-11-20 12:36:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 12:36:30,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:30,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:30,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:36:30,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1147816345, now seen corresponding path program 1 times [2022-11-20 12:36:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:30,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355219356] [2022-11-20 12:36:30,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:30,406 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-20 12:36:30,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:30,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355219356] [2022-11-20 12:36:30,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355219356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:30,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:30,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:36:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002614220] [2022-11-20 12:36:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:30,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:36:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:36:30,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:36:30,415 INFO L87 Difference]: Start difference. First operand 5387 states and 20267 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-20 12:36:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:30,672 INFO L93 Difference]: Finished difference Result 5291 states and 19867 transitions. [2022-11-20 12:36:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:36:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 12:36:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:30,710 INFO L225 Difference]: With dead ends: 5291 [2022-11-20 12:36:30,711 INFO L226 Difference]: Without dead ends: 5291 [2022-11-20 12:36:30,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:36:30,714 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:30,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:36:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2022-11-20 12:36:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 5291. [2022-11-20 12:36:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 5257 states have (on average 3.7791516073806353) internal successors, (19867), 5290 states have internal predecessors, (19867), 0 states have call successors, (0), 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-20 12:36:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 19867 transitions. [2022-11-20 12:36:30,962 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 19867 transitions. Word has length 13 [2022-11-20 12:36:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:30,964 INFO L495 AbstractCegarLoop]: Abstraction has 5291 states and 19867 transitions. [2022-11-20 12:36:30,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-20 12:36:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 19867 transitions. [2022-11-20 12:36:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:36:30,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:30,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:30,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:36:30,976 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:30,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash 642886634, now seen corresponding path program 1 times [2022-11-20 12:36:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:30,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476819009] [2022-11-20 12:36:30,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:30,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:31,982 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-20 12:36:31,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:31,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476819009] [2022-11-20 12:36:31,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476819009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:31,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:31,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:36:31,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583202173] [2022-11-20 12:36:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:31,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:36:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:36:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:36:31,991 INFO L87 Difference]: Start difference. First operand 5291 states and 19867 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 12:36:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:32,263 INFO L93 Difference]: Finished difference Result 5147 states and 19315 transitions. [2022-11-20 12:36:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:36:32,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:36:32,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:32,302 INFO L225 Difference]: With dead ends: 5147 [2022-11-20 12:36:32,462 INFO L226 Difference]: Without dead ends: 5147 [2022-11-20 12:36:32,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:36:32,464 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:32,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 3 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:36:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5147 states. [2022-11-20 12:36:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5147 to 5147. [2022-11-20 12:36:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5147 states, 5114 states have (on average 3.776886976926085) internal successors, (19315), 5146 states have internal predecessors, (19315), 0 states have call successors, (0), 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-20 12:36:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 19315 transitions. [2022-11-20 12:36:32,647 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 19315 transitions. Word has length 14 [2022-11-20 12:36:32,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:32,647 INFO L495 AbstractCegarLoop]: Abstraction has 5147 states and 19315 transitions. [2022-11-20 12:36:32,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 12:36:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 19315 transitions. [2022-11-20 12:36:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:36:32,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:32,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:32,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:36:32,651 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:32,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash 642886635, now seen corresponding path program 1 times [2022-11-20 12:36:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:32,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764873548] [2022-11-20 12:36:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:32,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:33,789 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-20 12:36:33,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:33,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764873548] [2022-11-20 12:36:33,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764873548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:33,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:33,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:36:33,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832785883] [2022-11-20 12:36:33,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:33,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:36:33,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:33,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:36:33,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:36:33,794 INFO L87 Difference]: Start difference. First operand 5147 states and 19315 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 12:36:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:34,053 INFO L93 Difference]: Finished difference Result 5003 states and 18763 transitions. [2022-11-20 12:36:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:36:34,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:36:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:34,085 INFO L225 Difference]: With dead ends: 5003 [2022-11-20 12:36:34,085 INFO L226 Difference]: Without dead ends: 5003 [2022-11-20 12:36:34,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:36:34,089 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 60 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:34,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 4 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:36:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2022-11-20 12:36:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 5003. [2022-11-20 12:36:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5003 states, 4971 states have (on average 3.774492053912694) internal successors, (18763), 5002 states have internal predecessors, (18763), 0 states have call successors, (0), 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-20 12:36:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5003 states to 5003 states and 18763 transitions. [2022-11-20 12:36:34,381 INFO L78 Accepts]: Start accepts. Automaton has 5003 states and 18763 transitions. Word has length 14 [2022-11-20 12:36:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:34,382 INFO L495 AbstractCegarLoop]: Abstraction has 5003 states and 18763 transitions. [2022-11-20 12:36:34,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 12:36:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 5003 states and 18763 transitions. [2022-11-20 12:36:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:36:34,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:34,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:34,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:36:34,384 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:34,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1222561933, now seen corresponding path program 1 times [2022-11-20 12:36:34,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:34,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745792417] [2022-11-20 12:36:34,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:34,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:34,634 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-20 12:36:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:34,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745792417] [2022-11-20 12:36:34,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745792417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:34,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:34,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:36:34,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903664161] [2022-11-20 12:36:34,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:34,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:36:34,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:34,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:36:34,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:36:34,637 INFO L87 Difference]: Start difference. First operand 5003 states and 18763 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 12:36:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:34,840 INFO L93 Difference]: Finished difference Result 4955 states and 18563 transitions. [2022-11-20 12:36:34,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:36:34,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:36:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:34,866 INFO L225 Difference]: With dead ends: 4955 [2022-11-20 12:36:34,866 INFO L226 Difference]: Without dead ends: 4955 [2022-11-20 12:36:34,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:36:34,867 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:34,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:36:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2022-11-20 12:36:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 4955. [2022-11-20 12:36:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4955 states, 4923 states have (on average 3.7706682916920577) internal successors, (18563), 4954 states have internal predecessors, (18563), 0 states have call successors, (0), 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-20 12:36:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 18563 transitions. [2022-11-20 12:36:35,038 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 18563 transitions. Word has length 14 [2022-11-20 12:36:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:35,039 INFO L495 AbstractCegarLoop]: Abstraction has 4955 states and 18563 transitions. [2022-11-20 12:36:35,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 12:36:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 18563 transitions. [2022-11-20 12:36:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 12:36:35,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:35,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:35,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:36:35,041 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:35,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash -755288694, now seen corresponding path program 1 times [2022-11-20 12:36:35,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:35,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225166430] [2022-11-20 12:36:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:35,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:35,210 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-20 12:36:35,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:35,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225166430] [2022-11-20 12:36:35,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225166430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:35,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:35,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:36:35,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830788630] [2022-11-20 12:36:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:35,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:36:35,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:35,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:36:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:36:35,213 INFO L87 Difference]: Start difference. First operand 4955 states and 18563 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-20 12:36:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:35,484 INFO L93 Difference]: Finished difference Result 7339 states and 26985 transitions. [2022-11-20 12:36:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:36:35,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 12:36:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:35,521 INFO L225 Difference]: With dead ends: 7339 [2022-11-20 12:36:35,522 INFO L226 Difference]: Without dead ends: 7339 [2022-11-20 12:36:35,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:36:35,523 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 80 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:35,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 2 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:36:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2022-11-20 12:36:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 5267. [2022-11-20 12:36:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 5235 states have (on average 3.749570200573066) internal successors, (19629), 5266 states have internal predecessors, (19629), 0 states have call successors, (0), 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-20 12:36:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 19629 transitions. [2022-11-20 12:36:35,725 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 19629 transitions. Word has length 15 [2022-11-20 12:36:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:35,726 INFO L495 AbstractCegarLoop]: Abstraction has 5267 states and 19629 transitions. [2022-11-20 12:36:35,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-20 12:36:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 19629 transitions. [2022-11-20 12:36:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:36:35,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:35,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:35,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:36:35,729 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:35,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:35,730 INFO L85 PathProgramCache]: Analyzing trace with hash 620261286, now seen corresponding path program 1 times [2022-11-20 12:36:35,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:35,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732598719] [2022-11-20 12:36:35,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:35,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:35,984 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-20 12:36:35,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:35,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732598719] [2022-11-20 12:36:35,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732598719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:35,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:35,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:36:35,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666834084] [2022-11-20 12:36:35,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:35,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:36:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:35,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:36:35,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:36:35,988 INFO L87 Difference]: Start difference. First operand 5267 states and 19629 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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-20 12:36:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:36,157 INFO L93 Difference]: Finished difference Result 5243 states and 19535 transitions. [2022-11-20 12:36:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:36:36,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:36:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:36,185 INFO L225 Difference]: With dead ends: 5243 [2022-11-20 12:36:36,186 INFO L226 Difference]: Without dead ends: 5243 [2022-11-20 12:36:36,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:36:36,187 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:36,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:36:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2022-11-20 12:36:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 5243. [2022-11-20 12:36:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5243 states, 5211 states have (on average 3.7488006140855883) internal successors, (19535), 5242 states have internal predecessors, (19535), 0 states have call successors, (0), 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-20 12:36:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 19535 transitions. [2022-11-20 12:36:36,360 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 19535 transitions. Word has length 16 [2022-11-20 12:36:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:36,360 INFO L495 AbstractCegarLoop]: Abstraction has 5243 states and 19535 transitions. [2022-11-20 12:36:36,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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-20 12:36:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 19535 transitions. [2022-11-20 12:36:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:36:36,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:36,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:36,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:36:36,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:36,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:36,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1939030970, now seen corresponding path program 1 times [2022-11-20 12:36:36,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:36,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485322253] [2022-11-20 12:36:36,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:36,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:36,532 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-20 12:36:36,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:36,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485322253] [2022-11-20 12:36:36,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485322253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:36,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:36,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:36:36,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187137519] [2022-11-20 12:36:36,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:36,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:36:36,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:36,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:36:36,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:36:36,535 INFO L87 Difference]: Start difference. First operand 5243 states and 19535 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-20 12:36:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:36,798 INFO L93 Difference]: Finished difference Result 5426 states and 19282 transitions. [2022-11-20 12:36:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:36:36,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:36:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:36,823 INFO L225 Difference]: With dead ends: 5426 [2022-11-20 12:36:36,823 INFO L226 Difference]: Without dead ends: 5426 [2022-11-20 12:36:36,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:36:36,824 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:36,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:36:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2022-11-20 12:36:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 4628. [2022-11-20 12:36:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4628 states, 4596 states have (on average 3.7173629242819843) internal successors, (17085), 4627 states have internal predecessors, (17085), 0 states have call successors, (0), 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-20 12:36:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4628 states to 4628 states and 17085 transitions. [2022-11-20 12:36:36,986 INFO L78 Accepts]: Start accepts. Automaton has 4628 states and 17085 transitions. Word has length 16 [2022-11-20 12:36:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:36,987 INFO L495 AbstractCegarLoop]: Abstraction has 4628 states and 17085 transitions. [2022-11-20 12:36:36,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-20 12:36:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4628 states and 17085 transitions. [2022-11-20 12:36:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 12:36:36,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:36,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:36,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:36:36,991 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:36,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash -765288523, now seen corresponding path program 1 times [2022-11-20 12:36:36,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:36,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067764632] [2022-11-20 12:36:36,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:36,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:39,434 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-20 12:36:39,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:39,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067764632] [2022-11-20 12:36:39,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067764632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:39,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:39,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:36:39,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499434763] [2022-11-20 12:36:39,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:39,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:36:39,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:39,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:36:39,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:36:39,436 INFO L87 Difference]: Start difference. First operand 4628 states and 17085 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 12:36:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:40,508 INFO L93 Difference]: Finished difference Result 5402 states and 19908 transitions. [2022-11-20 12:36:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:36:40,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 12:36:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:40,533 INFO L225 Difference]: With dead ends: 5402 [2022-11-20 12:36:40,533 INFO L226 Difference]: Without dead ends: 5402 [2022-11-20 12:36:40,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:36:40,535 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 75 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:40,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 20 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 12:36:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2022-11-20 12:36:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 4808. [2022-11-20 12:36:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4808 states, 4776 states have (on average 3.7047738693467336) internal successors, (17694), 4807 states have internal predecessors, (17694), 0 states have call successors, (0), 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-20 12:36:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4808 states to 4808 states and 17694 transitions. [2022-11-20 12:36:40,703 INFO L78 Accepts]: Start accepts. Automaton has 4808 states and 17694 transitions. Word has length 17 [2022-11-20 12:36:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:40,703 INFO L495 AbstractCegarLoop]: Abstraction has 4808 states and 17694 transitions. [2022-11-20 12:36:40,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 12:36:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4808 states and 17694 transitions. [2022-11-20 12:36:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 12:36:40,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:40,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:40,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:36:40,707 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash 509151211, now seen corresponding path program 2 times [2022-11-20 12:36:40,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:40,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105869194] [2022-11-20 12:36:40,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:40,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:44,171 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-20 12:36:44,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:44,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105869194] [2022-11-20 12:36:44,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105869194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:44,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:44,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:36:44,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245800653] [2022-11-20 12:36:44,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:44,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:36:44,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:44,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:36:44,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:36:44,174 INFO L87 Difference]: Start difference. First operand 4808 states and 17694 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 12:36:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:45,432 INFO L93 Difference]: Finished difference Result 5708 states and 20946 transitions. [2022-11-20 12:36:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:36:45,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 12:36:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:45,455 INFO L225 Difference]: With dead ends: 5708 [2022-11-20 12:36:45,455 INFO L226 Difference]: Without dead ends: 5690 [2022-11-20 12:36:45,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2022-11-20 12:36:45,456 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 131 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:45,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 20 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 12:36:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2022-11-20 12:36:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 4916. [2022-11-20 12:36:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4916 states, 4884 states have (on average 3.7407862407862407) internal successors, (18270), 4915 states have internal predecessors, (18270), 0 states have call successors, (0), 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-20 12:36:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4916 states to 4916 states and 18270 transitions. [2022-11-20 12:36:45,675 INFO L78 Accepts]: Start accepts. Automaton has 4916 states and 18270 transitions. Word has length 17 [2022-11-20 12:36:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:45,675 INFO L495 AbstractCegarLoop]: Abstraction has 4916 states and 18270 transitions. [2022-11-20 12:36:45,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 12:36:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4916 states and 18270 transitions. [2022-11-20 12:36:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 12:36:45,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:45,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:45,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:36:45,682 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:45,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2056382775, now seen corresponding path program 3 times [2022-11-20 12:36:45,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:45,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687064234] [2022-11-20 12:36:45,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:45,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:49,001 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-20 12:36:49,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:49,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687064234] [2022-11-20 12:36:49,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687064234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:49,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:49,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:36:49,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953756423] [2022-11-20 12:36:49,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:49,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:36:49,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:36:49,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:36:49,005 INFO L87 Difference]: Start difference. First operand 4916 states and 18270 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 12:36:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:50,209 INFO L93 Difference]: Finished difference Result 4898 states and 18201 transitions. [2022-11-20 12:36:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:36:50,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 12:36:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:50,231 INFO L225 Difference]: With dead ends: 4898 [2022-11-20 12:36:50,232 INFO L226 Difference]: Without dead ends: 4898 [2022-11-20 12:36:50,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:36:50,233 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 99 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:50,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 17 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:36:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4898 states. [2022-11-20 12:36:50,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4898 to 4838. [2022-11-20 12:36:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4838 states, 4806 states have (on average 3.7463587182688305) internal successors, (18005), 4837 states have internal predecessors, (18005), 0 states have call successors, (0), 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-20 12:36:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 18005 transitions. [2022-11-20 12:36:50,440 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 18005 transitions. Word has length 17 [2022-11-20 12:36:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:50,441 INFO L495 AbstractCegarLoop]: Abstraction has 4838 states and 18005 transitions. [2022-11-20 12:36:50,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 12:36:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 18005 transitions. [2022-11-20 12:36:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 12:36:50,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:50,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:50,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:36:50,447 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 19583352, now seen corresponding path program 1 times [2022-11-20 12:36:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:50,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160955414] [2022-11-20 12:36:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:50,860 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-20 12:36:50,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:50,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160955414] [2022-11-20 12:36:50,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160955414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:50,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:50,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:36:50,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488933078] [2022-11-20 12:36:50,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:50,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:36:50,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:50,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:36:50,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:36:50,862 INFO L87 Difference]: Start difference. First operand 4838 states and 18005 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 12:36:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:51,336 INFO L93 Difference]: Finished difference Result 4886 states and 17374 transitions. [2022-11-20 12:36:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:36:51,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 12:36:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:51,363 INFO L225 Difference]: With dead ends: 4886 [2022-11-20 12:36:51,364 INFO L226 Difference]: Without dead ends: 4886 [2022-11-20 12:36:51,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:36:51,365 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 98 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:51,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 10 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:36:51,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states. [2022-11-20 12:36:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4886 to 4223. [2022-11-20 12:36:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4223 states, 4191 states have (on average 3.7050823192555478) internal successors, (15528), 4222 states have internal predecessors, (15528), 0 states have call successors, (0), 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-20 12:36:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4223 states to 4223 states and 15528 transitions. [2022-11-20 12:36:51,571 INFO L78 Accepts]: Start accepts. Automaton has 4223 states and 15528 transitions. Word has length 17 [2022-11-20 12:36:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:51,571 INFO L495 AbstractCegarLoop]: Abstraction has 4223 states and 15528 transitions. [2022-11-20 12:36:51,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 12:36:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4223 states and 15528 transitions. [2022-11-20 12:36:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:36:51,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:51,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:51,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:36:51,578 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:51,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:51,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2045918114, now seen corresponding path program 1 times [2022-11-20 12:36:51,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:51,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947423534] [2022-11-20 12:36:51,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:51,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:51,957 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-20 12:36:51,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:51,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947423534] [2022-11-20 12:36:51,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947423534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:51,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:51,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:36:51,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645905958] [2022-11-20 12:36:51,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:51,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:36:51,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:51,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:36:51,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:36:51,960 INFO L87 Difference]: Start difference. First operand 4223 states and 15528 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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-20 12:36:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:52,111 INFO L93 Difference]: Finished difference Result 2905 states and 9554 transitions. [2022-11-20 12:36:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:36:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 12:36:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:52,123 INFO L225 Difference]: With dead ends: 2905 [2022-11-20 12:36:52,123 INFO L226 Difference]: Without dead ends: 2905 [2022-11-20 12:36:52,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:36:52,126 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:52,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:36:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2022-11-20 12:36:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2905. [2022-11-20 12:36:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2873 states have (on average 3.3254437869822486) internal successors, (9554), 2904 states have internal predecessors, (9554), 0 states have call successors, (0), 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-20 12:36:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 9554 transitions. [2022-11-20 12:36:52,239 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 9554 transitions. Word has length 18 [2022-11-20 12:36:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:52,241 INFO L495 AbstractCegarLoop]: Abstraction has 2905 states and 9554 transitions. [2022-11-20 12:36:52,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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-20 12:36:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 9554 transitions. [2022-11-20 12:36:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 12:36:52,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:52,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:52,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:36:52,248 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:52,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:52,249 INFO L85 PathProgramCache]: Analyzing trace with hash 971728528, now seen corresponding path program 1 times [2022-11-20 12:36:52,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:52,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051067660] [2022-11-20 12:36:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:52,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:52,626 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-20 12:36:52,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:52,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051067660] [2022-11-20 12:36:52,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051067660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:52,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:52,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:36:52,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091897928] [2022-11-20 12:36:52,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:52,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:36:52,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:52,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:36:52,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:36:52,632 INFO L87 Difference]: Start difference. First operand 2905 states and 9554 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 12:36:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:52,804 INFO L93 Difference]: Finished difference Result 1394 states and 3930 transitions. [2022-11-20 12:36:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:36:52,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 12:36:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:52,809 INFO L225 Difference]: With dead ends: 1394 [2022-11-20 12:36:52,809 INFO L226 Difference]: Without dead ends: 1394 [2022-11-20 12:36:52,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:36:52,811 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:52,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 5 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:36:52,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-11-20 12:36:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2022-11-20 12:36:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1368 states have (on average 2.8728070175438596) internal successors, (3930), 1393 states have internal predecessors, (3930), 0 states have call successors, (0), 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-20 12:36:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 3930 transitions. [2022-11-20 12:36:52,861 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 3930 transitions. Word has length 19 [2022-11-20 12:36:52,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:52,862 INFO L495 AbstractCegarLoop]: Abstraction has 1394 states and 3930 transitions. [2022-11-20 12:36:52,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 12:36:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 3930 transitions. [2022-11-20 12:36:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 12:36:52,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:52,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:52,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:36:52,867 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:52,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash 155105873, now seen corresponding path program 1 times [2022-11-20 12:36:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:52,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815416413] [2022-11-20 12:36:52,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:53,290 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-20 12:36:53,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:53,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815416413] [2022-11-20 12:36:53,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815416413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:53,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:53,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:36:53,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096941741] [2022-11-20 12:36:53,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:53,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:36:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:53,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:36:53,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:36:53,294 INFO L87 Difference]: Start difference. First operand 1394 states and 3930 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-20 12:36:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:53,530 INFO L93 Difference]: Finished difference Result 760 states and 2088 transitions. [2022-11-20 12:36:53,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:36:53,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 12:36:53,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:53,533 INFO L225 Difference]: With dead ends: 760 [2022-11-20 12:36:53,533 INFO L226 Difference]: Without dead ends: 760 [2022-11-20 12:36:53,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:36:53,534 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:53,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 6 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:36:53,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-11-20 12:36:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 688. [2022-11-20 12:36:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 676 states have (on average 2.7381656804733727) internal successors, (1851), 687 states have internal predecessors, (1851), 0 states have call successors, (0), 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-20 12:36:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1851 transitions. [2022-11-20 12:36:53,556 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1851 transitions. Word has length 21 [2022-11-20 12:36:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:53,556 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 1851 transitions. [2022-11-20 12:36:53,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-20 12:36:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1851 transitions. [2022-11-20 12:36:53,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 12:36:53,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:53,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:53,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:36:53,563 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:53,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash -506295314, now seen corresponding path program 1 times [2022-11-20 12:36:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:53,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022524080] [2022-11-20 12:36:53,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:53,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:54,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-20 12:36:54,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:54,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022524080] [2022-11-20 12:36:54,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022524080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:36:54,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:36:54,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:36:54,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104664482] [2022-11-20 12:36:54,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:36:54,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:36:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:54,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:36:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:36:54,049 INFO L87 Difference]: Start difference. First operand 688 states and 1851 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-20 12:36:54,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:54,257 INFO L93 Difference]: Finished difference Result 564 states and 1603 transitions. [2022-11-20 12:36:54,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:36:54,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 12:36:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:54,260 INFO L225 Difference]: With dead ends: 564 [2022-11-20 12:36:54,260 INFO L226 Difference]: Without dead ends: 564 [2022-11-20 12:36:54,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:36:54,261 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:54,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 6 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:36:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-20 12:36:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2022-11-20 12:36:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 562 states have (on average 2.8523131672597866) internal successors, (1603), 563 states have internal predecessors, (1603), 0 states have call successors, (0), 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-20 12:36:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1603 transitions. [2022-11-20 12:36:54,279 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1603 transitions. Word has length 23 [2022-11-20 12:36:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:54,279 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 1603 transitions. [2022-11-20 12:36:54,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-20 12:36:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1603 transitions. [2022-11-20 12:36:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 12:36:54,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:54,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:54,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 12:36:54,283 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:36:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:54,283 INFO L85 PathProgramCache]: Analyzing trace with hash 787049528, now seen corresponding path program 1 times [2022-11-20 12:36:54,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:54,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346707867] [2022-11-20 12:36:54,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:54,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:36:54,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:36:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:36:54,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:36:54,733 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:36:54,735 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2022-11-20 12:36:54,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2022-11-20 12:36:54,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2022-11-20 12:36:54,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2022-11-20 12:36:54,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2022-11-20 12:36:54,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2022-11-20 12:36:54,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2022-11-20 12:36:54,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2022-11-20 12:36:54,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2022-11-20 12:36:54,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2022-11-20 12:36:54,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2022-11-20 12:36:54,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2022-11-20 12:36:54,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2022-11-20 12:36:54,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2022-11-20 12:36:54,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2022-11-20 12:36:54,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2022-11-20 12:36:54,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2022-11-20 12:36:54,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2022-11-20 12:36:54,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2022-11-20 12:36:54,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2022-11-20 12:36:54,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2022-11-20 12:36:54,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2022-11-20 12:36:54,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2022-11-20 12:36:54,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2022-11-20 12:36:54,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2022-11-20 12:36:54,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2022-11-20 12:36:54,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2022-11-20 12:36:54,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2022-11-20 12:36:54,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2022-11-20 12:36:54,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2022-11-20 12:36:54,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2022-11-20 12:36:54,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2022-11-20 12:36:54,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2022-11-20 12:36:54,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2022-11-20 12:36:54,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2022-11-20 12:36:54,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2022-11-20 12:36:54,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2022-11-20 12:36:54,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2022-11-20 12:36:54,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2022-11-20 12:36:54,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2022-11-20 12:36:54,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2022-11-20 12:36:54,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2022-11-20 12:36:54,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2022-11-20 12:36:54,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2022-11-20 12:36:54,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2022-11-20 12:36:54,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2022-11-20 12:36:54,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2022-11-20 12:36:54,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2022-11-20 12:36:54,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2022-11-20 12:36:54,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (38 of 88 remaining) [2022-11-20 12:36:54,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 88 remaining) [2022-11-20 12:36:54,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 88 remaining) [2022-11-20 12:36:54,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 88 remaining) [2022-11-20 12:36:54,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 88 remaining) [2022-11-20 12:36:54,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2022-11-20 12:36:54,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2022-11-20 12:36:54,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2022-11-20 12:36:54,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2022-11-20 12:36:54,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2022-11-20 12:36:54,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 88 remaining) [2022-11-20 12:36:54,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2022-11-20 12:36:54,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2022-11-20 12:36:54,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2022-11-20 12:36:54,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2022-11-20 12:36:54,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2022-11-20 12:36:54,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2022-11-20 12:36:54,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2022-11-20 12:36:54,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2022-11-20 12:36:54,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2022-11-20 12:36:54,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2022-11-20 12:36:54,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2022-11-20 12:36:54,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2022-11-20 12:36:54,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2022-11-20 12:36:54,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2022-11-20 12:36:54,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2022-11-20 12:36:54,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2022-11-20 12:36:54,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2022-11-20 12:36:54,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2022-11-20 12:36:54,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2022-11-20 12:36:54,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2022-11-20 12:36:54,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2022-11-20 12:36:54,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2022-11-20 12:36:54,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2022-11-20 12:36:54,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2022-11-20 12:36:54,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2022-11-20 12:36:54,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2022-11-20 12:36:54,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2022-11-20 12:36:54,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2022-11-20 12:36:54,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 12:36:54,765 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:54,773 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:36:54,774 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:36:54,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:36:54 BasicIcfg [2022-11-20 12:36:54,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:36:54,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:36:54,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:36:54,959 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:36:54,959 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:35:41" (3/4) ... [2022-11-20 12:36:54,962 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 12:36:54,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:36:54,963 INFO L158 Benchmark]: Toolchain (without parser) took 76049.02ms. Allocated memory was 136.3MB in the beginning and 8.8GB in the end (delta: 8.6GB). Free memory was 107.2MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2022-11-20 12:36:54,964 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 100.7MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:36:54,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.96ms. Allocated memory is still 136.3MB. Free memory was 106.4MB in the beginning and 82.0MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 12:36:54,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.21ms. Allocated memory is still 136.3MB. Free memory was 82.0MB in the beginning and 79.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:36:54,965 INFO L158 Benchmark]: Boogie Preprocessor took 83.07ms. Allocated memory is still 136.3MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:36:54,965 INFO L158 Benchmark]: RCFGBuilder took 1712.20ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 77.0MB in the beginning and 65.6MB in the end (delta: 11.4MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2022-11-20 12:36:54,966 INFO L158 Benchmark]: TraceAbstraction took 73386.67ms. Allocated memory was 163.6MB in the beginning and 8.8GB in the end (delta: 8.6GB). Free memory was 64.6MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2022-11-20 12:36:54,967 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 8.8GB. Free memory was 5.1GB in the beginning and 5.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:36:54,972 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.25ms. Allocated memory is still 100.7MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 753.96ms. Allocated memory is still 136.3MB. Free memory was 106.4MB in the beginning and 82.0MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.21ms. Allocated memory is still 136.3MB. Free memory was 82.0MB in the beginning and 79.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.07ms. Allocated memory is still 136.3MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1712.20ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 77.0MB in the beginning and 65.6MB in the end (delta: 11.4MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * TraceAbstraction took 73386.67ms. Allocated memory was 163.6MB in the beginning and 8.8GB in the end (delta: 8.6GB). Free memory was 64.6MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 8.8GB. Free memory was 5.1GB in the beginning and 5.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.3s, 213 PlacesBefore, 96 PlacesAfterwards, 202 TransitionsBefore, 84 TransitionsAfterwards, 8980 CoEnabledTransitionPairs, 8 FixpointIterations, 70 TrivialSequentialCompositions, 112 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 190 TotalNumberOfCompositions, 28961 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14285, independent: 13852, independent conditional: 0, independent unconditional: 13852, dependent: 358, dependent conditional: 0, dependent unconditional: 358, unknown: 75, unknown conditional: 0, unknown unconditional: 75] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5738, independent: 5652, independent conditional: 0, independent unconditional: 5652, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5738, independent: 5060, independent conditional: 0, independent unconditional: 5060, dependent: 678, dependent conditional: 0, dependent unconditional: 678, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 678, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5696, independent: 2901, independent conditional: 0, independent unconditional: 2901, dependent: 2432, dependent conditional: 0, dependent unconditional: 2432, unknown: 363, unknown conditional: 0, unknown unconditional: 363] ], Cache Queries: [ total: 14285, independent: 8200, independent conditional: 0, independent unconditional: 8200, dependent: 281, dependent conditional: 0, dependent unconditional: 281, unknown: 5804, unknown conditional: 0, unknown unconditional: 5804] , Statistics on independence cache: Total cache size (in pairs): 812, Positive cache size: 778, Positive conditional cache size: 0, Positive unconditional cache size: 778, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2417, ((void *)0), P0, ((void *)0))=10, t2417={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L866] 0 pthread_t t2418; [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] EXPR 1 \read(y) [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] EXPR 1 \read(y) [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L787] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 1 return 0; [L867] FCALL, FORK 0 pthread_create(&t2418, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2418, ((void *)0), P1, ((void *)0))=11, t2417={7:0}, t2418={8:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L868] 0 pthread_t t2419; [L799] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L869] FCALL, FORK 0 pthread_create(&t2419, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2419, ((void *)0), P2, ((void *)0))=12, t2417={7:0}, t2418={8:0}, t2419={9:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L870] 0 pthread_t t2420; [L871] FCALL, FORK 0 pthread_create(&t2420, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2420, ((void *)0), P3, ((void *)0))=13, t2417={7:0}, t2418={8:0}, t2419={9:0}, t2420={5:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L811] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 \read(y) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L819] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L820] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L821] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L822] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L824] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L839] 4 y = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 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) [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] 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 [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417={7:0}, t2418={8:0}, t2419={9:0}, t2420={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 867]: 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: 871]: 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: 869]: 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 9 procedures, 266 locations, 88 error locations. Started 1 CEGAR loops. OverallTime: 72.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.4s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 42.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 930 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 930 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2570 IncrementalHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 238 mSolverCounterUnsat, 40 mSDtfsCounter, 2570 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158768occurred in iteration=0, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 6557 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 2418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-20 12:36:55,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN --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 a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 --- 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-6b4ec56 [2022-11-20 12:36:57,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:36:57,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:36:57,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:36:57,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:36:57,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:36:57,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:36:57,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:36:57,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:36:57,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:36:57,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:36:57,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:36:57,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:36:57,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:36:57,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:36:57,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:36:57,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:36:57,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:36:57,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:36:57,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:36:57,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:36:57,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:36:57,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:36:57,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:36:57,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:36:57,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:36:57,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:36:57,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:36:57,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:36:57,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:36:57,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:36:57,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:36:57,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:36:57,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:36:57,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:36:57,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:36:57,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:36:57,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:36:57,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:36:57,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:36:57,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:36:57,920 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 12:36:57,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:36:57,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:36:57,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:36:57,968 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:36:57,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:36:57,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:36:57,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:36:57,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:36:57,970 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:36:57,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:36:57,971 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:36:57,972 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:36:57,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:36:57,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:36:57,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:36:57,972 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 12:36:57,973 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 12:36:57,973 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 12:36:57,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:36:57,973 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 12:36:57,973 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 12:36:57,974 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 12:36:57,974 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:36:57,974 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:36:57,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:36:57,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:36:57,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:36:57,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:36:57,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:36:57,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:36:57,976 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 12:36:57,976 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 12:36:57,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 12:36:57,976 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN 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 -> a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 [2022-11-20 12:36:58,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:36:58,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:36:58,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:36:58,428 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:36:58,429 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:36:58,431 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2022-11-20 12:37:01,860 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:37:02,243 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:37:02,247 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2022-11-20 12:37:02,266 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/data/b170296a8/585b9048304246c98c611cb4628ad2b6/FLAGde21c1176 [2022-11-20 12:37:02,282 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/data/b170296a8/585b9048304246c98c611cb4628ad2b6 [2022-11-20 12:37:02,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:37:02,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:37:02,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:37:02,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:37:02,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:37:02,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:37:02" (1/1) ... [2022-11-20 12:37:02,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35001e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:02, skipping insertion in model container [2022-11-20 12:37:02,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:37:02" (1/1) ... [2022-11-20 12:37:02,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:37:02,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:37:02,523 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_33983606-e6d8-4b3c-b8eb-6898f11b6455/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i[995,1008] [2022-11-20 12:37:02,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:37:02,879 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:37:02,893 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_33983606-e6d8-4b3c-b8eb-6898f11b6455/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i[995,1008] [2022-11-20 12:37:02,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:37:03,027 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:37:03,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03 WrapperNode [2022-11-20 12:37:03,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:37:03,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:37:03,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:37:03,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:37:03,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (1/1) ... [2022-11-20 12:37:03,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (1/1) ... [2022-11-20 12:37:03,106 INFO L138 Inliner]: procedures = 181, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2022-11-20 12:37:03,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:37:03,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:37:03,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:37:03,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:37:03,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (1/1) ... [2022-11-20 12:37:03,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (1/1) ... [2022-11-20 12:37:03,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (1/1) ... [2022-11-20 12:37:03,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (1/1) ... [2022-11-20 12:37:03,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (1/1) ... [2022-11-20 12:37:03,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (1/1) ... [2022-11-20 12:37:03,169 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (1/1) ... [2022-11-20 12:37:03,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (1/1) ... [2022-11-20 12:37:03,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:37:03,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:37:03,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:37:03,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:37:03,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (1/1) ... [2022-11-20 12:37:03,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:37:03,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:37:03,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:37:03,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:37:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 12:37:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:37:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:37:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:37:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:37:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 12:37:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 12:37:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-20 12:37:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:37:03,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:37:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:37:03,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:37:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 12:37:03,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 12:37:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 12:37:03,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 12:37:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:37:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:37:03,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:37:03,284 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:37:03,521 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:37:03,523 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:37:04,615 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:37:05,644 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:37:05,644 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:37:05,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:37:05 BoogieIcfgContainer [2022-11-20 12:37:05,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:37:05,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:37:05,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:37:05,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:37:05,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:37:02" (1/3) ... [2022-11-20 12:37:05,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf08325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:37:05, skipping insertion in model container [2022-11-20 12:37:05,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:03" (2/3) ... [2022-11-20 12:37:05,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf08325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:37:05, skipping insertion in model container [2022-11-20 12:37:05,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:37:05" (3/3) ... [2022-11-20 12:37:05,669 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2022-11-20 12:37:05,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:37:05,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-11-20 12:37:05,694 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:37:05,963 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:37:06,021 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 12:37:06,038 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 203 transitions, 426 flow [2022-11-20 12:37:06,041 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 203 transitions, 426 flow [2022-11-20 12:37:06,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 203 transitions, 426 flow [2022-11-20 12:37:06,168 INFO L130 PetriNetUnfolder]: 2/199 cut-off events. [2022-11-20 12:37:06,169 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:37:06,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 199 events. 2/199 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 283 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-11-20 12:37:06,184 INFO L119 LiptonReduction]: Number of co-enabled transitions 8980 [2022-11-20 12:37:37,190 WARN L233 SmtUtils]: Spent 14.53s on a formula simplification. DAG size of input: 224 DAG size of output: 223 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 12:37:46,768 WARN L233 SmtUtils]: Spent 9.57s on a formula simplification. DAG size of input: 223 DAG size of output: 223 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 12:38:03,926 WARN L233 SmtUtils]: Spent 17.15s on a formula simplification. DAG size of input: 266 DAG size of output: 263 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 12:38:09,344 WARN L233 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 263 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 12:38:27,871 INFO L134 LiptonReduction]: Checked pairs total: 28739 [2022-11-20 12:38:27,871 INFO L136 LiptonReduction]: Total number of compositions: 193 [2022-11-20 12:38:27,879 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 84 transitions, 188 flow [2022-11-20 12:38:34,460 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 158768 states, 144334 states have (on average 4.86396829575845) internal successors, (702036), 158767 states have internal predecessors, (702036), 0 states have call successors, (0), 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-20 12:38:34,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:38:34,498 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=FINITE_AUTOMATA, 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;@497152c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:38:34,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2022-11-20 12:38:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 158768 states, 144334 states have (on average 4.86396829575845) internal successors, (702036), 158767 states have internal predecessors, (702036), 0 states have call successors, (0), 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-20 12:38:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 12:38:34,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:38:34,689 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 12:38:34,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:38:34,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:34,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1203, now seen corresponding path program 1 times [2022-11-20 12:38:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:38:34,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365655275] [2022-11-20 12:38:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:34,707 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-20 12:38:34,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:38:34,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:34,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:35,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 12:38:35,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:35,034 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-20 12:38:35,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:35,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:38:35,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365655275] [2022-11-20 12:38:35,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365655275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:35,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:35,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 12:38:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636982301] [2022-11-20 12:38:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:35,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:38:35,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:38:35,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:38:35,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:38:35,362 INFO L87 Difference]: Start difference. First operand has 158768 states, 144334 states have (on average 4.86396829575845) internal successors, (702036), 158767 states have internal predecessors, (702036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-20 12:38:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:38:36,374 INFO L93 Difference]: Finished difference Result 14186 states and 58394 transitions. [2022-11-20 12:38:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:38:36,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-20 12:38:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:38:36,532 INFO L225 Difference]: With dead ends: 14186 [2022-11-20 12:38:36,533 INFO L226 Difference]: Without dead ends: 14186 [2022-11-20 12:38:36,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:38:36,537 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:38:36,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:38:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14186 states. [2022-11-20 12:38:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14186 to 14186. [2022-11-20 12:38:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14186 states, 13782 states have (on average 4.236975765491221) internal successors, (58394), 14185 states have internal predecessors, (58394), 0 states have call successors, (0), 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-20 12:38:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 58394 transitions. [2022-11-20 12:38:37,701 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 58394 transitions. Word has length 1 [2022-11-20 12:38:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:38:37,702 INFO L495 AbstractCegarLoop]: Abstraction has 14186 states and 58394 transitions. [2022-11-20 12:38:37,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-20 12:38:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 58394 transitions. [2022-11-20 12:38:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 12:38:37,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:38:37,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 12:38:37,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:37,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:37,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:38:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:37,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1189496, now seen corresponding path program 1 times [2022-11-20 12:38:37,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:38:37,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136800587] [2022-11-20 12:38:37,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:37,924 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-20 12:38:37,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:38:37,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:37,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:38,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:38:38,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:38,305 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 12:38:38,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 12:38:38,347 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-20 12:38:38,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:38,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:38:38,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136800587] [2022-11-20 12:38:38,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136800587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:38,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:38,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:38:38,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177193481] [2022-11-20 12:38:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:38,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:38:38,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:38:38,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:38:38,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:38:38,352 INFO L87 Difference]: Start difference. First operand 14186 states and 58394 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 12:38:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:38:38,796 INFO L93 Difference]: Finished difference Result 7946 states and 31748 transitions. [2022-11-20 12:38:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:38:38,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 12:38:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:38:38,862 INFO L225 Difference]: With dead ends: 7946 [2022-11-20 12:38:38,863 INFO L226 Difference]: Without dead ends: 7946 [2022-11-20 12:38:38,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:38:38,870 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:38:38,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:38:38,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2022-11-20 12:38:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 7946. [2022-11-20 12:38:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7946 states, 7817 states have (on average 4.061404630932583) internal successors, (31748), 7945 states have internal predecessors, (31748), 0 states have call successors, (0), 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-20 12:38:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7946 states to 7946 states and 31748 transitions. [2022-11-20 12:38:39,324 INFO L78 Accepts]: Start accepts. Automaton has 7946 states and 31748 transitions. Word has length 3 [2022-11-20 12:38:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:38:39,324 INFO L495 AbstractCegarLoop]: Abstraction has 7946 states and 31748 transitions. [2022-11-20 12:38:39,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 12:38:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7946 states and 31748 transitions. [2022-11-20 12:38:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 12:38:39,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:38:39,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 12:38:39,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:39,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:39,538 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:38:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1189497, now seen corresponding path program 1 times [2022-11-20 12:38:39,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:38:39,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457790539] [2022-11-20 12:38:39,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:39,540 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-20 12:38:39,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:38:39,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:39,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:39,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 12:38:39,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:39,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:38:39,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 12:38:39,914 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-20 12:38:39,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:39,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:38:39,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457790539] [2022-11-20 12:38:39,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457790539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:39,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:39,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:38:39,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654202189] [2022-11-20 12:38:39,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:39,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:38:39,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:38:39,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:38:39,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:38:39,918 INFO L87 Difference]: Start difference. First operand 7946 states and 31748 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 12:38:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:38:40,391 INFO L93 Difference]: Finished difference Result 4127 states and 15962 transitions. [2022-11-20 12:38:40,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:38:40,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 12:38:40,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:38:40,421 INFO L225 Difference]: With dead ends: 4127 [2022-11-20 12:38:40,422 INFO L226 Difference]: Without dead ends: 4127 [2022-11-20 12:38:40,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:38:40,432 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:38:40,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:38:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2022-11-20 12:38:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 4127. [2022-11-20 12:38:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4127 states, 4093 states have (on average 3.8998289763010017) internal successors, (15962), 4126 states have internal predecessors, (15962), 0 states have call successors, (0), 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-20 12:38:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 15962 transitions. [2022-11-20 12:38:40,593 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 15962 transitions. Word has length 3 [2022-11-20 12:38:40,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:38:40,594 INFO L495 AbstractCegarLoop]: Abstraction has 4127 states and 15962 transitions. [2022-11-20 12:38:40,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 12:38:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 15962 transitions. [2022-11-20 12:38:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 12:38:40,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:38:40,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:38:40,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:40,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:40,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:38:40,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:40,810 INFO L85 PathProgramCache]: Analyzing trace with hash -348645495, now seen corresponding path program 1 times [2022-11-20 12:38:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:38:40,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991017252] [2022-11-20 12:38:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:40,811 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-20 12:38:40,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:38:40,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:40,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:41,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:38:41,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:41,201 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-20 12:38:41,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:41,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:38:41,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991017252] [2022-11-20 12:38:41,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991017252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:41,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:41,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:38:41,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553776378] [2022-11-20 12:38:41,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:41,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:38:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:38:41,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:38:41,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:38:41,209 INFO L87 Difference]: Start difference. First operand 4127 states and 15962 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-20 12:38:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:38:41,515 INFO L93 Difference]: Finished difference Result 2847 states and 9710 transitions. [2022-11-20 12:38:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:38:41,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 12:38:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:38:41,530 INFO L225 Difference]: With dead ends: 2847 [2022-11-20 12:38:41,530 INFO L226 Difference]: Without dead ends: 2847 [2022-11-20 12:38:41,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:38:41,531 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:38:41,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:38:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2022-11-20 12:38:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2847. [2022-11-20 12:38:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2813 states have (on average 3.451830785638109) internal successors, (9710), 2846 states have internal predecessors, (9710), 0 states have call successors, (0), 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-20 12:38:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 9710 transitions. [2022-11-20 12:38:41,637 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 9710 transitions. Word has length 13 [2022-11-20 12:38:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:38:41,638 INFO L495 AbstractCegarLoop]: Abstraction has 2847 states and 9710 transitions. [2022-11-20 12:38:41,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-20 12:38:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 9710 transitions. [2022-11-20 12:38:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 12:38:41,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:38:41,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:38:41,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:41,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:41,855 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:38:41,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash -43214428, now seen corresponding path program 1 times [2022-11-20 12:38:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:38:41,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195999734] [2022-11-20 12:38:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:41,856 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-20 12:38:41,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:38:41,858 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:41,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:42,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:38:42,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:42,235 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-20 12:38:42,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:42,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:38:42,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195999734] [2022-11-20 12:38:42,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195999734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:42,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:42,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:38:42,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952258770] [2022-11-20 12:38:42,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:42,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:38:42,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:42,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:42,238 INFO L87 Difference]: Start difference. First operand 2847 states and 9710 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-20 12:38:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:38:42,627 INFO L93 Difference]: Finished difference Result 1253 states and 3498 transitions. [2022-11-20 12:38:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:38:42,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 12:38:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:38:42,633 INFO L225 Difference]: With dead ends: 1253 [2022-11-20 12:38:42,633 INFO L226 Difference]: Without dead ends: 1253 [2022-11-20 12:38:42,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:42,634 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:38:42,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 8 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:38:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2022-11-20 12:38:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1253. [2022-11-20 12:38:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1225 states have (on average 2.8555102040816327) internal successors, (3498), 1252 states have internal predecessors, (3498), 0 states have call successors, (0), 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-20 12:38:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 3498 transitions. [2022-11-20 12:38:42,672 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 3498 transitions. Word has length 15 [2022-11-20 12:38:42,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:38:42,673 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 3498 transitions. [2022-11-20 12:38:42,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-20 12:38:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 3498 transitions. [2022-11-20 12:38:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:38:42,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:38:42,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:38:42,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:42,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:42,894 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:38:42,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash -583365960, now seen corresponding path program 1 times [2022-11-20 12:38:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:38:42,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722255352] [2022-11-20 12:38:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:42,895 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-20 12:38:42,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:38:42,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:42,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:43,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 12:38:43,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:43,333 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-20 12:38:43,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:43,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:38:43,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722255352] [2022-11-20 12:38:43,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722255352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:43,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:43,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:38:43,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211727931] [2022-11-20 12:38:43,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:43,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:38:43,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:38:43,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:38:43,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:38:43,336 INFO L87 Difference]: Start difference. First operand 1253 states and 3498 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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-20 12:38:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:38:43,903 INFO L93 Difference]: Finished difference Result 536 states and 1408 transitions. [2022-11-20 12:38:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:43,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 12:38:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:38:43,905 INFO L225 Difference]: With dead ends: 536 [2022-11-20 12:38:43,905 INFO L226 Difference]: Without dead ends: 536 [2022-11-20 12:38:43,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:38:43,906 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:38:43,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 15 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 12:38:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-11-20 12:38:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2022-11-20 12:38:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 522 states have (on average 2.6973180076628354) internal successors, (1408), 535 states have internal predecessors, (1408), 0 states have call successors, (0), 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-20 12:38:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1408 transitions. [2022-11-20 12:38:43,921 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1408 transitions. Word has length 18 [2022-11-20 12:38:43,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:38:43,921 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 1408 transitions. [2022-11-20 12:38:43,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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-20 12:38:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1408 transitions. [2022-11-20 12:38:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 12:38:43,923 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:38:43,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:38:43,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-20 12:38:44,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:44,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:38:44,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1750252660, now seen corresponding path program 1 times [2022-11-20 12:38:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:38:44,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669511037] [2022-11-20 12:38:44,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:44,138 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-20 12:38:44,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:38:44,139 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:44,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:44,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:38:44,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:44,597 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-20 12:38:44,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:44,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:38:44,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669511037] [2022-11-20 12:38:44,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669511037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:44,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:44,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:38:44,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409458825] [2022-11-20 12:38:44,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:44,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:38:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:38:44,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:38:44,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:38:44,600 INFO L87 Difference]: Start difference. First operand 536 states and 1408 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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-20 12:38:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:38:45,310 INFO L93 Difference]: Finished difference Result 396 states and 1136 transitions. [2022-11-20 12:38:45,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:38:45,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 12:38:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:38:45,312 INFO L225 Difference]: With dead ends: 396 [2022-11-20 12:38:45,312 INFO L226 Difference]: Without dead ends: 396 [2022-11-20 12:38:45,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:38:45,313 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:38:45,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 24 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:38:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-11-20 12:38:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2022-11-20 12:38:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 392 states have (on average 2.8979591836734695) internal successors, (1136), 395 states have internal predecessors, (1136), 0 states have call successors, (0), 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-20 12:38:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1136 transitions. [2022-11-20 12:38:45,324 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1136 transitions. Word has length 21 [2022-11-20 12:38:45,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:38:45,325 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 1136 transitions. [2022-11-20 12:38:45,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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-20 12:38:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1136 transitions. [2022-11-20 12:38:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 12:38:45,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:38:45,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:38:45,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:45,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:45,539 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:38:45,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1321600113, now seen corresponding path program 1 times [2022-11-20 12:38:45,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:38:45,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675566089] [2022-11-20 12:38:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:45,541 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-20 12:38:45,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:38:45,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:45,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:38:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:46,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:38:46,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:39:06,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 626 treesize of output 622 [2022-11-20 12:39:06,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 622 treesize of output 618 [2022-11-20 12:39:06,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 612 treesize of output 608 [2022-11-20 12:39:06,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 12:39:06,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1110 treesize of output 1106 [2022-11-20 12:39:06,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1100 treesize of output 1096 [2022-11-20 12:39:06,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1096 treesize of output 1092 [2022-11-20 12:39:06,544 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 12:39:06,622 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-20 12:39:06,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:39:06,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:39:06,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675566089] [2022-11-20 12:39:06,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675566089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:06,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:06,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:39:06,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597565243] [2022-11-20 12:39:06,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:06,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:39:06,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:39:06,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:39:06,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:39:06,625 INFO L87 Difference]: Start difference. First operand 396 states and 1136 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 12:39:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:39:06,919 INFO L93 Difference]: Finished difference Result 395 states and 1135 transitions. [2022-11-20 12:39:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:39:06,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 12:39:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:39:06,922 INFO L225 Difference]: With dead ends: 395 [2022-11-20 12:39:06,922 INFO L226 Difference]: Without dead ends: 395 [2022-11-20 12:39:06,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:39:06,924 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 53 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:39:06,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:39:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-11-20 12:39:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-11-20 12:39:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 392 states have (on average 2.895408163265306) internal successors, (1135), 394 states have internal predecessors, (1135), 0 states have call successors, (0), 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-20 12:39:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1135 transitions. [2022-11-20 12:39:06,941 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1135 transitions. Word has length 24 [2022-11-20 12:39:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:39:06,942 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 1135 transitions. [2022-11-20 12:39:06,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 12:39:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1135 transitions. [2022-11-20 12:39:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 12:39:06,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:39:06,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:06,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:39:07,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:39:07,161 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:39:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1321600112, now seen corresponding path program 1 times [2022-11-20 12:39:07,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:39:07,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425237185] [2022-11-20 12:39:07,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:39:07,163 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-20 12:39:07,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:39:07,164 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:39:07,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-20 12:39:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:39:07,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:39:07,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:39:30,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1192 treesize of output 1188 [2022-11-20 12:39:30,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1182 treesize of output 1178 [2022-11-20 12:39:30,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1178 treesize of output 1174 [2022-11-20 12:39:30,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 12:39:30,279 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 12:39:30,495 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-20 12:39:30,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:39:30,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:39:30,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425237185] [2022-11-20 12:39:30,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425237185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:30,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:30,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:39:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378230974] [2022-11-20 12:39:30,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:30,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:39:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:39:30,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:39:30,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:39:30,497 INFO L87 Difference]: Start difference. First operand 395 states and 1135 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 12:39:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:39:30,802 INFO L93 Difference]: Finished difference Result 394 states and 1134 transitions. [2022-11-20 12:39:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:39:30,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 12:39:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:39:30,804 INFO L225 Difference]: With dead ends: 394 [2022-11-20 12:39:30,804 INFO L226 Difference]: Without dead ends: 394 [2022-11-20 12:39:30,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:39:30,805 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:39:30,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 3 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:39:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-20 12:39:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2022-11-20 12:39:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 392 states have (on average 2.892857142857143) internal successors, (1134), 393 states have internal predecessors, (1134), 0 states have call successors, (0), 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-20 12:39:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1134 transitions. [2022-11-20 12:39:30,816 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1134 transitions. Word has length 24 [2022-11-20 12:39:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:39:30,817 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 1134 transitions. [2022-11-20 12:39:30,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 12:39:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1134 transitions. [2022-11-20 12:39:30,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 12:39:30,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:39:30,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:30,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-20 12:39:31,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:39:31,033 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:39:31,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:31,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1980063046, now seen corresponding path program 1 times [2022-11-20 12:39:31,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:39:31,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328455585] [2022-11-20 12:39:31,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:39:31,035 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-20 12:39:31,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:39:31,036 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:39:31,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-20 12:39:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:39:31,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:39:31,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:39:31,454 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-20 12:39:31,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:39:31,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:39:31,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328455585] [2022-11-20 12:39:31,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328455585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:31,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:31,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:39:31,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411302423] [2022-11-20 12:39:31,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:31,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:39:31,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:39:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:39:31,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:39:31,456 INFO L87 Difference]: Start difference. First operand 394 states and 1134 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-20 12:39:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:39:31,705 INFO L93 Difference]: Finished difference Result 569 states and 1607 transitions. [2022-11-20 12:39:31,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:39:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 12:39:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:39:31,708 INFO L225 Difference]: With dead ends: 569 [2022-11-20 12:39:31,708 INFO L226 Difference]: Without dead ends: 569 [2022-11-20 12:39:31,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:39:31,709 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:39:31,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:39:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-11-20 12:39:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 564. [2022-11-20 12:39:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 562 states have (on average 2.8523131672597866) internal successors, (1603), 563 states have internal predecessors, (1603), 0 states have call successors, (0), 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-20 12:39:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1603 transitions. [2022-11-20 12:39:31,740 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1603 transitions. Word has length 25 [2022-11-20 12:39:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:39:31,740 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 1603 transitions. [2022-11-20 12:39:31,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-20 12:39:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1603 transitions. [2022-11-20 12:39:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 12:39:31,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:39:31,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:31,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-20 12:39:31,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:39:31,959 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:39:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1184142494, now seen corresponding path program 2 times [2022-11-20 12:39:31,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:39:31,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842190610] [2022-11-20 12:39:31,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:39:31,960 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-20 12:39:31,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:39:31,961 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:39:31,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-20 12:39:32,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 12:39:32,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:39:32,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 12:39:32,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:39:32,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:39:32,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-20 12:39:32,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:39:32,691 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-20 12:39:32,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:39:32,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:39:32,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842190610] [2022-11-20 12:39:32,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842190610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:32,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:32,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:39:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821618964] [2022-11-20 12:39:32,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:32,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:39:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:39:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:39:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:39:32,693 INFO L87 Difference]: Start difference. First operand 564 states and 1603 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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-20 12:39:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:39:33,326 INFO L93 Difference]: Finished difference Result 949 states and 2574 transitions. [2022-11-20 12:39:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:39:33,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 12:39:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:39:33,331 INFO L225 Difference]: With dead ends: 949 [2022-11-20 12:39:33,331 INFO L226 Difference]: Without dead ends: 949 [2022-11-20 12:39:33,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:39:33,332 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:39:33,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 11 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:39:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2022-11-20 12:39:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 591. [2022-11-20 12:39:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 589 states have (on average 2.859083191850594) internal successors, (1684), 590 states have internal predecessors, (1684), 0 states have call successors, (0), 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-20 12:39:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1684 transitions. [2022-11-20 12:39:33,366 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1684 transitions. Word has length 25 [2022-11-20 12:39:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:39:33,366 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 1684 transitions. [2022-11-20 12:39:33,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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-20 12:39:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1684 transitions. [2022-11-20 12:39:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 12:39:33,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:39:33,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:33,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-20 12:39:33,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:39:33,585 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-11-20 12:39:33,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:33,585 INFO L85 PathProgramCache]: Analyzing trace with hash 723036318, now seen corresponding path program 3 times [2022-11-20 12:39:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:39:33,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985356130] [2022-11-20 12:39:33,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:39:33,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:39:33,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:39:33,587 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:39:33,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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 (13)] Waiting until timeout for monitored process [2022-11-20 12:39:34,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 12:39:34,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 12:39:34,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:39:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:39:34,444 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 12:39:34,444 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:39:34,446 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2022-11-20 12:39:34,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2022-11-20 12:39:34,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2022-11-20 12:39:34,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2022-11-20 12:39:34,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2022-11-20 12:39:34,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2022-11-20 12:39:34,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2022-11-20 12:39:34,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2022-11-20 12:39:34,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2022-11-20 12:39:34,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2022-11-20 12:39:34,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2022-11-20 12:39:34,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2022-11-20 12:39:34,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2022-11-20 12:39:34,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2022-11-20 12:39:34,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2022-11-20 12:39:34,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2022-11-20 12:39:34,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2022-11-20 12:39:34,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2022-11-20 12:39:34,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2022-11-20 12:39:34,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2022-11-20 12:39:34,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2022-11-20 12:39:34,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2022-11-20 12:39:34,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2022-11-20 12:39:34,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2022-11-20 12:39:34,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2022-11-20 12:39:34,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2022-11-20 12:39:34,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2022-11-20 12:39:34,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2022-11-20 12:39:34,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2022-11-20 12:39:34,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2022-11-20 12:39:34,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2022-11-20 12:39:34,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2022-11-20 12:39:34,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2022-11-20 12:39:34,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2022-11-20 12:39:34,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2022-11-20 12:39:34,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2022-11-20 12:39:34,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2022-11-20 12:39:34,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2022-11-20 12:39:34,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2022-11-20 12:39:34,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2022-11-20 12:39:34,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2022-11-20 12:39:34,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2022-11-20 12:39:34,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2022-11-20 12:39:34,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2022-11-20 12:39:34,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2022-11-20 12:39:34,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2022-11-20 12:39:34,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2022-11-20 12:39:34,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2022-11-20 12:39:34,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2022-11-20 12:39:34,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (38 of 88 remaining) [2022-11-20 12:39:34,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 88 remaining) [2022-11-20 12:39:34,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 88 remaining) [2022-11-20 12:39:34,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 88 remaining) [2022-11-20 12:39:34,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 88 remaining) [2022-11-20 12:39:34,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2022-11-20 12:39:34,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2022-11-20 12:39:34,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2022-11-20 12:39:34,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2022-11-20 12:39:34,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2022-11-20 12:39:34,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 88 remaining) [2022-11-20 12:39:34,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2022-11-20 12:39:34,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2022-11-20 12:39:34,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2022-11-20 12:39:34,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2022-11-20 12:39:34,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2022-11-20 12:39:34,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2022-11-20 12:39:34,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2022-11-20 12:39:34,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2022-11-20 12:39:34,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2022-11-20 12:39:34,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2022-11-20 12:39:34,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2022-11-20 12:39:34,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2022-11-20 12:39:34,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2022-11-20 12:39:34,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2022-11-20 12:39:34,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2022-11-20 12:39:34,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2022-11-20 12:39:34,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2022-11-20 12:39:34,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2022-11-20 12:39:34,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2022-11-20 12:39:34,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2022-11-20 12:39:34,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2022-11-20 12:39:34,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2022-11-20 12:39:34,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2022-11-20 12:39:34,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2022-11-20 12:39:34,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2022-11-20 12:39:34,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2022-11-20 12:39:34,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2022-11-20 12:39:34,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2022-11-20 12:39:34,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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 (13)] Forceful destruction successful, exit code 0 [2022-11-20 12:39:34,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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-20 12:39:34,694 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:34,700 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:39:34,700 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:39:34,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:39:34 BasicIcfg [2022-11-20 12:39:34,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:39:34,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:39:34,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:39:34,824 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:39:34,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:37:05" (3/4) ... [2022-11-20 12:39:34,828 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 12:39:34,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:39:34,829 INFO L158 Benchmark]: Toolchain (without parser) took 152541.76ms. Allocated memory was 75.5MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 50.0MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2022-11-20 12:39:34,829 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 75.5MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:39:34,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 739.59ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 46.2MB in the end (delta: 3.8MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2022-11-20 12:39:34,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.15ms. Allocated memory is still 75.5MB. Free memory was 46.2MB in the beginning and 43.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:39:34,830 INFO L158 Benchmark]: Boogie Preprocessor took 67.67ms. Allocated memory is still 75.5MB. Free memory was 43.5MB in the beginning and 40.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:39:34,830 INFO L158 Benchmark]: RCFGBuilder took 2472.39ms. Allocated memory was 75.5MB in the beginning and 117.4MB in the end (delta: 41.9MB). Free memory was 40.9MB in the beginning and 46.3MB in the end (delta: -5.4MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2022-11-20 12:39:34,831 INFO L158 Benchmark]: TraceAbstraction took 149172.44ms. Allocated memory was 117.4MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 45.5MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-20 12:39:34,831 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 7.7GB. Free memory is still 5.2GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:39:34,833 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.37ms. Allocated memory is still 75.5MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 739.59ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 46.2MB in the end (delta: 3.8MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.15ms. Allocated memory is still 75.5MB. Free memory was 46.2MB in the beginning and 43.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.67ms. Allocated memory is still 75.5MB. Free memory was 43.5MB in the beginning and 40.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2472.39ms. Allocated memory was 75.5MB in the beginning and 117.4MB in the end (delta: 41.9MB). Free memory was 40.9MB in the beginning and 46.3MB in the end (delta: -5.4MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * TraceAbstraction took 149172.44ms. Allocated memory was 117.4MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 45.5MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 7.7GB. Free memory is still 5.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 81.8s, 214 PlacesBefore, 96 PlacesAfterwards, 203 TransitionsBefore, 84 TransitionsAfterwards, 8980 CoEnabledTransitionPairs, 8 FixpointIterations, 77 TrivialSequentialCompositions, 109 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 193 TotalNumberOfCompositions, 28739 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13900, independent: 13467, independent conditional: 0, independent unconditional: 13467, dependent: 313, dependent conditional: 0, dependent unconditional: 313, unknown: 120, unknown conditional: 0, unknown unconditional: 120] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5673, independent: 5582, independent conditional: 0, independent unconditional: 5582, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5673, independent: 4995, independent conditional: 0, independent unconditional: 4995, dependent: 678, dependent conditional: 0, dependent unconditional: 678, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 678, independent: 587, independent conditional: 0, independent unconditional: 587, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5256, independent: 3024, independent conditional: 0, independent unconditional: 3024, dependent: 927, dependent conditional: 0, dependent unconditional: 927, unknown: 1305, unknown conditional: 0, unknown unconditional: 1305] ], Cache Queries: [ total: 13900, independent: 7885, independent conditional: 0, independent unconditional: 7885, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 5775, unknown conditional: 0, unknown unconditional: 5775] , Statistics on independence cache: Total cache size (in pairs): 812, Positive cache size: 781, Positive conditional cache size: 0, Positive unconditional cache size: 781, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 12, Unknown conditional cache size: 0, Unknown unconditional cache size: 12 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2417, ((void *)0), P0, ((void *)0))=0, t2417={-2147483641:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] EXPR 1 \read(y) [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=128, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L787] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=128, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L866] 0 pthread_t t2418; [L867] FCALL, FORK 0 pthread_create(&t2418, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2418, ((void *)0), P1, ((void *)0))=1, t2417={-2147483641:0}, t2418={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=128, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L868] 0 pthread_t t2419; [L869] FCALL, FORK 0 pthread_create(&t2419, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2419, ((void *)0), P2, ((void *)0))=2, t2417={-2147483641:0}, t2418={6:0}, t2419={-2147483646:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=128, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L870] 0 pthread_t t2420; [L871] FCALL, FORK 0 pthread_create(&t2420, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2420, ((void *)0), P3, ((void *)0))=3, t2417={-2147483641:0}, t2418={6:0}, t2419={-2147483646:0}, t2420={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=128, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L799] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=128, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L811] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=128, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 1 return 0; [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 \read(y) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L819] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L820] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L821] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L822] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L824] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] EXPR 3 \read(y) [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L839] 4 y = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 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) [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] 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 [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417={-2147483641:0}, t2418={6:0}, t2419={-2147483646:0}, t2420={7:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=2, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 871]: 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: 867]: 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: 869]: 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 9 procedures, 267 locations, 88 error locations. Started 1 CEGAR loops. OverallTime: 148.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 88.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1287 IncrementalHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 30 mSDtfsCounter, 1287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158768occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 363 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 44.5s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 933 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1842 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 12:39:34,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33983606-e6d8-4b3c-b8eb-6898f11b6455/bin/uautomizer-ug76WZFUDN/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