./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/thin002_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f 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_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8 --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 8cac3035eaeb2816ec7d27d980ff4447cc10ff3a409a1a8662d4bf55d93fe6d5 --- 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-e04fb08 [2022-11-16 11:12:03,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:12:03,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:12:03,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:12:03,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:12:03,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:12:03,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:12:03,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:12:03,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:12:03,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:12:03,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:12:03,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:12:03,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:12:03,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:12:03,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:12:03,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:12:03,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:12:03,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:12:03,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:12:03,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:12:03,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:12:03,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:12:03,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:12:03,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:12:03,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:12:03,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:12:03,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:12:03,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:12:03,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:12:03,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:12:03,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:12:03,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:12:03,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:12:03,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:12:03,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:12:03,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:12:03,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:12:03,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:12:03,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:12:03,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:12:03,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:12:03,946 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:12:03,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:12:03,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:12:03,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:12:03,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:12:03,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:12:03,979 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:12:03,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:12:03,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:12:03,980 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:12:03,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:12:03,981 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:12:03,981 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:12:03,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:12:03,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:12:03,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:12:03,982 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:12:03,982 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:12:03,982 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:12:03,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:12:03,983 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:12:03,983 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:12:03,984 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:12:03,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:12:03,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:12:03,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:12:03,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:12:03,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:12:03,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:12:03,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:12:03,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:12:03,986 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_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8 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 -> 8cac3035eaeb2816ec7d27d980ff4447cc10ff3a409a1a8662d4bf55d93fe6d5 [2022-11-16 11:12:04,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:12:04,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:12:04,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:12:04,288 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:12:04,289 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:12:04,290 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/thin002_power.oepc.i [2022-11-16 11:12:04,371 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/data/89be97131/c5c3387a0cac47f9a4ed00739aa7cb86/FLAGa3910e639 [2022-11-16 11:12:04,859 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:12:04,861 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/sv-benchmarks/c/pthread-wmm/thin002_power.oepc.i [2022-11-16 11:12:04,893 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/data/89be97131/c5c3387a0cac47f9a4ed00739aa7cb86/FLAGa3910e639 [2022-11-16 11:12:05,194 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/data/89be97131/c5c3387a0cac47f9a4ed00739aa7cb86 [2022-11-16 11:12:05,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:12:05,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:12:05,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:12:05,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:12:05,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:12:05,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd3dd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05, skipping insertion in model container [2022-11-16 11:12:05,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:12:05,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:12:05,454 WARN L229 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_56baba23-e206-430f-8513-1d6fe20b2306/sv-benchmarks/c/pthread-wmm/thin002_power.oepc.i[995,1008] [2022-11-16 11:12:05,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:12:05,733 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:12:05,754 WARN L229 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_56baba23-e206-430f-8513-1d6fe20b2306/sv-benchmarks/c/pthread-wmm/thin002_power.oepc.i[995,1008] [2022-11-16 11:12:05,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:12:05,864 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:12:05,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05 WrapperNode [2022-11-16 11:12:05,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:12:05,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:12:05,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:12:05,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:12:05,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,920 INFO L138 Inliner]: procedures = 177, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 154 [2022-11-16 11:12:05,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:12:05,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:12:05,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:12:05,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:12:05,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,953 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:12:05,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:12:05,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:12:05,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:12:05,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (1/1) ... [2022-11-16 11:12:05,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:12:05,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:12:06,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:12:06,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:12:06,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:12:06,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:12:06,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:12:06,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:12:06,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:12:06,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:12:06,042 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:12:06,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:12:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:12:06,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:12:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:12:06,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:12:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 11:12:06,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 11:12:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:12:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:12:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:12:06,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:12:06,046 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:12:06,222 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:12:06,224 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:12:06,864 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:12:07,560 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:12:07,560 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:12:07,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:12:07 BoogieIcfgContainer [2022-11-16 11:12:07,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:12:07,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:12:07,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:12:07,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:12:07,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:12:05" (1/3) ... [2022-11-16 11:12:07,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddf8cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:12:07, skipping insertion in model container [2022-11-16 11:12:07,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:05" (2/3) ... [2022-11-16 11:12:07,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddf8cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:12:07, skipping insertion in model container [2022-11-16 11:12:07,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:12:07" (3/3) ... [2022-11-16 11:12:07,578 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.oepc.i [2022-11-16 11:12:07,601 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:12:07,601 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-11-16 11:12:07,601 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:12:07,755 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:12:07,808 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:12:07,829 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 194 transitions, 408 flow [2022-11-16 11:12:07,834 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 194 transitions, 408 flow [2022-11-16 11:12:07,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 194 transitions, 408 flow [2022-11-16 11:12:07,945 INFO L130 PetriNetUnfolder]: 2/190 cut-off events. [2022-11-16 11:12:07,946 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:12:07,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 190 events. 2/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 231 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-11-16 11:12:07,959 INFO L119 LiptonReduction]: Number of co-enabled transitions 7132 [2022-11-16 11:12:31,037 INFO L134 LiptonReduction]: Checked pairs total: 27758 [2022-11-16 11:12:31,037 INFO L136 LiptonReduction]: Total number of compositions: 179 [2022-11-16 11:12:31,046 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 74 transitions, 168 flow [2022-11-16 11:12:33,566 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 58328 states, 57154 states have (on average 4.4068831577842325) internal successors, (251871), 58327 states have internal predecessors, (251871), 0 states have call successors, (0), 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-16 11:12:33,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:12:33,745 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;@31d0e1bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:12:33,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-16 11:12:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 58328 states, 57154 states have (on average 4.4068831577842325) internal successors, (251871), 58327 states have internal predecessors, (251871), 0 states have call successors, (0), 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-16 11:12:33,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:12:33,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:33,898 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:12:33,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:33,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:33,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1055, now seen corresponding path program 1 times [2022-11-16 11:12:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:33,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100407156] [2022-11-16 11:12:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:34,079 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-16 11:12:34,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:34,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100407156] [2022-11-16 11:12:34,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100407156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:34,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:34,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:12:34,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775701786] [2022-11-16 11:12:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:34,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:12:34,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:34,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:12:34,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:12:34,203 INFO L87 Difference]: Start difference. First operand has 58328 states, 57154 states have (on average 4.4068831577842325) internal successors, (251871), 58327 states have internal predecessors, (251871), 0 states have call successors, (0), 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-16 11:12:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:34,615 INFO L93 Difference]: Finished difference Result 14108 states and 58253 transitions. [2022-11-16 11:12:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:12:34,617 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-16 11:12:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:34,947 INFO L225 Difference]: With dead ends: 14108 [2022-11-16 11:12:34,948 INFO L226 Difference]: Without dead ends: 14108 [2022-11-16 11:12:34,949 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-16 11:12:34,954 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:34,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14108 states. [2022-11-16 11:12:35,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14108 to 14108. [2022-11-16 11:12:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14108 states, 13974 states have (on average 4.168670387863174) internal successors, (58253), 14107 states have internal predecessors, (58253), 0 states have call successors, (0), 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-16 11:12:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 58253 transitions. [2022-11-16 11:12:36,175 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 58253 transitions. Word has length 1 [2022-11-16 11:12:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:36,176 INFO L495 AbstractCegarLoop]: Abstraction has 14108 states and 58253 transitions. [2022-11-16 11:12:36,180 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-16 11:12:36,182 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 58253 transitions. [2022-11-16 11:12:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:12:36,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:36,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:12:36,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:12:36,186 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:36,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:36,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1041941, now seen corresponding path program 1 times [2022-11-16 11:12:36,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:36,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552147491] [2022-11-16 11:12:36,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:36,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:36,604 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-16 11:12:36,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:36,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552147491] [2022-11-16 11:12:36,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552147491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:36,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:36,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:12:36,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71140709] [2022-11-16 11:12:36,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:36,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:36,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:36,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:36,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:36,609 INFO L87 Difference]: Start difference. First operand 14108 states and 58253 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-16 11:12:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:37,119 INFO L93 Difference]: Finished difference Result 11645 states and 45566 transitions. [2022-11-16 11:12:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:37,123 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-16 11:12:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:37,236 INFO L225 Difference]: With dead ends: 11645 [2022-11-16 11:12:37,236 INFO L226 Difference]: Without dead ends: 11549 [2022-11-16 11:12:37,238 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-16 11:12:37,240 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:37,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:12:37,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11549 states. [2022-11-16 11:12:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11549 to 9885. [2022-11-16 11:12:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9885 states, 9836 states have (on average 4.077877185847906) internal successors, (40110), 9884 states have internal predecessors, (40110), 0 states have call successors, (0), 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-16 11:12:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9885 states to 9885 states and 40110 transitions. [2022-11-16 11:12:37,839 INFO L78 Accepts]: Start accepts. Automaton has 9885 states and 40110 transitions. Word has length 3 [2022-11-16 11:12:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:37,839 INFO L495 AbstractCegarLoop]: Abstraction has 9885 states and 40110 transitions. [2022-11-16 11:12:37,840 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-16 11:12:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9885 states and 40110 transitions. [2022-11-16 11:12:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:12:37,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:37,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:12:37,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:12:37,842 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:37,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1041925, now seen corresponding path program 1 times [2022-11-16 11:12:37,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:37,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164622274] [2022-11-16 11:12:37,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:38,020 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-16 11:12:38,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:38,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164622274] [2022-11-16 11:12:38,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164622274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:38,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:38,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:12:38,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004528888] [2022-11-16 11:12:38,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:38,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:38,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:38,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:38,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:38,023 INFO L87 Difference]: Start difference. First operand 9885 states and 40110 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-16 11:12:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:38,349 INFO L93 Difference]: Finished difference Result 6542 states and 25719 transitions. [2022-11-16 11:12:38,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:38,350 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-16 11:12:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:38,419 INFO L225 Difference]: With dead ends: 6542 [2022-11-16 11:12:38,420 INFO L226 Difference]: Without dead ends: 6446 [2022-11-16 11:12:38,421 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-16 11:12:38,424 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:38,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:38,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6446 states. [2022-11-16 11:12:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6446 to 6446. [2022-11-16 11:12:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6446 states, 6428 states have (on average 3.9612632233976353) internal successors, (25463), 6445 states have internal predecessors, (25463), 0 states have call successors, (0), 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-16 11:12:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 25463 transitions. [2022-11-16 11:12:38,665 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 25463 transitions. Word has length 3 [2022-11-16 11:12:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:38,666 INFO L495 AbstractCegarLoop]: Abstraction has 6446 states and 25463 transitions. [2022-11-16 11:12:38,666 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-16 11:12:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 25463 transitions. [2022-11-16 11:12:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:12:38,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:38,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:38,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:12:38,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:38,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1027393763, now seen corresponding path program 1 times [2022-11-16 11:12:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:38,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15658171] [2022-11-16 11:12:38,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:38,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:39,098 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-16 11:12:39,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:39,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15658171] [2022-11-16 11:12:39,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15658171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:39,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:39,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:12:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380985527] [2022-11-16 11:12:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:39,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:39,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:39,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:39,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:39,100 INFO L87 Difference]: Start difference. First operand 6446 states and 25463 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-16 11:12:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:39,289 INFO L93 Difference]: Finished difference Result 6286 states and 24775 transitions. [2022-11-16 11:12:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:39,291 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-16 11:12:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:39,325 INFO L225 Difference]: With dead ends: 6286 [2022-11-16 11:12:39,325 INFO L226 Difference]: Without dead ends: 6286 [2022-11-16 11:12:39,326 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-16 11:12:39,327 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:39,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6286 states. [2022-11-16 11:12:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6286 to 6286. [2022-11-16 11:12:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6286 states, 6268 states have (on average 3.952616464582004) internal successors, (24775), 6285 states have internal predecessors, (24775), 0 states have call successors, (0), 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-16 11:12:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 24775 transitions. [2022-11-16 11:12:39,530 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 24775 transitions. Word has length 13 [2022-11-16 11:12:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:39,535 INFO L495 AbstractCegarLoop]: Abstraction has 6286 states and 24775 transitions. [2022-11-16 11:12:39,535 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-16 11:12:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 24775 transitions. [2022-11-16 11:12:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:12:39,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:39,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:39,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:12:39,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:39,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1710149078, now seen corresponding path program 1 times [2022-11-16 11:12:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:39,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204797654] [2022-11-16 11:12:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:40,798 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-16 11:12:40,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:40,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204797654] [2022-11-16 11:12:40,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204797654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:40,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:40,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:12:40,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012814801] [2022-11-16 11:12:40,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:40,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:12:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:40,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:12:40,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:12:40,800 INFO L87 Difference]: Start difference. First operand 6286 states and 24775 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-16 11:12:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:41,059 INFO L93 Difference]: Finished difference Result 6046 states and 23823 transitions. [2022-11-16 11:12:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:12:41,060 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-16 11:12:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:41,095 INFO L225 Difference]: With dead ends: 6046 [2022-11-16 11:12:41,095 INFO L226 Difference]: Without dead ends: 6046 [2022-11-16 11:12:41,096 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-16 11:12:41,096 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:41,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 11 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:12:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2022-11-16 11:12:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 6046. [2022-11-16 11:12:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6046 states, 6029 states have (on average 3.9514015591308675) internal successors, (23823), 6045 states have internal predecessors, (23823), 0 states have call successors, (0), 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-16 11:12:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6046 states to 6046 states and 23823 transitions. [2022-11-16 11:12:41,344 INFO L78 Accepts]: Start accepts. Automaton has 6046 states and 23823 transitions. Word has length 14 [2022-11-16 11:12:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:41,344 INFO L495 AbstractCegarLoop]: Abstraction has 6046 states and 23823 transitions. [2022-11-16 11:12:41,344 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-16 11:12:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 6046 states and 23823 transitions. [2022-11-16 11:12:41,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:12:41,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:41,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:41,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:12:41,347 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:41,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1710149079, now seen corresponding path program 1 times [2022-11-16 11:12:41,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:41,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659076306] [2022-11-16 11:12:41,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:41,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:41,985 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-16 11:12:41,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:41,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659076306] [2022-11-16 11:12:41,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659076306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:41,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:41,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:12:41,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208370987] [2022-11-16 11:12:41,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:41,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:12:41,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:41,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:12:41,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:12:41,989 INFO L87 Difference]: Start difference. First operand 6046 states and 23823 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-16 11:12:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:42,228 INFO L93 Difference]: Finished difference Result 5806 states and 22871 transitions. [2022-11-16 11:12:42,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:12:42,229 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-16 11:12:42,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:42,255 INFO L225 Difference]: With dead ends: 5806 [2022-11-16 11:12:42,255 INFO L226 Difference]: Without dead ends: 5806 [2022-11-16 11:12:42,255 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-16 11:12:42,256 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 64 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:42,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 13 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:12:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5806 states. [2022-11-16 11:12:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5806 to 5806. [2022-11-16 11:12:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5806 states, 5790 states have (on average 3.9500863557858374) internal successors, (22871), 5805 states have internal predecessors, (22871), 0 states have call successors, (0), 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-16 11:12:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5806 states to 5806 states and 22871 transitions. [2022-11-16 11:12:42,443 INFO L78 Accepts]: Start accepts. Automaton has 5806 states and 22871 transitions. Word has length 14 [2022-11-16 11:12:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:42,444 INFO L495 AbstractCegarLoop]: Abstraction has 5806 states and 22871 transitions. [2022-11-16 11:12:42,444 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-16 11:12:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5806 states and 22871 transitions. [2022-11-16 11:12:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:12:42,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:42,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:42,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:12:42,446 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:42,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:42,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1784441903, now seen corresponding path program 1 times [2022-11-16 11:12:42,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:42,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839191406] [2022-11-16 11:12:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:42,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:42,607 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-16 11:12:42,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:42,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839191406] [2022-11-16 11:12:42,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839191406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:42,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:42,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:12:42,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497753003] [2022-11-16 11:12:42,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:42,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:42,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:42,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:42,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:42,610 INFO L87 Difference]: Start difference. First operand 5806 states and 22871 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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-16 11:12:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:42,803 INFO L93 Difference]: Finished difference Result 5726 states and 22527 transitions. [2022-11-16 11:12:42,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:42,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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-16 11:12:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:42,828 INFO L225 Difference]: With dead ends: 5726 [2022-11-16 11:12:42,828 INFO L226 Difference]: Without dead ends: 5726 [2022-11-16 11:12:42,829 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-16 11:12:42,830 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:42,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 12 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2022-11-16 11:12:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5726. [2022-11-16 11:12:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5726 states, 5710 states have (on average 3.945183887915937) internal successors, (22527), 5725 states have internal predecessors, (22527), 0 states have call successors, (0), 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-16 11:12:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5726 states to 5726 states and 22527 transitions. [2022-11-16 11:12:43,026 INFO L78 Accepts]: Start accepts. Automaton has 5726 states and 22527 transitions. Word has length 14 [2022-11-16 11:12:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:43,026 INFO L495 AbstractCegarLoop]: Abstraction has 5726 states and 22527 transitions. [2022-11-16 11:12:43,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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-16 11:12:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 5726 states and 22527 transitions. [2022-11-16 11:12:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:12:43,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:43,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:43,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:12:43,029 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:43,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1503456852, now seen corresponding path program 1 times [2022-11-16 11:12:43,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:43,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465894456] [2022-11-16 11:12:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:43,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:43,269 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-16 11:12:43,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:43,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465894456] [2022-11-16 11:12:43,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465894456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:43,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:43,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:12:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396343319] [2022-11-16 11:12:43,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:43,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:43,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:43,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:43,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:43,274 INFO L87 Difference]: Start difference. First operand 5726 states and 22527 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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-16 11:12:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:43,395 INFO L93 Difference]: Finished difference Result 5678 states and 22327 transitions. [2022-11-16 11:12:43,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:43,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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-16 11:12:43,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:43,419 INFO L225 Difference]: With dead ends: 5678 [2022-11-16 11:12:43,419 INFO L226 Difference]: Without dead ends: 5678 [2022-11-16 11:12:43,420 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-16 11:12:43,421 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:43,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 11 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2022-11-16 11:12:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 5678. [2022-11-16 11:12:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 5662 states have (on average 3.9433062522077003) internal successors, (22327), 5677 states have internal predecessors, (22327), 0 states have call successors, (0), 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-16 11:12:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 22327 transitions. [2022-11-16 11:12:43,640 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 22327 transitions. Word has length 15 [2022-11-16 11:12:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:43,641 INFO L495 AbstractCegarLoop]: Abstraction has 5678 states and 22327 transitions. [2022-11-16 11:12:43,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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-16 11:12:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 22327 transitions. [2022-11-16 11:12:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:12:43,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:43,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:43,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:12:43,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:43,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:43,645 INFO L85 PathProgramCache]: Analyzing trace with hash 637135203, now seen corresponding path program 1 times [2022-11-16 11:12:43,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:43,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527577903] [2022-11-16 11:12:43,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:43,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:43,912 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-16 11:12:43,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:43,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527577903] [2022-11-16 11:12:43,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527577903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:43,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:43,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:12:43,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113063807] [2022-11-16 11:12:43,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:43,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:12:43,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:43,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:12:43,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:12:43,934 INFO L87 Difference]: Start difference. First operand 5678 states and 22327 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-16 11:12:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:44,143 INFO L93 Difference]: Finished difference Result 7774 states and 30027 transitions. [2022-11-16 11:12:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:12:44,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-16 11:12:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:44,175 INFO L225 Difference]: With dead ends: 7774 [2022-11-16 11:12:44,175 INFO L226 Difference]: Without dead ends: 7774 [2022-11-16 11:12:44,175 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-16 11:12:44,176 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 76 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:44,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 17 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7774 states. [2022-11-16 11:12:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7774 to 5966. [2022-11-16 11:12:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5966 states, 5950 states have (on average 3.9272268907563026) internal successors, (23367), 5965 states have internal predecessors, (23367), 0 states have call successors, (0), 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-16 11:12:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5966 states to 5966 states and 23367 transitions. [2022-11-16 11:12:44,466 INFO L78 Accepts]: Start accepts. Automaton has 5966 states and 23367 transitions. Word has length 16 [2022-11-16 11:12:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:44,467 INFO L495 AbstractCegarLoop]: Abstraction has 5966 states and 23367 transitions. [2022-11-16 11:12:44,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-16 11:12:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 5966 states and 23367 transitions. [2022-11-16 11:12:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:12:44,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:44,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:44,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:12:44,471 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:44,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1156722639, now seen corresponding path program 1 times [2022-11-16 11:12:44,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:44,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494108495] [2022-11-16 11:12:44,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:44,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:44,921 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-16 11:12:44,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:44,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494108495] [2022-11-16 11:12:44,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494108495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:44,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:44,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:12:44,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860920579] [2022-11-16 11:12:44,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:44,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:12:44,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:44,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:12:44,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:12:44,924 INFO L87 Difference]: Start difference. First operand 5966 states and 23367 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-16 11:12:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:45,119 INFO L93 Difference]: Finished difference Result 5630 states and 21935 transitions. [2022-11-16 11:12:45,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:45,120 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-16 11:12:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:45,149 INFO L225 Difference]: With dead ends: 5630 [2022-11-16 11:12:45,149 INFO L226 Difference]: Without dead ends: 5630 [2022-11-16 11:12:45,150 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-16 11:12:45,150 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:45,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 13 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2022-11-16 11:12:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 5438. [2022-11-16 11:12:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5438 states, 5422 states have (on average 3.898008115086684) internal successors, (21135), 5437 states have internal predecessors, (21135), 0 states have call successors, (0), 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-16 11:12:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5438 states to 5438 states and 21135 transitions. [2022-11-16 11:12:45,387 INFO L78 Accepts]: Start accepts. Automaton has 5438 states and 21135 transitions. Word has length 16 [2022-11-16 11:12:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:45,388 INFO L495 AbstractCegarLoop]: Abstraction has 5438 states and 21135 transitions. [2022-11-16 11:12:45,388 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-16 11:12:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 5438 states and 21135 transitions. [2022-11-16 11:12:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:12:45,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:45,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:45,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:12:45,392 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1498664526, now seen corresponding path program 1 times [2022-11-16 11:12:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:45,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756251096] [2022-11-16 11:12:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:45,618 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-16 11:12:45,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:45,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756251096] [2022-11-16 11:12:45,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756251096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:45,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:45,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:12:45,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786845535] [2022-11-16 11:12:45,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:45,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:45,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:45,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:45,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:45,621 INFO L87 Difference]: Start difference. First operand 5438 states and 21135 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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-16 11:12:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:45,746 INFO L93 Difference]: Finished difference Result 3611 states and 12333 transitions. [2022-11-16 11:12:45,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:45,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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-16 11:12:45,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:45,762 INFO L225 Difference]: With dead ends: 3611 [2022-11-16 11:12:45,762 INFO L226 Difference]: Without dead ends: 3611 [2022-11-16 11:12:45,763 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-16 11:12:45,763 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:45,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2022-11-16 11:12:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3611. [2022-11-16 11:12:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 3595 states have (on average 3.4305980528511824) internal successors, (12333), 3610 states have internal predecessors, (12333), 0 states have call successors, (0), 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-16 11:12:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 12333 transitions. [2022-11-16 11:12:45,894 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 12333 transitions. Word has length 17 [2022-11-16 11:12:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:45,894 INFO L495 AbstractCegarLoop]: Abstraction has 3611 states and 12333 transitions. [2022-11-16 11:12:45,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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-16 11:12:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 12333 transitions. [2022-11-16 11:12:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:12:45,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:45,899 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-16 11:12:45,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:12:45,900 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:45,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:45,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1051092301, now seen corresponding path program 1 times [2022-11-16 11:12:45,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:45,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577300484] [2022-11-16 11:12:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:45,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:46,112 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-16 11:12:46,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:46,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577300484] [2022-11-16 11:12:46,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577300484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:46,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:46,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:12:46,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048001711] [2022-11-16 11:12:46,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:46,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:12:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:46,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:12:46,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:12:46,115 INFO L87 Difference]: Start difference. First operand 3611 states and 12333 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) 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-16 11:12:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:46,285 INFO L93 Difference]: Finished difference Result 4949 states and 16664 transitions. [2022-11-16 11:12:46,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:12:46,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) 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-16 11:12:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:46,302 INFO L225 Difference]: With dead ends: 4949 [2022-11-16 11:12:46,303 INFO L226 Difference]: Without dead ends: 4949 [2022-11-16 11:12:46,303 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-16 11:12:46,304 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 61 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:46,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 18 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2022-11-16 11:12:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 3605. [2022-11-16 11:12:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3605 states, 3589 states have (on average 3.4098634717191416) internal successors, (12238), 3604 states have internal predecessors, (12238), 0 states have call successors, (0), 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-16 11:12:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3605 states to 3605 states and 12238 transitions. [2022-11-16 11:12:46,415 INFO L78 Accepts]: Start accepts. Automaton has 3605 states and 12238 transitions. Word has length 19 [2022-11-16 11:12:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:46,415 INFO L495 AbstractCegarLoop]: Abstraction has 3605 states and 12238 transitions. [2022-11-16 11:12:46,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) 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-16 11:12:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3605 states and 12238 transitions. [2022-11-16 11:12:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:12:46,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:46,420 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] [2022-11-16 11:12:46,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:12:46,420 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:46,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:46,421 INFO L85 PathProgramCache]: Analyzing trace with hash -558199764, now seen corresponding path program 1 times [2022-11-16 11:12:46,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:46,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562961175] [2022-11-16 11:12:46,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:46,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:46,865 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-16 11:12:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:46,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562961175] [2022-11-16 11:12:46,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562961175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:46,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:46,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:12:46,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334318655] [2022-11-16 11:12:46,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:46,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:12:46,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:46,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:12:46,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:12:46,869 INFO L87 Difference]: Start difference. First operand 3605 states and 12238 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-16 11:12:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:47,127 INFO L93 Difference]: Finished difference Result 3422 states and 11562 transitions. [2022-11-16 11:12:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:12:47,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-11-16 11:12:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:47,138 INFO L225 Difference]: With dead ends: 3422 [2022-11-16 11:12:47,138 INFO L226 Difference]: Without dead ends: 3422 [2022-11-16 11:12:47,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:12:47,139 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 104 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:47,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 21 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:12:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2022-11-16 11:12:47,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3329. [2022-11-16 11:12:47,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3313 states have (on average 3.389677029882282) internal successors, (11230), 3328 states have internal predecessors, (11230), 0 states have call successors, (0), 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-16 11:12:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 11230 transitions. [2022-11-16 11:12:47,259 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 11230 transitions. Word has length 20 [2022-11-16 11:12:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:47,260 INFO L495 AbstractCegarLoop]: Abstraction has 3329 states and 11230 transitions. [2022-11-16 11:12:47,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-16 11:12:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 11230 transitions. [2022-11-16 11:12:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 11:12:47,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:47,266 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-16 11:12:47,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:12:47,266 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:47,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1952294647, now seen corresponding path program 1 times [2022-11-16 11:12:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:47,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319395663] [2022-11-16 11:12:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:47,582 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-16 11:12:47,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:47,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319395663] [2022-11-16 11:12:47,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319395663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:47,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:47,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:12:47,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725348721] [2022-11-16 11:12:47,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:47,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:12:47,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:47,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:12:47,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:12:47,585 INFO L87 Difference]: Start difference. First operand 3329 states and 11230 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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-16 11:12:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:47,780 INFO L93 Difference]: Finished difference Result 4778 states and 15889 transitions. [2022-11-16 11:12:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:12:47,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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-16 11:12:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:47,801 INFO L225 Difference]: With dead ends: 4778 [2022-11-16 11:12:47,801 INFO L226 Difference]: Without dead ends: 4778 [2022-11-16 11:12:47,801 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-16 11:12:47,802 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 67 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:47,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 17 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2022-11-16 11:12:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 3164. [2022-11-16 11:12:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3164 states, 3148 states have (on average 3.380876747141042) internal successors, (10643), 3163 states have internal predecessors, (10643), 0 states have call successors, (0), 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-16 11:12:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 10643 transitions. [2022-11-16 11:12:47,914 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 10643 transitions. Word has length 21 [2022-11-16 11:12:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:47,914 INFO L495 AbstractCegarLoop]: Abstraction has 3164 states and 10643 transitions. [2022-11-16 11:12:47,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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-16 11:12:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 10643 transitions. [2022-11-16 11:12:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 11:12:47,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:47,920 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-16 11:12:47,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:12:47,920 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:47,921 INFO L85 PathProgramCache]: Analyzing trace with hash -844801228, now seen corresponding path program 1 times [2022-11-16 11:12:47,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:47,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224440590] [2022-11-16 11:12:47,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:47,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:49,256 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-16 11:12:49,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:49,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224440590] [2022-11-16 11:12:49,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224440590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:49,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:49,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 11:12:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797975327] [2022-11-16 11:12:49,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:49,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:12:49,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:49,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:12:49,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:12:49,259 INFO L87 Difference]: Start difference. First operand 3164 states and 10643 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-16 11:12:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:50,641 INFO L93 Difference]: Finished difference Result 4819 states and 16339 transitions. [2022-11-16 11:12:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:12:50,642 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-16 11:12:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:50,661 INFO L225 Difference]: With dead ends: 4819 [2022-11-16 11:12:50,661 INFO L226 Difference]: Without dead ends: 4255 [2022-11-16 11:12:50,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:12:50,662 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 138 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:50,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 152 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 11:12:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2022-11-16 11:12:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 4226. [2022-11-16 11:12:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4226 states, 4210 states have (on average 3.3239904988123516) internal successors, (13994), 4225 states have internal predecessors, (13994), 0 states have call successors, (0), 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-16 11:12:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 13994 transitions. [2022-11-16 11:12:50,810 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 13994 transitions. Word has length 21 [2022-11-16 11:12:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:50,810 INFO L495 AbstractCegarLoop]: Abstraction has 4226 states and 13994 transitions. [2022-11-16 11:12:50,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-16 11:12:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 13994 transitions. [2022-11-16 11:12:50,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 11:12:50,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:50,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] [2022-11-16 11:12:50,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:12:50,820 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:50,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash -124324616, now seen corresponding path program 1 times [2022-11-16 11:12:50,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:50,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953473723] [2022-11-16 11:12:50,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:50,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:51,619 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-16 11:12:51,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:51,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953473723] [2022-11-16 11:12:51,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953473723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:51,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:51,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:12:51,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085356628] [2022-11-16 11:12:51,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:51,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:12:51,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:51,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:12:51,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:12:51,625 INFO L87 Difference]: Start difference. First operand 4226 states and 13994 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-16 11:12:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:52,044 INFO L93 Difference]: Finished difference Result 3893 states and 12619 transitions. [2022-11-16 11:12:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:12:52,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-16 11:12:52,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:52,060 INFO L225 Difference]: With dead ends: 3893 [2022-11-16 11:12:52,060 INFO L226 Difference]: Without dead ends: 3893 [2022-11-16 11:12:52,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:12:52,061 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 145 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:52,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 41 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:12:52,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3893 states. [2022-11-16 11:12:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3893 to 3722. [2022-11-16 11:12:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3706 states have (on average 3.2317862924986507) internal successors, (11977), 3721 states have internal predecessors, (11977), 0 states have call successors, (0), 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-16 11:12:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 11977 transitions. [2022-11-16 11:12:52,188 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 11977 transitions. Word has length 21 [2022-11-16 11:12:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:52,188 INFO L495 AbstractCegarLoop]: Abstraction has 3722 states and 11977 transitions. [2022-11-16 11:12:52,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-16 11:12:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 11977 transitions. [2022-11-16 11:12:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 11:12:52,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:52,197 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-16 11:12:52,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:12:52,198 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:52,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2140200851, now seen corresponding path program 1 times [2022-11-16 11:12:52,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:52,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579001535] [2022-11-16 11:12:52,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:52,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:53,172 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-16 11:12:53,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:53,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579001535] [2022-11-16 11:12:53,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579001535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:53,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:53,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:12:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864270090] [2022-11-16 11:12:53,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:53,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:12:53,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:53,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:12:53,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:12:53,174 INFO L87 Difference]: Start difference. First operand 3722 states and 11977 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-16 11:12:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:54,018 INFO L93 Difference]: Finished difference Result 3326 states and 10788 transitions. [2022-11-16 11:12:54,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:12:54,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-16 11:12:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:54,025 INFO L225 Difference]: With dead ends: 3326 [2022-11-16 11:12:54,025 INFO L226 Difference]: Without dead ends: 2894 [2022-11-16 11:12:54,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:12:54,026 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 99 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:54,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 133 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:12:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2022-11-16 11:12:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1836. [2022-11-16 11:12:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1828 states have (on average 3.0798687089715537) internal successors, (5630), 1835 states have internal predecessors, (5630), 0 states have call successors, (0), 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-16 11:12:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 5630 transitions. [2022-11-16 11:12:54,065 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 5630 transitions. Word has length 21 [2022-11-16 11:12:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:54,066 INFO L495 AbstractCegarLoop]: Abstraction has 1836 states and 5630 transitions. [2022-11-16 11:12:54,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-16 11:12:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 5630 transitions. [2022-11-16 11:12:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:12:54,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:54,070 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] [2022-11-16 11:12:54,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:12:54,071 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:54,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1199715956, now seen corresponding path program 1 times [2022-11-16 11:12:54,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:54,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782798802] [2022-11-16 11:12:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:55,940 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-16 11:12:55,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:55,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782798802] [2022-11-16 11:12:55,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782798802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:55,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:55,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:12:55,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107610897] [2022-11-16 11:12:55,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:55,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:12:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:55,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:12:55,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:12:55,942 INFO L87 Difference]: Start difference. First operand 1836 states and 5630 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:12:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:56,484 INFO L93 Difference]: Finished difference Result 2708 states and 8505 transitions. [2022-11-16 11:12:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:12:56,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-16 11:12:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:56,490 INFO L225 Difference]: With dead ends: 2708 [2022-11-16 11:12:56,490 INFO L226 Difference]: Without dead ends: 2708 [2022-11-16 11:12:56,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:12:56,491 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 139 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:56,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 41 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:12:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2022-11-16 11:12:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2005. [2022-11-16 11:12:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1997 states have (on average 3.0771156735102654) internal successors, (6145), 2004 states have internal predecessors, (6145), 0 states have call successors, (0), 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-16 11:12:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 6145 transitions. [2022-11-16 11:12:56,532 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 6145 transitions. Word has length 22 [2022-11-16 11:12:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:56,533 INFO L495 AbstractCegarLoop]: Abstraction has 2005 states and 6145 transitions. [2022-11-16 11:12:56,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:12:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 6145 transitions. [2022-11-16 11:12:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:12:56,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:56,537 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] [2022-11-16 11:12:56,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:12:56,538 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:56,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1034347624, now seen corresponding path program 2 times [2022-11-16 11:12:56,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:56,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518560471] [2022-11-16 11:12:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:58,405 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-16 11:12:58,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:58,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518560471] [2022-11-16 11:12:58,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518560471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:58,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:58,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:12:58,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819602603] [2022-11-16 11:12:58,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:58,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:12:58,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:58,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:12:58,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:12:58,407 INFO L87 Difference]: Start difference. First operand 2005 states and 6145 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:12:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:59,030 INFO L93 Difference]: Finished difference Result 2853 states and 8968 transitions. [2022-11-16 11:12:59,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:12:59,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-16 11:12:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:59,036 INFO L225 Difference]: With dead ends: 2853 [2022-11-16 11:12:59,037 INFO L226 Difference]: Without dead ends: 2853 [2022-11-16 11:12:59,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:12:59,037 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 146 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:59,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 45 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:12:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2022-11-16 11:12:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1990. [2022-11-16 11:12:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1982 states have (on average 3.084762865792129) internal successors, (6114), 1989 states have internal predecessors, (6114), 0 states have call successors, (0), 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-16 11:12:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 6114 transitions. [2022-11-16 11:12:59,078 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 6114 transitions. Word has length 22 [2022-11-16 11:12:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:59,079 INFO L495 AbstractCegarLoop]: Abstraction has 1990 states and 6114 transitions. [2022-11-16 11:12:59,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:12:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 6114 transitions. [2022-11-16 11:12:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:12:59,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:59,083 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] [2022-11-16 11:12:59,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:12:59,083 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:12:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:59,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1082969568, now seen corresponding path program 3 times [2022-11-16 11:12:59,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:59,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829897497] [2022-11-16 11:12:59,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:59,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:01,025 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-16 11:13:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:01,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829897497] [2022-11-16 11:13:01,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829897497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:01,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:01,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:13:01,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922932162] [2022-11-16 11:13:01,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:01,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:13:01,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:01,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:13:01,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:13:01,027 INFO L87 Difference]: Start difference. First operand 1990 states and 6114 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:13:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:01,607 INFO L93 Difference]: Finished difference Result 2736 states and 8650 transitions. [2022-11-16 11:13:01,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:13:01,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-16 11:13:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:01,613 INFO L225 Difference]: With dead ends: 2736 [2022-11-16 11:13:01,613 INFO L226 Difference]: Without dead ends: 2736 [2022-11-16 11:13:01,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:13:01,614 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 100 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:01,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 46 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:13:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2022-11-16 11:13:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1951. [2022-11-16 11:13:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1943 states have (on average 3.0931549150797735) internal successors, (6010), 1950 states have internal predecessors, (6010), 0 states have call successors, (0), 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-16 11:13:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 6010 transitions. [2022-11-16 11:13:01,650 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 6010 transitions. Word has length 22 [2022-11-16 11:13:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:01,651 INFO L495 AbstractCegarLoop]: Abstraction has 1951 states and 6010 transitions. [2022-11-16 11:13:01,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:13:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 6010 transitions. [2022-11-16 11:13:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:13:01,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:01,654 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] [2022-11-16 11:13:01,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:13:01,655 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:13:01,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash 440907052, now seen corresponding path program 1 times [2022-11-16 11:13:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:01,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919050862] [2022-11-16 11:13:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:01,783 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-16 11:13:01,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:01,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919050862] [2022-11-16 11:13:01,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919050862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:01,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:01,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:13:01,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855840256] [2022-11-16 11:13:01,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:01,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:13:01,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:01,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:13:01,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:13:01,786 INFO L87 Difference]: Start difference. First operand 1951 states and 6010 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:13:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:01,886 INFO L93 Difference]: Finished difference Result 2047 states and 6381 transitions. [2022-11-16 11:13:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:13:01,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-16 11:13:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:01,888 INFO L225 Difference]: With dead ends: 2047 [2022-11-16 11:13:01,888 INFO L226 Difference]: Without dead ends: 396 [2022-11-16 11:13:01,888 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-16 11:13:01,889 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:01,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:13:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-11-16 11:13:01,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2022-11-16 11:13:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 2.630379746835443) internal successors, (1039), 395 states have internal predecessors, (1039), 0 states have call successors, (0), 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-16 11:13:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1039 transitions. [2022-11-16 11:13:01,896 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1039 transitions. Word has length 22 [2022-11-16 11:13:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:01,897 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 1039 transitions. [2022-11-16 11:13:01,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:13:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1039 transitions. [2022-11-16 11:13:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:13:01,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:01,898 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] [2022-11-16 11:13:01,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:13:01,899 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:13:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:01,899 INFO L85 PathProgramCache]: Analyzing trace with hash -393175802, now seen corresponding path program 4 times [2022-11-16 11:13:01,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:01,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844534447] [2022-11-16 11:13:01,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:01,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:04,010 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-16 11:13:04,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:04,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844534447] [2022-11-16 11:13:04,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844534447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:04,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:04,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:13:04,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673492183] [2022-11-16 11:13:04,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:04,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:13:04,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:04,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:13:04,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:13:04,012 INFO L87 Difference]: Start difference. First operand 396 states and 1039 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:13:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:04,608 INFO L93 Difference]: Finished difference Result 389 states and 1016 transitions. [2022-11-16 11:13:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:13:04,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-16 11:13:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:04,609 INFO L225 Difference]: With dead ends: 389 [2022-11-16 11:13:04,610 INFO L226 Difference]: Without dead ends: 389 [2022-11-16 11:13:04,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:13:04,610 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:04,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 25 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:13:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-16 11:13:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 274. [2022-11-16 11:13:04,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 2.597069597069597) internal successors, (709), 273 states have internal predecessors, (709), 0 states have call successors, (0), 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-16 11:13:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 709 transitions. [2022-11-16 11:13:04,618 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 709 transitions. Word has length 22 [2022-11-16 11:13:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:04,618 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 709 transitions. [2022-11-16 11:13:04,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:13:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 709 transitions. [2022-11-16 11:13:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 11:13:04,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:04,619 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-16 11:13:04,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:13:04,620 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:13:04,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1463515149, now seen corresponding path program 1 times [2022-11-16 11:13:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:04,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857706646] [2022-11-16 11:13:04,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:04,851 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-16 11:13:04,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:04,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857706646] [2022-11-16 11:13:04,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857706646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:04,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:04,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:13:04,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283814503] [2022-11-16 11:13:04,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:04,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:13:04,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:04,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:13:04,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:13:04,855 INFO L87 Difference]: Start difference. First operand 274 states and 709 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-16 11:13:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:04,941 INFO L93 Difference]: Finished difference Result 229 states and 545 transitions. [2022-11-16 11:13:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:13:04,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-16 11:13:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:04,942 INFO L225 Difference]: With dead ends: 229 [2022-11-16 11:13:04,942 INFO L226 Difference]: Without dead ends: 229 [2022-11-16 11:13:04,942 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-16 11:13:04,943 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:04,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:13:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-16 11:13:04,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-11-16 11:13:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.3903508771929824) internal successors, (545), 228 states have internal predecessors, (545), 0 states have call successors, (0), 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-16 11:13:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 545 transitions. [2022-11-16 11:13:04,947 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 545 transitions. Word has length 23 [2022-11-16 11:13:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:04,948 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 545 transitions. [2022-11-16 11:13:04,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-16 11:13:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 545 transitions. [2022-11-16 11:13:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:13:04,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:04,948 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-16 11:13:04,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:13:04,949 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:13:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash -984574349, now seen corresponding path program 1 times [2022-11-16 11:13:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:04,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572857056] [2022-11-16 11:13:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:05,197 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-16 11:13:05,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:05,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572857056] [2022-11-16 11:13:05,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572857056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:05,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:05,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:13:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59219698] [2022-11-16 11:13:05,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:05,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:13:05,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:05,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:13:05,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:13:05,202 INFO L87 Difference]: Start difference. First operand 229 states and 545 transitions. Second operand has 5 states, 5 states have (on average 4.8) 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-16 11:13:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:05,301 INFO L93 Difference]: Finished difference Result 186 states and 420 transitions. [2022-11-16 11:13:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:13:05,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) 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-16 11:13:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:05,302 INFO L225 Difference]: With dead ends: 186 [2022-11-16 11:13:05,302 INFO L226 Difference]: Without dead ends: 186 [2022-11-16 11:13:05,303 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-16 11:13:05,303 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 53 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:05,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 14 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:13:05,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-16 11:13:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-11-16 11:13:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.27027027027027) internal successors, (420), 185 states have internal predecessors, (420), 0 states have call successors, (0), 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-16 11:13:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 420 transitions. [2022-11-16 11:13:05,307 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 420 transitions. Word has length 24 [2022-11-16 11:13:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:05,307 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 420 transitions. [2022-11-16 11:13:05,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) 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-16 11:13:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 420 transitions. [2022-11-16 11:13:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:13:05,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:05,308 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-16 11:13:05,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:13:05,308 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:13:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash -606517822, now seen corresponding path program 1 times [2022-11-16 11:13:05,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:05,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958562706] [2022-11-16 11:13:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:05,546 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-16 11:13:05,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:05,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958562706] [2022-11-16 11:13:05,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958562706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:05,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:05,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:13:05,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444803107] [2022-11-16 11:13:05,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:05,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:13:05,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:05,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:13:05,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:13:05,549 INFO L87 Difference]: Start difference. First operand 186 states and 420 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) 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-16 11:13:05,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:05,658 INFO L93 Difference]: Finished difference Result 167 states and 382 transitions. [2022-11-16 11:13:05,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:13:05,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) 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-16 11:13:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:05,660 INFO L225 Difference]: With dead ends: 167 [2022-11-16 11:13:05,660 INFO L226 Difference]: Without dead ends: 167 [2022-11-16 11:13:05,660 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-16 11:13:05,660 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:05,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 14 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:13:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-16 11:13:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-11-16 11:13:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.3012048192771086) internal successors, (382), 166 states have internal predecessors, (382), 0 states have call successors, (0), 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-16 11:13:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 382 transitions. [2022-11-16 11:13:05,664 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 382 transitions. Word has length 25 [2022-11-16 11:13:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:05,664 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 382 transitions. [2022-11-16 11:13:05,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) 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-16 11:13:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 382 transitions. [2022-11-16 11:13:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:13:05,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:05,665 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, 1, 1] [2022-11-16 11:13:05,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 11:13:05,665 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:13:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1547121735, now seen corresponding path program 1 times [2022-11-16 11:13:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:05,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878446879] [2022-11-16 11:13:05,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:05,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:13:05,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:13:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:13:05,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:13:05,929 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:13:05,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2022-11-16 11:13:05,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 64 remaining) [2022-11-16 11:13:05,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 64 remaining) [2022-11-16 11:13:05,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 64 remaining) [2022-11-16 11:13:05,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 64 remaining) [2022-11-16 11:13:05,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 64 remaining) [2022-11-16 11:13:05,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 64 remaining) [2022-11-16 11:13:05,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 64 remaining) [2022-11-16 11:13:05,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 64 remaining) [2022-11-16 11:13:05,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 64 remaining) [2022-11-16 11:13:05,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 64 remaining) [2022-11-16 11:13:05,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 64 remaining) [2022-11-16 11:13:05,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 64 remaining) [2022-11-16 11:13:05,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 64 remaining) [2022-11-16 11:13:05,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 64 remaining) [2022-11-16 11:13:05,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 64 remaining) [2022-11-16 11:13:05,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 64 remaining) [2022-11-16 11:13:05,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 64 remaining) [2022-11-16 11:13:05,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 64 remaining) [2022-11-16 11:13:05,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 64 remaining) [2022-11-16 11:13:05,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 64 remaining) [2022-11-16 11:13:05,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 64 remaining) [2022-11-16 11:13:05,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 64 remaining) [2022-11-16 11:13:05,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 64 remaining) [2022-11-16 11:13:05,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 64 remaining) [2022-11-16 11:13:05,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 64 remaining) [2022-11-16 11:13:05,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 64 remaining) [2022-11-16 11:13:05,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 64 remaining) [2022-11-16 11:13:05,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 64 remaining) [2022-11-16 11:13:05,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 64 remaining) [2022-11-16 11:13:05,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 64 remaining) [2022-11-16 11:13:05,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 64 remaining) [2022-11-16 11:13:05,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 64 remaining) [2022-11-16 11:13:05,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 64 remaining) [2022-11-16 11:13:05,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 64 remaining) [2022-11-16 11:13:05,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 64 remaining) [2022-11-16 11:13:05,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 64 remaining) [2022-11-16 11:13:05,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (26 of 64 remaining) [2022-11-16 11:13:05,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 64 remaining) [2022-11-16 11:13:05,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 64 remaining) [2022-11-16 11:13:05,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 64 remaining) [2022-11-16 11:13:05,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 64 remaining) [2022-11-16 11:13:05,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 64 remaining) [2022-11-16 11:13:05,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 64 remaining) [2022-11-16 11:13:05,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 64 remaining) [2022-11-16 11:13:05,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 64 remaining) [2022-11-16 11:13:05,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 64 remaining) [2022-11-16 11:13:05,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 64 remaining) [2022-11-16 11:13:05,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 64 remaining) [2022-11-16 11:13:05,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 64 remaining) [2022-11-16 11:13:05,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 64 remaining) [2022-11-16 11:13:05,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 64 remaining) [2022-11-16 11:13:05,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 64 remaining) [2022-11-16 11:13:05,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 64 remaining) [2022-11-16 11:13:05,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 64 remaining) [2022-11-16 11:13:05,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 64 remaining) [2022-11-16 11:13:05,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 64 remaining) [2022-11-16 11:13:05,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 64 remaining) [2022-11-16 11:13:05,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 64 remaining) [2022-11-16 11:13:05,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 64 remaining) [2022-11-16 11:13:05,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 64 remaining) [2022-11-16 11:13:05,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 64 remaining) [2022-11-16 11:13:05,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 64 remaining) [2022-11-16 11:13:05,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 64 remaining) [2022-11-16 11:13:05,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 11:13:05,950 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:05,957 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:13:05,957 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:13:06,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:13:06 BasicIcfg [2022-11-16 11:13:06,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:13:06,066 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:13:06,066 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:13:06,066 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:13:06,067 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:12:07" (3/4) ... [2022-11-16 11:13:06,069 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:13:06,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:13:06,070 INFO L158 Benchmark]: Toolchain (without parser) took 60873.00ms. Allocated memory was 109.1MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 85.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-16 11:13:06,071 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory was 80.9MB in the beginning and 80.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:13:06,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 668.19ms. Allocated memory is still 109.1MB. Free memory was 85.1MB in the beginning and 68.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-16 11:13:06,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.98ms. Allocated memory is still 109.1MB. Free memory was 68.8MB in the beginning and 66.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:13:06,071 INFO L158 Benchmark]: Boogie Preprocessor took 38.92ms. Allocated memory is still 109.1MB. Free memory was 66.2MB in the beginning and 64.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:13:06,072 INFO L158 Benchmark]: RCFGBuilder took 1600.54ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 63.8MB in the beginning and 93.1MB in the end (delta: -29.2MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2022-11-16 11:13:06,072 INFO L158 Benchmark]: TraceAbstraction took 58497.59ms. Allocated memory was 136.3MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 93.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-16 11:13:06,072 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 2.8GB. Free memory is still 1.4GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:13:06,074 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.30ms. Allocated memory is still 109.1MB. Free memory was 80.9MB in the beginning and 80.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 668.19ms. Allocated memory is still 109.1MB. Free memory was 85.1MB in the beginning and 68.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.98ms. Allocated memory is still 109.1MB. Free memory was 68.8MB in the beginning and 66.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.92ms. Allocated memory is still 109.1MB. Free memory was 66.2MB in the beginning and 64.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1600.54ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 63.8MB in the beginning and 93.1MB in the end (delta: -29.2MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * TraceAbstraction took 58497.59ms. Allocated memory was 136.3MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 93.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 2.8GB. Free memory is still 1.4GB. 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: 23.2s, 205 PlacesBefore, 86 PlacesAfterwards, 194 TransitionsBefore, 74 TransitionsAfterwards, 7132 CoEnabledTransitionPairs, 9 FixpointIterations, 72 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 179 TotalNumberOfCompositions, 27758 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13397, independent: 12882, independent conditional: 0, independent unconditional: 12882, dependent: 428, dependent conditional: 0, dependent unconditional: 428, unknown: 87, unknown conditional: 0, unknown unconditional: 87] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4604, independent: 4511, independent conditional: 0, independent unconditional: 4511, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4604, independent: 4244, independent conditional: 0, independent unconditional: 4244, dependent: 360, dependent conditional: 0, dependent unconditional: 360, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 360, independent: 267, independent conditional: 0, independent unconditional: 267, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2857, independent: 1807, independent conditional: 0, independent unconditional: 1807, dependent: 773, dependent conditional: 0, dependent unconditional: 773, unknown: 277, unknown conditional: 0, unknown unconditional: 277] ], Cache Queries: [ total: 13397, independent: 8371, independent conditional: 0, independent unconditional: 8371, dependent: 345, dependent conditional: 0, dependent unconditional: 345, unknown: 4681, unknown conditional: 0, unknown unconditional: 4681] , Statistics on independence cache: Total cache size (in pairs): 935, Positive cache size: 897, Positive conditional cache size: 0, Positive unconditional cache size: 897, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, 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: [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; [L757] 0 _Bool a$w_buff1_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L747] 0 _Bool a$r_buff1_thd0; [L711] 0 int __unbuffered_cnt = 0; [L753] 0 int *a$read_delayed_var; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L755] 0 _Bool a$w_buff0_used; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L713] 0 int __unbuffered_p0_EAX = 0; [L741] 0 int a$mem_tmp; [L752] 0 _Bool a$read_delayed; [L733] 0 int __unbuffered_p1_EAX = 0; [L739] 0 int a = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L754] 0 int a$w_buff0; [L756] 0 int a$w_buff1; [L740] 0 _Bool a$flush_delayed; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L759] 0 _Bool main$tmp_guard1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L758] 0 _Bool main$tmp_guard0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L742] 0 _Bool a$r_buff0_thd0; [L737] 0 int __unbuffered_p3_EAX = 0; [L745] 0 _Bool a$r_buff0_thd3; [L744] 0 _Bool a$r_buff0_thd2; [L746] 0 _Bool a$r_buff0_thd4; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L861] 0 pthread_t t2705; [L862] FCALL, FORK 0 pthread_create(&t2705, ((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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2705, ((void *)0), P0, ((void *)0))=-3, t2705={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L777] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L777] EXPR 1 \read(a) [L777] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L777] 1 a = !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L778] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)))) [L779] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)))) [L780] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L781] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L782] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L783] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$r_buff1_thd1 : (_Bool)0) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L784] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L785] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L786] EXPR 1 \read(a) [L786] 1 __unbuffered_p0_EAX = a [L787] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L787] EXPR 1 \read(a) [L787] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L787] 1 a = a$flush_delayed ? a$mem_tmp : a [L788] 1 a$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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y=0, z=0] [L791] 1 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y=0, z=0] [L863] 0 pthread_t t2706; 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2705={7:0}, t2706={8:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t2706, ((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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2706, ((void *)0), P1, ((void *)0))=-2, t2705={7:0}, t2706={8:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y=0, z=0] [L865] 0 pthread_t t2707; 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2705={7:0}, t2706={8:0}, t2707={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y=0, z=0] [L803] 2 __unbuffered_p1_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_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=0, z=0] [L806] 2 y = 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_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=1, z=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L866] FCALL, FORK 0 pthread_create(&t2707, ((void *)0), P2, ((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_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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(&t2707, ((void *)0), P2, ((void *)0))=-1, t2705={7:0}, t2706={8:0}, t2707={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y=1, z=0] [L818] 3 __unbuffered_p2_EAX = y 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=1, z=0] [L821] 3 z = 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=1, z=1] [L867] 0 pthread_t t2708; [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L868] FCALL, FORK 0 pthread_create(&t2708, ((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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, pthread_create(&t2708, ((void *)0), P3, ((void *)0))=0, t2705={7:0}, t2706={8:0}, t2707={5:0}, t2708={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y=1, z=1] [L833] 4 __unbuffered_p3_EAX = z 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=1, z=1] [L836] 4 a = 1 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=1, z=1] [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 4 \read(a) [L839] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L796] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 1 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 \read(a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t2705={7:0}, t2706={8:0}, t2707={5:0}, t2708={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y=1, z=1] [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L885] 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, weak$$choice2=0, x=1, y=1, z=1] - 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: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 868]: 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: 866]: 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: 864]: 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, 248 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 58.0s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1652 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1652 mSDsluCounter, 702 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 510 mSDsCounter, 277 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3662 IncrementalHoareTripleChecker+Invalid, 3939 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 277 mSolverCounterUnsat, 192 mSDtfsCounter, 3662 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58328occurred in iteration=0, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 10439 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 458 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 6790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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-16 11:13:06,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8 --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 8cac3035eaeb2816ec7d27d980ff4447cc10ff3a409a1a8662d4bf55d93fe6d5 --- 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-e04fb08 [2022-11-16 11:13:08,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:13:08,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:13:08,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:13:08,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:13:08,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:13:08,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:13:08,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:13:08,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:13:08,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:13:08,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:13:08,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:13:08,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:13:08,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:13:08,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:13:08,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:13:08,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:13:08,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:13:08,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:13:08,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:13:08,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:13:08,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:13:08,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:13:08,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:13:08,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:13:08,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:13:08,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:13:08,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:13:08,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:13:08,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:13:08,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:13:08,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:13:08,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:13:08,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:13:08,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:13:08,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:13:08,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:13:08,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:13:08,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:13:08,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:13:08,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:13:08,650 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 11:13:08,686 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:13:08,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:13:08,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:13:08,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:13:08,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:13:08,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:13:08,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:13:08,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:13:08,689 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:13:08,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:13:08,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:13:08,690 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:13:08,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:13:08,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:13:08,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:13:08,691 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:13:08,691 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:13:08,692 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:13:08,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:13:08,692 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:13:08,692 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:13:08,692 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:13:08,693 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:13:08,693 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:13:08,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:13:08,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:13:08,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:13:08,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:13:08,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:13:08,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:13:08,695 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:13:08,695 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:13:08,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:13:08,695 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_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8 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 -> 8cac3035eaeb2816ec7d27d980ff4447cc10ff3a409a1a8662d4bf55d93fe6d5 [2022-11-16 11:13:09,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:13:09,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:13:09,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:13:09,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:13:09,089 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:13:09,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/thin002_power.oepc.i [2022-11-16 11:13:09,179 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/data/b77d2b55c/6ba9967292344b3284105f29f1f38a3c/FLAG93e9ea493 [2022-11-16 11:13:09,688 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:13:09,688 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/sv-benchmarks/c/pthread-wmm/thin002_power.oepc.i [2022-11-16 11:13:09,717 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/data/b77d2b55c/6ba9967292344b3284105f29f1f38a3c/FLAG93e9ea493 [2022-11-16 11:13:10,021 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/data/b77d2b55c/6ba9967292344b3284105f29f1f38a3c [2022-11-16 11:13:10,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:13:10,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:13:10,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:13:10,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:13:10,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:13:10,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1170d1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10, skipping insertion in model container [2022-11-16 11:13:10,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:13:10,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:13:10,340 WARN L229 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_56baba23-e206-430f-8513-1d6fe20b2306/sv-benchmarks/c/pthread-wmm/thin002_power.oepc.i[995,1008] [2022-11-16 11:13:10,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:13:10,653 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:13:10,669 WARN L229 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_56baba23-e206-430f-8513-1d6fe20b2306/sv-benchmarks/c/pthread-wmm/thin002_power.oepc.i[995,1008] [2022-11-16 11:13:10,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:13:10,749 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:13:10,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10 WrapperNode [2022-11-16 11:13:10,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:13:10,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:13:10,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:13:10,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:13:10,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,844 INFO L138 Inliner]: procedures = 181, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 155 [2022-11-16 11:13:10,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:13:10,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:13:10,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:13:10,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:13:10,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,911 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:13:10,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:13:10,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:13:10,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:13:10,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (1/1) ... [2022-11-16 11:13:10,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:13:10,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:10,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:13:11,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:13:11,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 11:13:11,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:13:11,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:13:11,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:13:11,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:13:11,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:13:11,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:13:11,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-16 11:13:11,038 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:13:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:13:11,039 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:13:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:13:11,039 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:13:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:13:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 11:13:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 11:13:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:13:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:13:11,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:13:11,043 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:13:11,307 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:13:11,310 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:13:11,977 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:13:12,816 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:13:12,816 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:13:12,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:13:12 BoogieIcfgContainer [2022-11-16 11:13:12,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:13:12,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:13:12,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:13:12,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:13:12,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:13:10" (1/3) ... [2022-11-16 11:13:12,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7004a8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:13:12, skipping insertion in model container [2022-11-16 11:13:12,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:13:10" (2/3) ... [2022-11-16 11:13:12,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7004a8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:13:12, skipping insertion in model container [2022-11-16 11:13:12,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:13:12" (3/3) ... [2022-11-16 11:13:12,831 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.oepc.i [2022-11-16 11:13:12,850 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:13:12,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-11-16 11:13:12,851 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:13:13,035 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:13:13,086 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:13:13,103 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 195 transitions, 410 flow [2022-11-16 11:13:13,108 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 195 transitions, 410 flow [2022-11-16 11:13:13,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 195 transitions, 410 flow [2022-11-16 11:13:13,240 INFO L130 PetriNetUnfolder]: 2/191 cut-off events. [2022-11-16 11:13:13,240 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:13:13,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 191 events. 2/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 228 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-11-16 11:13:13,252 INFO L119 LiptonReduction]: Number of co-enabled transitions 7132 [2022-11-16 11:13:37,568 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 267 DAG size of output: 266 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:13:43,291 WARN L233 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 266 DAG size of output: 266 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:14:09,066 INFO L134 LiptonReduction]: Checked pairs total: 24826 [2022-11-16 11:14:09,066 INFO L136 LiptonReduction]: Total number of compositions: 191 [2022-11-16 11:14:09,074 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 74 transitions, 168 flow [2022-11-16 11:14:12,244 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 58328 states, 57154 states have (on average 4.4068831577842325) internal successors, (251871), 58327 states have internal predecessors, (251871), 0 states have call successors, (0), 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-16 11:14:12,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:14:12,294 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;@35ca2645, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:14:12,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-16 11:14:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 58328 states, 57154 states have (on average 4.4068831577842325) internal successors, (251871), 58327 states have internal predecessors, (251871), 0 states have call successors, (0), 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-16 11:14:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:14:12,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:12,386 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:14:12,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:14:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1071, now seen corresponding path program 1 times [2022-11-16 11:14:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:14:12,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055247037] [2022-11-16 11:14:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:12,413 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-16 11:14:12,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:14:12,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:12,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:12,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:14:12,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:12,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-16 11:14:12,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:14:12,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:14:12,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055247037] [2022-11-16 11:14:12,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055247037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:12,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:12,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:14:12,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922494988] [2022-11-16 11:14:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:12,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:14:12,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:14:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:14:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:14:12,820 INFO L87 Difference]: Start difference. First operand has 58328 states, 57154 states have (on average 4.4068831577842325) internal successors, (251871), 58327 states have internal predecessors, (251871), 0 states have call successors, (0), 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-16 11:14:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:13,559 INFO L93 Difference]: Finished difference Result 14108 states and 58253 transitions. [2022-11-16 11:14:13,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:14:13,562 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-16 11:14:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:13,724 INFO L225 Difference]: With dead ends: 14108 [2022-11-16 11:14:13,724 INFO L226 Difference]: Without dead ends: 14108 [2022-11-16 11:14:13,725 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-16 11:14:13,728 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:13,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:14:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14108 states. [2022-11-16 11:14:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14108 to 14108. [2022-11-16 11:14:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14108 states, 13974 states have (on average 4.168670387863174) internal successors, (58253), 14107 states have internal predecessors, (58253), 0 states have call successors, (0), 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-16 11:14:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 58253 transitions. [2022-11-16 11:14:14,691 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 58253 transitions. Word has length 1 [2022-11-16 11:14:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:14,692 INFO L495 AbstractCegarLoop]: Abstraction has 14108 states and 58253 transitions. [2022-11-16 11:14:14,692 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-16 11:14:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 58253 transitions. [2022-11-16 11:14:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:14:14,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:14,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:14:14,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:14,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:14,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:14:14,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1054540, now seen corresponding path program 1 times [2022-11-16 11:14:14,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:14:14,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357496578] [2022-11-16 11:14:14,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:14,909 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-16 11:14:14,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:14:14,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:14,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:15,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:14:15,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:15,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:14:15,294 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-16 11:14:15,336 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-16 11:14:15,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:14:15,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:14:15,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357496578] [2022-11-16 11:14:15,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357496578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:15,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:15,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:14:15,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869361595] [2022-11-16 11:14:15,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:15,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:14:15,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:14:15,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:14:15,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:14:15,342 INFO L87 Difference]: Start difference. First operand 14108 states and 58253 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-16 11:14:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:15,894 INFO L93 Difference]: Finished difference Result 9181 states and 37310 transitions. [2022-11-16 11:14:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:14:15,895 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-16 11:14:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:16,067 INFO L225 Difference]: With dead ends: 9181 [2022-11-16 11:14:16,076 INFO L226 Difference]: Without dead ends: 9181 [2022-11-16 11:14:16,077 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-16 11:14:16,079 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:16,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:14:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9181 states. [2022-11-16 11:14:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9181 to 9181. [2022-11-16 11:14:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9181 states, 9126 states have (on average 4.088319088319088) internal successors, (37310), 9180 states have internal predecessors, (37310), 0 states have call successors, (0), 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-16 11:14:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 37310 transitions. [2022-11-16 11:14:17,024 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 37310 transitions. Word has length 3 [2022-11-16 11:14:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:17,024 INFO L495 AbstractCegarLoop]: Abstraction has 9181 states and 37310 transitions. [2022-11-16 11:14:17,025 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-16 11:14:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 37310 transitions. [2022-11-16 11:14:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:14:17,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:17,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:14:17,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-16 11:14:17,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:17,239 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:14:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1054539, now seen corresponding path program 1 times [2022-11-16 11:14:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:14:17,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627539270] [2022-11-16 11:14:17,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:17,241 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-16 11:14:17,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:14:17,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:17,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:17,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:14:17,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:17,522 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:14:17,522 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-16 11:14:17,546 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-16 11:14:17,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:14:17,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:14:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627539270] [2022-11-16 11:14:17,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627539270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:17,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:17,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:14:17,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543607862] [2022-11-16 11:14:17,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:17,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:14:17,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:14:17,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:14:17,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:14:17,549 INFO L87 Difference]: Start difference. First operand 9181 states and 37310 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-16 11:14:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:17,823 INFO L93 Difference]: Finished difference Result 5598 states and 22127 transitions. [2022-11-16 11:14:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:14:17,824 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-16 11:14:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:17,858 INFO L225 Difference]: With dead ends: 5598 [2022-11-16 11:14:17,858 INFO L226 Difference]: Without dead ends: 5598 [2022-11-16 11:14:17,858 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-16 11:14:17,859 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:17,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:14:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2022-11-16 11:14:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 5598. [2022-11-16 11:14:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5598 states, 5580 states have (on average 3.965412186379928) internal successors, (22127), 5597 states have internal predecessors, (22127), 0 states have call successors, (0), 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-16 11:14:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 22127 transitions. [2022-11-16 11:14:18,200 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 22127 transitions. Word has length 3 [2022-11-16 11:14:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:18,201 INFO L495 AbstractCegarLoop]: Abstraction has 5598 states and 22127 transitions. [2022-11-16 11:14:18,201 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-16 11:14:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 22127 transitions. [2022-11-16 11:14:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:14:18,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:18,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:14:18,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:18,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:18,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:14:18,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:18,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1182351519, now seen corresponding path program 1 times [2022-11-16 11:14:18,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:14:18,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944332508] [2022-11-16 11:14:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:18,417 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-16 11:14:18,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:14:18,418 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:18,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:18,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:14:18,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:18,750 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-16 11:14:18,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:14:18,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:14:18,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944332508] [2022-11-16 11:14:18,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944332508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:18,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:18,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:14:18,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025683575] [2022-11-16 11:14:18,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:18,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:14:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:14:18,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:14:18,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:14:18,754 INFO L87 Difference]: Start difference. First operand 5598 states and 22127 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 11:14:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:19,152 INFO L93 Difference]: Finished difference Result 4028 states and 13932 transitions. [2022-11-16 11:14:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:14:19,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 11:14:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:19,172 INFO L225 Difference]: With dead ends: 4028 [2022-11-16 11:14:19,172 INFO L226 Difference]: Without dead ends: 3708 [2022-11-16 11:14:19,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-16 11:14:19,174 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:19,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 26 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:14:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2022-11-16 11:14:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3708. [2022-11-16 11:14:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3708 states, 3690 states have (on average 3.481842818428184) internal successors, (12848), 3707 states have internal predecessors, (12848), 0 states have call successors, (0), 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-16 11:14:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 12848 transitions. [2022-11-16 11:14:19,290 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 12848 transitions. Word has length 13 [2022-11-16 11:14:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:19,291 INFO L495 AbstractCegarLoop]: Abstraction has 3708 states and 12848 transitions. [2022-11-16 11:14:19,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 11:14:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 12848 transitions. [2022-11-16 11:14:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:14:19,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:19,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:14:19,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:19,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:19,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:14:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash 843595851, now seen corresponding path program 1 times [2022-11-16 11:14:19,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:14:19,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18097459] [2022-11-16 11:14:19,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:19,509 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-16 11:14:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:14:19,510 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:19,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:19,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:14:19,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:19,870 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-16 11:14:19,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:14:19,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:14:19,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18097459] [2022-11-16 11:14:19,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18097459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:19,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:19,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:14:19,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518013844] [2022-11-16 11:14:19,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:19,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:14:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:14:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:14:19,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:14:19,873 INFO L87 Difference]: Start difference. First operand 3708 states and 12848 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-16 11:14:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:20,448 INFO L93 Difference]: Finished difference Result 1814 states and 5271 transitions. [2022-11-16 11:14:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:14:20,449 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-16 11:14:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:20,456 INFO L225 Difference]: With dead ends: 1814 [2022-11-16 11:14:20,456 INFO L226 Difference]: Without dead ends: 1602 [2022-11-16 11:14:20,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:14:20,457 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:20,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 46 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:14:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2022-11-16 11:14:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1602. [2022-11-16 11:14:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1584 states have (on average 2.898989898989899) internal successors, (4592), 1601 states have internal predecessors, (4592), 0 states have call successors, (0), 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-16 11:14:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 4592 transitions. [2022-11-16 11:14:20,499 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 4592 transitions. Word has length 16 [2022-11-16 11:14:20,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:20,499 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 4592 transitions. [2022-11-16 11:14:20,499 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-16 11:14:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 4592 transitions. [2022-11-16 11:14:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:14:20,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:20,502 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-16 11:14:20,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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)] Ended with exit code 0 [2022-11-16 11:14:20,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:20,715 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:14:20,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:20,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1881033403, now seen corresponding path program 1 times [2022-11-16 11:14:20,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:14:20,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942996543] [2022-11-16 11:14:20,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:20,716 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-16 11:14:20,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:14:20,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:20,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:20,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:14:20,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:21,049 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-16 11:14:21,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:14:21,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:14:21,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942996543] [2022-11-16 11:14:21,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942996543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:21,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:21,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:14:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756872021] [2022-11-16 11:14:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:21,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:14:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:14:21,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:14:21,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:14:21,051 INFO L87 Difference]: Start difference. First operand 1602 states and 4592 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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-16 11:14:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:21,692 INFO L93 Difference]: Finished difference Result 815 states and 2257 transitions. [2022-11-16 11:14:21,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:14:21,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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-16 11:14:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:21,696 INFO L225 Difference]: With dead ends: 815 [2022-11-16 11:14:21,697 INFO L226 Difference]: Without dead ends: 738 [2022-11-16 11:14:21,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:14:21,698 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:21,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 81 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:14:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-11-16 11:14:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2022-11-16 11:14:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 726 states have (on average 2.830578512396694) internal successors, (2055), 737 states have internal predecessors, (2055), 0 states have call successors, (0), 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-16 11:14:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2055 transitions. [2022-11-16 11:14:21,716 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2055 transitions. Word has length 19 [2022-11-16 11:14:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:21,717 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 2055 transitions. [2022-11-16 11:14:21,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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-16 11:14:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2055 transitions. [2022-11-16 11:14:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:14:21,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:21,719 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] [2022-11-16 11:14:21,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:14:21,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:21,932 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:14:21,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1493336070, now seen corresponding path program 1 times [2022-11-16 11:14:21,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:14:21,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819486168] [2022-11-16 11:14:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:21,934 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-16 11:14:21,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:14:21,937 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:21,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:22,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:14:22,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:22,296 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-16 11:14:22,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:14:22,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:14:22,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819486168] [2022-11-16 11:14:22,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819486168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:22,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:22,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:14:22,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650304523] [2022-11-16 11:14:22,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:22,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:14:22,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:14:22,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:14:22,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:14:22,298 INFO L87 Difference]: Start difference. First operand 738 states and 2055 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:14:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:23,021 INFO L93 Difference]: Finished difference Result 598 states and 1779 transitions. [2022-11-16 11:14:23,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:14:23,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-16 11:14:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:23,024 INFO L225 Difference]: With dead ends: 598 [2022-11-16 11:14:23,024 INFO L226 Difference]: Without dead ends: 584 [2022-11-16 11:14:23,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:14:23,025 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 62 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:23,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 116 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:14:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-11-16 11:14:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-11-16 11:14:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 580 states have (on average 3.0224137931034485) internal successors, (1753), 583 states have internal predecessors, (1753), 0 states have call successors, (0), 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-16 11:14:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1753 transitions. [2022-11-16 11:14:23,041 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1753 transitions. Word has length 22 [2022-11-16 11:14:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:23,041 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 1753 transitions. [2022-11-16 11:14:23,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 11:14:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1753 transitions. [2022-11-16 11:14:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:14:23,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:23,043 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, 1] [2022-11-16 11:14:23,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:23,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:23,259 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:14:23,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash 591994324, now seen corresponding path program 1 times [2022-11-16 11:14:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:14:23,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822729182] [2022-11-16 11:14:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:23,260 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-16 11:14:23,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:14:23,261 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:23,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:14:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:23,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:14:23,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:12,932 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-16 11:17:12,963 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 11:17:13,082 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-16 11:17:13,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:17:13,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:17:13,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822729182] [2022-11-16 11:17:13,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822729182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:17:13,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:17:13,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:17:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631982061] [2022-11-16 11:17:13,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:17:13,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:17:13,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:17:13,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:17:13,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:17:13,084 INFO L87 Difference]: Start difference. First operand 584 states and 1753 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-16 11:17:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:13,408 INFO L93 Difference]: Finished difference Result 582 states and 1751 transitions. [2022-11-16 11:17:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:17:13,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-16 11:17:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:13,411 INFO L225 Difference]: With dead ends: 582 [2022-11-16 11:17:13,412 INFO L226 Difference]: Without dead ends: 582 [2022-11-16 11:17:13,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:17:13,413 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:13,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 10 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:17:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-16 11:17:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2022-11-16 11:17:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 580 states have (on average 3.018965517241379) internal successors, (1751), 581 states have internal predecessors, (1751), 0 states have call successors, (0), 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-16 11:17:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1751 transitions. [2022-11-16 11:17:13,432 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1751 transitions. Word has length 26 [2022-11-16 11:17:13,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:13,433 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 1751 transitions. [2022-11-16 11:17:13,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-16 11:17:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1751 transitions. [2022-11-16 11:17:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:17:13,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:13,436 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, 1, 1] [2022-11-16 11:17:13,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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)] Ended with exit code 0 [2022-11-16 11:17:13,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:13,652 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:17:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1171956003, now seen corresponding path program 1 times [2022-11-16 11:17:13,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:17:13,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125812785] [2022-11-16 11:17:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:13,654 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-16 11:17:13,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:17:13,655 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:13,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:14,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:17:14,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:14,091 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-16 11:17:14,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:17:14,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:17:14,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125812785] [2022-11-16 11:17:14,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125812785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:17:14,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:17:14,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:17:14,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87941810] [2022-11-16 11:17:14,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:17:14,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:17:14,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:17:14,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:17:14,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:17:14,094 INFO L87 Difference]: Start difference. First operand 582 states and 1751 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 11:17:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:14,368 INFO L93 Difference]: Finished difference Result 799 states and 2333 transitions. [2022-11-16 11:17:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:17:14,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-16 11:17:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:14,371 INFO L225 Difference]: With dead ends: 799 [2022-11-16 11:17:14,372 INFO L226 Difference]: Without dead ends: 799 [2022-11-16 11:17:14,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-16 11:17:14,373 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:14,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 13 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:17:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-11-16 11:17:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 794. [2022-11-16 11:17:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 792 states have (on average 2.9406565656565657) internal successors, (2329), 793 states have internal predecessors, (2329), 0 states have call successors, (0), 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-16 11:17:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2329 transitions. [2022-11-16 11:17:14,404 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2329 transitions. Word has length 27 [2022-11-16 11:17:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:14,405 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 2329 transitions. [2022-11-16 11:17:14,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 11:17:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2329 transitions. [2022-11-16 11:17:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:17:14,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:14,409 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, 1, 1] [2022-11-16 11:17:14,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:14,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:14,626 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:17:14,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:14,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1180609131, now seen corresponding path program 2 times [2022-11-16 11:17:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:17:14,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203456673] [2022-11-16 11:17:14,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:17:14,627 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-16 11:17:14,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:17:14,628 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:14,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:14,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:17:14,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:17:15,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:17:15,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:15,097 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-16 11:17:15,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:17:15,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:17:15,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203456673] [2022-11-16 11:17:15,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203456673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:17:15,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:17:15,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:17:15,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644906528] [2022-11-16 11:17:15,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:17:15,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:17:15,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:17:15,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:17:15,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:17:15,100 INFO L87 Difference]: Start difference. First operand 794 states and 2329 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 11:17:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:15,396 INFO L93 Difference]: Finished difference Result 1091 states and 3119 transitions. [2022-11-16 11:17:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:17:15,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-16 11:17:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:15,400 INFO L225 Difference]: With dead ends: 1091 [2022-11-16 11:17:15,400 INFO L226 Difference]: Without dead ends: 1091 [2022-11-16 11:17:15,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-16 11:17:15,402 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 31 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:15,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:17:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2022-11-16 11:17:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 746. [2022-11-16 11:17:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 744 states have (on average 2.9341397849462365) internal successors, (2183), 745 states have internal predecessors, (2183), 0 states have call successors, (0), 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-16 11:17:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 2183 transitions. [2022-11-16 11:17:15,437 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 2183 transitions. Word has length 27 [2022-11-16 11:17:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:15,437 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 2183 transitions. [2022-11-16 11:17:15,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 11:17:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 2183 transitions. [2022-11-16 11:17:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:17:15,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:15,442 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, 1, 1] [2022-11-16 11:17:15,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:15,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:15,664 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:17:15,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:15,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1395226245, now seen corresponding path program 3 times [2022-11-16 11:17:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:17:15,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534656353] [2022-11-16 11:17:15,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:17:15,666 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-16 11:17:15,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:17:15,667 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:15,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:16,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 11:17:16,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:17:16,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:17:16,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:16,095 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-16 11:17:16,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:17:16,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:17:16,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534656353] [2022-11-16 11:17:16,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534656353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:17:16,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:17:16,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:17:16,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670867434] [2022-11-16 11:17:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:17:16,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:17:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:17:16,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:17:16,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:17:16,098 INFO L87 Difference]: Start difference. First operand 746 states and 2183 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 11:17:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:16,346 INFO L93 Difference]: Finished difference Result 915 states and 2617 transitions. [2022-11-16 11:17:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:17:16,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-16 11:17:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:16,350 INFO L225 Difference]: With dead ends: 915 [2022-11-16 11:17:16,350 INFO L226 Difference]: Without dead ends: 915 [2022-11-16 11:17:16,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-16 11:17:16,351 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:16,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 13 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:17:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-11-16 11:17:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 706. [2022-11-16 11:17:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 704 states have (on average 2.9389204545454546) internal successors, (2069), 705 states have internal predecessors, (2069), 0 states have call successors, (0), 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-16 11:17:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 2069 transitions. [2022-11-16 11:17:16,375 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 2069 transitions. Word has length 27 [2022-11-16 11:17:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:16,376 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 2069 transitions. [2022-11-16 11:17:16,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 11:17:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 2069 transitions. [2022-11-16 11:17:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:17:16,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:16,379 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, 1, 1] [2022-11-16 11:17:16,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:16,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:16,595 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:17:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash 300056517, now seen corresponding path program 4 times [2022-11-16 11:17:16,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:17:16,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171077670] [2022-11-16 11:17:16,596 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:17:16,596 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-16 11:17:16,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:17:16,597 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:16,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:17,079 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:17:17,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 11:17:17,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:17:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:17:17,358 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 11:17:17,359 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:17:17,360 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2022-11-16 11:17:17,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 64 remaining) [2022-11-16 11:17:17,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 64 remaining) [2022-11-16 11:17:17,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 64 remaining) [2022-11-16 11:17:17,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 64 remaining) [2022-11-16 11:17:17,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 64 remaining) [2022-11-16 11:17:17,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 64 remaining) [2022-11-16 11:17:17,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 64 remaining) [2022-11-16 11:17:17,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 64 remaining) [2022-11-16 11:17:17,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 64 remaining) [2022-11-16 11:17:17,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 64 remaining) [2022-11-16 11:17:17,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 64 remaining) [2022-11-16 11:17:17,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 64 remaining) [2022-11-16 11:17:17,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 64 remaining) [2022-11-16 11:17:17,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 64 remaining) [2022-11-16 11:17:17,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 64 remaining) [2022-11-16 11:17:17,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 64 remaining) [2022-11-16 11:17:17,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 64 remaining) [2022-11-16 11:17:17,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 64 remaining) [2022-11-16 11:17:17,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 64 remaining) [2022-11-16 11:17:17,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 64 remaining) [2022-11-16 11:17:17,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 64 remaining) [2022-11-16 11:17:17,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 64 remaining) [2022-11-16 11:17:17,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 64 remaining) [2022-11-16 11:17:17,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 64 remaining) [2022-11-16 11:17:17,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 64 remaining) [2022-11-16 11:17:17,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 64 remaining) [2022-11-16 11:17:17,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 64 remaining) [2022-11-16 11:17:17,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 64 remaining) [2022-11-16 11:17:17,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 64 remaining) [2022-11-16 11:17:17,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 64 remaining) [2022-11-16 11:17:17,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 64 remaining) [2022-11-16 11:17:17,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 64 remaining) [2022-11-16 11:17:17,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 64 remaining) [2022-11-16 11:17:17,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 64 remaining) [2022-11-16 11:17:17,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 64 remaining) [2022-11-16 11:17:17,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 64 remaining) [2022-11-16 11:17:17,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (26 of 64 remaining) [2022-11-16 11:17:17,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 64 remaining) [2022-11-16 11:17:17,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 64 remaining) [2022-11-16 11:17:17,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 64 remaining) [2022-11-16 11:17:17,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 64 remaining) [2022-11-16 11:17:17,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 64 remaining) [2022-11-16 11:17:17,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 64 remaining) [2022-11-16 11:17:17,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 64 remaining) [2022-11-16 11:17:17,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 64 remaining) [2022-11-16 11:17:17,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 64 remaining) [2022-11-16 11:17:17,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 64 remaining) [2022-11-16 11:17:17,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 64 remaining) [2022-11-16 11:17:17,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 64 remaining) [2022-11-16 11:17:17,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 64 remaining) [2022-11-16 11:17:17,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 64 remaining) [2022-11-16 11:17:17,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 64 remaining) [2022-11-16 11:17:17,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 64 remaining) [2022-11-16 11:17:17,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 64 remaining) [2022-11-16 11:17:17,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 64 remaining) [2022-11-16 11:17:17,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 64 remaining) [2022-11-16 11:17:17,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 64 remaining) [2022-11-16 11:17:17,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 64 remaining) [2022-11-16 11:17:17,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 64 remaining) [2022-11-16 11:17:17,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 64 remaining) [2022-11-16 11:17:17,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 64 remaining) [2022-11-16 11:17:17,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 64 remaining) [2022-11-16 11:17:17,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 64 remaining) [2022-11-16 11:17:17,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:17,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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-16 11:17:17,596 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:17:17,604 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:17:17,604 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:17:17,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:17:17 BasicIcfg [2022-11-16 11:17:17,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:17:17,743 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:17:17,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:17:17,743 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:17:17,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:13:12" (3/4) ... [2022-11-16 11:17:17,756 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:17:17,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:17:17,757 INFO L158 Benchmark]: Toolchain (without parser) took 247728.99ms. Allocated memory was 67.1MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 46.5MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2022-11-16 11:17:17,758 INFO L158 Benchmark]: CDTParser took 2.96ms. Allocated memory is still 67.1MB. Free memory was 48.6MB in the beginning and 48.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:17:17,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 717.78ms. Allocated memory is still 67.1MB. Free memory was 46.3MB in the beginning and 37.2MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:17:17,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.76ms. Allocated memory is still 67.1MB. Free memory was 37.2MB in the beginning and 34.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:17:17,759 INFO L158 Benchmark]: Boogie Preprocessor took 77.37ms. Allocated memory is still 67.1MB. Free memory was 34.6MB in the beginning and 32.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:17:17,759 INFO L158 Benchmark]: RCFGBuilder took 1893.90ms. Allocated memory was 67.1MB in the beginning and 117.4MB in the end (delta: 50.3MB). Free memory was 32.0MB in the beginning and 51.5MB in the end (delta: -19.5MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2022-11-16 11:17:17,760 INFO L158 Benchmark]: TraceAbstraction took 244918.15ms. Allocated memory was 117.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 50.6MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2022-11-16 11:17:17,760 INFO L158 Benchmark]: Witness Printer took 13.93ms. Allocated memory is still 4.1GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:17:17,762 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.96ms. Allocated memory is still 67.1MB. Free memory was 48.6MB in the beginning and 48.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 717.78ms. Allocated memory is still 67.1MB. Free memory was 46.3MB in the beginning and 37.2MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.76ms. Allocated memory is still 67.1MB. Free memory was 37.2MB in the beginning and 34.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.37ms. Allocated memory is still 67.1MB. Free memory was 34.6MB in the beginning and 32.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1893.90ms. Allocated memory was 67.1MB in the beginning and 117.4MB in the end (delta: 50.3MB). Free memory was 32.0MB in the beginning and 51.5MB in the end (delta: -19.5MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * TraceAbstraction took 244918.15ms. Allocated memory was 117.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 50.6MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 13.93ms. Allocated memory is still 4.1GB. Free memory is still 1.3GB. 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: 56.0s, 206 PlacesBefore, 86 PlacesAfterwards, 195 TransitionsBefore, 74 TransitionsAfterwards, 7132 CoEnabledTransitionPairs, 8 FixpointIterations, 81 TrivialSequentialCompositions, 103 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 191 TotalNumberOfCompositions, 24826 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11714, independent: 11267, independent conditional: 0, independent unconditional: 11267, dependent: 360, dependent conditional: 0, dependent unconditional: 360, unknown: 87, unknown conditional: 0, unknown unconditional: 87] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4489, independent: 4397, independent conditional: 0, independent unconditional: 4397, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4489, independent: 4121, independent conditional: 0, independent unconditional: 4121, dependent: 368, dependent conditional: 0, dependent unconditional: 368, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 368, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4293, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 1930, dependent conditional: 0, dependent unconditional: 1930, unknown: 637, unknown conditional: 0, unknown unconditional: 637] ], Cache Queries: [ total: 11714, independent: 6870, independent conditional: 0, independent unconditional: 6870, dependent: 281, dependent conditional: 0, dependent unconditional: 281, unknown: 4563, unknown conditional: 0, unknown unconditional: 4563] , Statistics on independence cache: Total cache size (in pairs): 827, Positive cache size: 794, Positive conditional cache size: 0, Positive unconditional cache size: 794, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7 - 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: [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; [L757] 0 _Bool a$w_buff1_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L747] 0 _Bool a$r_buff1_thd0; [L711] 0 int __unbuffered_cnt = 0; [L753] 0 int *a$read_delayed_var; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L755] 0 _Bool a$w_buff0_used; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L713] 0 int __unbuffered_p0_EAX = 0; [L741] 0 int a$mem_tmp; [L752] 0 _Bool a$read_delayed; [L733] 0 int __unbuffered_p1_EAX = 0; [L739] 0 int a = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L754] 0 int a$w_buff0; [L756] 0 int a$w_buff1; [L740] 0 _Bool a$flush_delayed; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L759] 0 _Bool main$tmp_guard1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L758] 0 _Bool main$tmp_guard0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L742] 0 _Bool a$r_buff0_thd0; [L737] 0 int __unbuffered_p3_EAX = 0; [L745] 0 _Bool a$r_buff0_thd3; [L744] 0 _Bool a$r_buff0_thd2; [L746] 0 _Bool a$r_buff0_thd4; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L861] 0 pthread_t t2705; [L862] FCALL, FORK 0 pthread_create(&t2705, ((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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2705, ((void *)0), P0, ((void *)0))=0, t2705={11:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t2706; 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2705={11:0}, t2706={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t2706, ((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=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2706, ((void *)0), P1, ((void *)0))=1, t2705={11:0}, t2706={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t2707; 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2705={11:0}, t2706={5:0}, t2707={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t2707, ((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=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2707, ((void *)0), P2, ((void *)0))=2, t2705={11:0}, t2706={5:0}, t2707={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t2708; [L868] FCALL, FORK 0 pthread_create(&t2708, ((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=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2708, ((void *)0), P3, ((void *)0))=3, t2705={11:0}, t2706={5:0}, t2707={15:0}, t2708={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L777] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L777] EXPR 1 \read(a) [L777] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L777] 1 a = !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L778] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)))) [L779] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)))) [L780] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L781] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L782] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L783] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$r_buff1_thd1 : (_Bool)0) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L784] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L785] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L786] EXPR 1 \read(a) [L786] 1 __unbuffered_p0_EAX = a [L787] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L787] EXPR 1 \read(a) [L787] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L787] 1 a = a$flush_delayed ? a$mem_tmp : a [L788] 1 a$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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L791] 1 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L803] 2 __unbuffered_p1_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_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L796] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 1 return 0; [L806] 2 y = 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_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L818] 3 __unbuffered_p2_EAX = y 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L821] 3 z = 1 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L833] 4 __unbuffered_p3_EAX = z 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L836] 4 a = 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 4 \read(a) [L839] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 \read(a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t2705={11:0}, t2706={5:0}, t2707={15:0}, t2708={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L885] 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice1=128, weak$$choice2=0, x=1, y=1, z=1] - 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: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 868]: 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: 866]: 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: 864]: 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, 249 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 244.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 59.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 402 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 402 mSDsluCounter, 335 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 232 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1476 IncrementalHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 103 mSDtfsCounter, 1476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58328occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 559 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 170.3s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 699 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1735 ConjunctsInSsa, 62 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-16 11:17:17,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56baba23-e206-430f-8513-1d6fe20b2306/bin/uautomizer-tPACEb0tL8/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