./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --- 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-8393723 [2022-11-19 07:21:05,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:21:05,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:21:05,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:21:05,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:21:05,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:21:05,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:21:05,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:21:05,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:21:05,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:21:05,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:21:05,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:21:05,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:21:05,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:21:05,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:21:05,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:21:05,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:21:05,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:21:05,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:21:05,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:21:05,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:21:05,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:21:05,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:21:05,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:21:05,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:21:05,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:21:05,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:21:05,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:21:05,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:21:05,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:21:05,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:21:05,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:21:05,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:21:05,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:21:05,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:21:05,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:21:05,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:21:05,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:21:05,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:21:05,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:21:05,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:21:05,678 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 07:21:05,725 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:21:05,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:21:05,726 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:21:05,726 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:21:05,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:21:05,727 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:21:05,727 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:21:05,728 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:21:05,728 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:21:05,728 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:21:05,729 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:21:05,729 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:21:05,730 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:21:05,730 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:21:05,730 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:21:05,730 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:21:05,730 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:21:05,731 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:21:05,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:21:05,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:21:05,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:21:05,733 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:21:05,734 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:21:05,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:21:05,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:21:05,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:21:05,734 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:21:05,735 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:21:05,735 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:21:05,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:21:05,736 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:21:05,736 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:21:05,736 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:21:05,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:21:05,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:21:05,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:21:05,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:21:05,737 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:21:05,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:21:05,737 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:21:05,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:21:05,738 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:21:05,738 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_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS 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 -> Taipan 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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 [2022-11-19 07:21:06,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:21:06,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:21:06,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:21:06,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:21:06,127 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:21:06,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-11-19 07:21:06,195 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/data/ba4adc0c3/dd088d9ed8d84a1ca08008bcabd60d02/FLAG0fd59a463 [2022-11-19 07:21:06,924 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:21:06,931 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-11-19 07:21:06,948 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/data/ba4adc0c3/dd088d9ed8d84a1ca08008bcabd60d02/FLAG0fd59a463 [2022-11-19 07:21:07,171 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/data/ba4adc0c3/dd088d9ed8d84a1ca08008bcabd60d02 [2022-11-19 07:21:07,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:21:07,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:21:07,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:21:07,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:21:07,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:21:07,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:21:07" (1/1) ... [2022-11-19 07:21:07,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ed6191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:07, skipping insertion in model container [2022-11-19 07:21:07,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:21:07" (1/1) ... [2022-11-19 07:21:07,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:21:07,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:21:07,500 WARN L234 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_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-11-19 07:21:07,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:21:07,903 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:21:07,918 WARN L234 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_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-11-19 07:21:07,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:21:08,013 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:21:08,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08 WrapperNode [2022-11-19 07:21:08,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:21:08,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:21:08,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:21:08,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:21:08,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (1/1) ... [2022-11-19 07:21:08,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (1/1) ... [2022-11-19 07:21:08,104 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-11-19 07:21:08,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:21:08,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:21:08,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:21:08,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:21:08,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (1/1) ... [2022-11-19 07:21:08,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (1/1) ... [2022-11-19 07:21:08,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (1/1) ... [2022-11-19 07:21:08,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (1/1) ... [2022-11-19 07:21:08,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (1/1) ... [2022-11-19 07:21:08,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (1/1) ... [2022-11-19 07:21:08,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (1/1) ... [2022-11-19 07:21:08,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (1/1) ... [2022-11-19 07:21:08,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:21:08,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:21:08,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:21:08,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:21:08,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (1/1) ... [2022-11-19 07:21:08,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:21:08,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:21:08,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:21:08,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:21:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 07:21:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:21:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:21:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:21:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:21:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:21:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:21:08,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:21:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:21:08,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:21:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:21:08,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:21:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:21:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:21:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:21:08,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:21:08,291 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:21:08,565 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:21:08,572 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:21:09,431 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:21:10,297 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:21:10,297 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:21:10,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:21:10 BoogieIcfgContainer [2022-11-19 07:21:10,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:21:10,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:21:10,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:21:10,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:21:10,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:21:07" (1/3) ... [2022-11-19 07:21:10,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5603d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:21:10, skipping insertion in model container [2022-11-19 07:21:10,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:08" (2/3) ... [2022-11-19 07:21:10,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5603d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:21:10, skipping insertion in model container [2022-11-19 07:21:10,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:21:10" (3/3) ... [2022-11-19 07:21:10,314 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2022-11-19 07:21:10,339 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:21:10,339 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-19 07:21:10,339 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:21:10,528 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:21:10,588 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:21:10,606 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 178 transitions, 371 flow [2022-11-19 07:21:10,611 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 178 transitions, 371 flow [2022-11-19 07:21:10,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 178 transitions, 371 flow [2022-11-19 07:21:10,731 INFO L130 PetriNetUnfolder]: 2/175 cut-off events. [2022-11-19 07:21:10,731 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:21:10,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 2/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 247 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-11-19 07:21:10,742 INFO L119 LiptonReduction]: Number of co-enabled transitions 6624 [2022-11-19 07:21:30,209 INFO L134 LiptonReduction]: Checked pairs total: 34115 [2022-11-19 07:21:30,210 INFO L136 LiptonReduction]: Total number of compositions: 156 [2022-11-19 07:21:30,219 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 73 transitions, 161 flow [2022-11-19 07:21:31,555 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:31,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:21:31,586 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;@66042254, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:21:31,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-11-19 07:21:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:21:31,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:31,658 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:21:31,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1138, now seen corresponding path program 1 times [2022-11-19 07:21:31,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:31,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655317544] [2022-11-19 07:21:31,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:31,962 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-19 07:21:31,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:31,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655317544] [2022-11-19 07:21:31,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655317544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:31,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:31,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:21:31,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824592859] [2022-11-19 07:21:31,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:31,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:21:31,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:32,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:21:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:21:32,065 INFO L87 Difference]: Start difference. First operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 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-19 07:21:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:32,659 INFO L93 Difference]: Finished difference Result 15204 states and 54879 transitions. [2022-11-19 07:21:32,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:21:32,662 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-19 07:21:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:32,850 INFO L225 Difference]: With dead ends: 15204 [2022-11-19 07:21:32,851 INFO L226 Difference]: Without dead ends: 15204 [2022-11-19 07:21:32,852 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-19 07:21:32,856 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:32,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:21:33,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2022-11-19 07:21:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 15204. [2022-11-19 07:21:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15204 states, 13315 states have (on average 4.121592189260233) internal successors, (54879), 15203 states have internal predecessors, (54879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15204 states to 15204 states and 54879 transitions. [2022-11-19 07:21:34,234 INFO L78 Accepts]: Start accepts. Automaton has 15204 states and 54879 transitions. Word has length 1 [2022-11-19 07:21:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:34,235 INFO L495 AbstractCegarLoop]: Abstraction has 15204 states and 54879 transitions. [2022-11-19 07:21:34,235 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-19 07:21:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 15204 states and 54879 transitions. [2022-11-19 07:21:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 07:21:34,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:34,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 07:21:34,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:21:34,237 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:34,238 INFO L85 PathProgramCache]: Analyzing trace with hash 34816038, now seen corresponding path program 1 times [2022-11-19 07:21:34,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:34,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408883758] [2022-11-19 07:21:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:34,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:34,768 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-19 07:21:34,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:34,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408883758] [2022-11-19 07:21:34,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408883758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:34,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:34,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:21:34,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286575174] [2022-11-19 07:21:34,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:34,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:21:34,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:34,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:21:34,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:21:34,778 INFO L87 Difference]: Start difference. First operand 15204 states and 54879 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:35,213 INFO L93 Difference]: Finished difference Result 13683 states and 49236 transitions. [2022-11-19 07:21:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:21:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-19 07:21:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:35,311 INFO L225 Difference]: With dead ends: 13683 [2022-11-19 07:21:35,312 INFO L226 Difference]: Without dead ends: 13683 [2022-11-19 07:21:35,313 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-19 07:21:35,314 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:35,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:21:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13683 states. [2022-11-19 07:21:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13683 to 13683. [2022-11-19 07:21:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13683 states, 12109 states have (on average 4.066066562061277) internal successors, (49236), 13682 states have internal predecessors, (49236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13683 states to 13683 states and 49236 transitions. [2022-11-19 07:21:36,279 INFO L78 Accepts]: Start accepts. Automaton has 13683 states and 49236 transitions. Word has length 4 [2022-11-19 07:21:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:36,280 INFO L495 AbstractCegarLoop]: Abstraction has 13683 states and 49236 transitions. [2022-11-19 07:21:36,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 13683 states and 49236 transitions. [2022-11-19 07:21:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:21:36,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:36,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:21:36,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:21:36,282 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:36,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1079298110, now seen corresponding path program 1 times [2022-11-19 07:21:36,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:36,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009715274] [2022-11-19 07:21:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:36,500 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-19 07:21:36,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:36,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009715274] [2022-11-19 07:21:36,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009715274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:36,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:36,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:21:36,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221554403] [2022-11-19 07:21:36,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:36,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:21:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:36,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:21:36,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:21:36,503 INFO L87 Difference]: Start difference. First operand 13683 states and 49236 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:37,174 INFO L93 Difference]: Finished difference Result 17556 states and 63266 transitions. [2022-11-19 07:21:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:21:37,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-19 07:21:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:37,305 INFO L225 Difference]: With dead ends: 17556 [2022-11-19 07:21:37,306 INFO L226 Difference]: Without dead ends: 17556 [2022-11-19 07:21:37,306 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-19 07:21:37,307 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:37,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 6 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:21:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17556 states. [2022-11-19 07:21:37,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17556 to 14790. [2022-11-19 07:21:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14790 states, 13280 states have (on average 4.209638554216867) internal successors, (55904), 14789 states have internal predecessors, (55904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14790 states to 14790 states and 55904 transitions. [2022-11-19 07:21:38,027 INFO L78 Accepts]: Start accepts. Automaton has 14790 states and 55904 transitions. Word has length 5 [2022-11-19 07:21:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:38,029 INFO L495 AbstractCegarLoop]: Abstraction has 14790 states and 55904 transitions. [2022-11-19 07:21:38,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 14790 states and 55904 transitions. [2022-11-19 07:21:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:21:38,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:38,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:21:38,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:21:38,031 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:38,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1079298112, now seen corresponding path program 1 times [2022-11-19 07:21:38,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:38,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501045312] [2022-11-19 07:21:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:38,510 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-19 07:21:38,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:38,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501045312] [2022-11-19 07:21:38,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501045312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:38,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:38,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:21:38,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045829772] [2022-11-19 07:21:38,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:38,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:21:38,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:38,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:21:38,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:21:38,513 INFO L87 Difference]: Start difference. First operand 14790 states and 55904 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:38,869 INFO L93 Difference]: Finished difference Result 7762 states and 28303 transitions. [2022-11-19 07:21:38,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:21:38,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-19 07:21:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:39,025 INFO L225 Difference]: With dead ends: 7762 [2022-11-19 07:21:39,026 INFO L226 Difference]: Without dead ends: 7762 [2022-11-19 07:21:39,026 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-19 07:21:39,028 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 56 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:39,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:21:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2022-11-19 07:21:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 7762. [2022-11-19 07:21:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7762 states, 7237 states have (on average 3.910874671825342) internal successors, (28303), 7761 states have internal predecessors, (28303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7762 states to 7762 states and 28303 transitions. [2022-11-19 07:21:39,281 INFO L78 Accepts]: Start accepts. Automaton has 7762 states and 28303 transitions. Word has length 5 [2022-11-19 07:21:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:39,282 INFO L495 AbstractCegarLoop]: Abstraction has 7762 states and 28303 transitions. [2022-11-19 07:21:39,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7762 states and 28303 transitions. [2022-11-19 07:21:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:21:39,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:39,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:21:39,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:21:39,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1079298113, now seen corresponding path program 1 times [2022-11-19 07:21:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:39,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606775508] [2022-11-19 07:21:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:21:39,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:39,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606775508] [2022-11-19 07:21:39,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606775508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:39,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:39,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:21:39,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797927114] [2022-11-19 07:21:39,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:39,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:21:39,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:39,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:21:39,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:21:39,627 INFO L87 Difference]: Start difference. First operand 7762 states and 28303 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:39,847 INFO L93 Difference]: Finished difference Result 2820 states and 9632 transitions. [2022-11-19 07:21:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:21:39,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-19 07:21:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:39,858 INFO L225 Difference]: With dead ends: 2820 [2022-11-19 07:21:39,858 INFO L226 Difference]: Without dead ends: 2820 [2022-11-19 07:21:39,859 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-19 07:21:39,859 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:39,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 4 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:21:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2022-11-19 07:21:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2689. [2022-11-19 07:21:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2615 states have (on average 3.5196940726577437) internal successors, (9204), 2688 states have internal predecessors, (9204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 9204 transitions. [2022-11-19 07:21:39,933 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 9204 transitions. Word has length 5 [2022-11-19 07:21:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:39,934 INFO L495 AbstractCegarLoop]: Abstraction has 2689 states and 9204 transitions. [2022-11-19 07:21:39,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 9204 transitions. [2022-11-19 07:21:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:21:39,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:39,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:39,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:21:39,937 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:39,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash -836772000, now seen corresponding path program 1 times [2022-11-19 07:21:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:39,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401471284] [2022-11-19 07:21:39,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:39,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:40,060 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-19 07:21:40,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:40,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401471284] [2022-11-19 07:21:40,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401471284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:40,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:40,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:21:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916095750] [2022-11-19 07:21:40,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:40,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:21:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:21:40,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:21:40,064 INFO L87 Difference]: Start difference. First operand 2689 states and 9204 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:40,203 INFO L93 Difference]: Finished difference Result 2639 states and 9024 transitions. [2022-11-19 07:21:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:21:40,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-19 07:21:40,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:40,214 INFO L225 Difference]: With dead ends: 2639 [2022-11-19 07:21:40,214 INFO L226 Difference]: Without dead ends: 2639 [2022-11-19 07:21:40,214 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-19 07:21:40,215 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:40,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:21:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2022-11-19 07:21:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2639. [2022-11-19 07:21:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2565 states have (on average 3.51812865497076) internal successors, (9024), 2638 states have internal predecessors, (9024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 9024 transitions. [2022-11-19 07:21:40,287 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 9024 transitions. Word has length 10 [2022-11-19 07:21:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:40,287 INFO L495 AbstractCegarLoop]: Abstraction has 2639 states and 9024 transitions. [2022-11-19 07:21:40,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 9024 transitions. [2022-11-19 07:21:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:21:40,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:40,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:40,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:21:40,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:40,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1960879700, now seen corresponding path program 1 times [2022-11-19 07:21:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:40,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195800099] [2022-11-19 07:21:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:40,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:40,603 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-19 07:21:40,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:40,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195800099] [2022-11-19 07:21:40,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195800099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:40,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:40,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:21:40,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574960494] [2022-11-19 07:21:40,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:40,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:21:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:40,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:21:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:21:40,606 INFO L87 Difference]: Start difference. First operand 2639 states and 9024 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:40,834 INFO L93 Difference]: Finished difference Result 2539 states and 8689 transitions. [2022-11-19 07:21:40,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:21:40,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-19 07:21:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:40,844 INFO L225 Difference]: With dead ends: 2539 [2022-11-19 07:21:40,845 INFO L226 Difference]: Without dead ends: 2539 [2022-11-19 07:21:40,845 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-19 07:21:40,846 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:40,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 7 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:21:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2022-11-19 07:21:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2539. [2022-11-19 07:21:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 2466 states have (on average 3.523519870235199) internal successors, (8689), 2538 states have internal predecessors, (8689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 8689 transitions. [2022-11-19 07:21:40,911 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 8689 transitions. Word has length 11 [2022-11-19 07:21:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:40,911 INFO L495 AbstractCegarLoop]: Abstraction has 2539 states and 8689 transitions. [2022-11-19 07:21:40,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 8689 transitions. [2022-11-19 07:21:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:21:40,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:40,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:40,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:21:40,914 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:40,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1960879699, now seen corresponding path program 1 times [2022-11-19 07:21:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:40,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428304354] [2022-11-19 07:21:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:40,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:41,238 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-19 07:21:41,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:41,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428304354] [2022-11-19 07:21:41,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428304354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:41,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:41,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:21:41,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617163236] [2022-11-19 07:21:41,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:41,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:21:41,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:41,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:21:41,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:21:41,241 INFO L87 Difference]: Start difference. First operand 2539 states and 8689 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:41,568 INFO L93 Difference]: Finished difference Result 3667 states and 12289 transitions. [2022-11-19 07:21:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:21:41,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-19 07:21:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:41,590 INFO L225 Difference]: With dead ends: 3667 [2022-11-19 07:21:41,590 INFO L226 Difference]: Without dead ends: 3667 [2022-11-19 07:21:41,590 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-19 07:21:41,590 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 107 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:41,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 9 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:21:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3667 states. [2022-11-19 07:21:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3667 to 2655. [2022-11-19 07:21:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2582 states have (on average 3.493415956622773) internal successors, (9020), 2654 states have internal predecessors, (9020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 9020 transitions. [2022-11-19 07:21:41,704 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 9020 transitions. Word has length 11 [2022-11-19 07:21:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:41,705 INFO L495 AbstractCegarLoop]: Abstraction has 2655 states and 9020 transitions. [2022-11-19 07:21:41,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 9020 transitions. [2022-11-19 07:21:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:21:41,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:41,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:41,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:21:41,707 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash -170133498, now seen corresponding path program 1 times [2022-11-19 07:21:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:41,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232561761] [2022-11-19 07:21:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:41,920 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-19 07:21:41,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:41,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232561761] [2022-11-19 07:21:41,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232561761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:41,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:41,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:21:41,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805936900] [2022-11-19 07:21:41,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:41,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:21:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:41,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:21:41,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:21:41,925 INFO L87 Difference]: Start difference. First operand 2655 states and 9020 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:42,066 INFO L93 Difference]: Finished difference Result 2630 states and 8925 transitions. [2022-11-19 07:21:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:21:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-19 07:21:42,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:42,077 INFO L225 Difference]: With dead ends: 2630 [2022-11-19 07:21:42,077 INFO L226 Difference]: Without dead ends: 2630 [2022-11-19 07:21:42,078 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-19 07:21:42,078 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4 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-19 07:21:42,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:21:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2022-11-19 07:21:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2630. [2022-11-19 07:21:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 2557 states have (on average 3.4904184591317953) internal successors, (8925), 2629 states have internal predecessors, (8925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 8925 transitions. [2022-11-19 07:21:42,176 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 8925 transitions. Word has length 11 [2022-11-19 07:21:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:42,176 INFO L495 AbstractCegarLoop]: Abstraction has 2630 states and 8925 transitions. [2022-11-19 07:21:42,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 8925 transitions. [2022-11-19 07:21:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:21:42,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:42,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:42,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:21:42,179 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:42,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:42,179 INFO L85 PathProgramCache]: Analyzing trace with hash -982738378, now seen corresponding path program 1 times [2022-11-19 07:21:42,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:42,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464265982] [2022-11-19 07:21:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:42,517 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-19 07:21:42,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:42,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464265982] [2022-11-19 07:21:42,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464265982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:42,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:42,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:21:42,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097643719] [2022-11-19 07:21:42,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:42,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:21:42,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:42,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:21:42,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:21:42,520 INFO L87 Difference]: Start difference. First operand 2630 states and 8925 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:42,657 INFO L93 Difference]: Finished difference Result 2610 states and 8850 transitions. [2022-11-19 07:21:42,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:21:42,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-19 07:21:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:42,670 INFO L225 Difference]: With dead ends: 2610 [2022-11-19 07:21:42,670 INFO L226 Difference]: Without dead ends: 2610 [2022-11-19 07:21:42,670 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-19 07:21:42,671 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:42,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:21:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2022-11-19 07:21:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2022-11-19 07:21:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2537 states have (on average 3.488372093023256) internal successors, (8850), 2609 states have internal predecessors, (8850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 8850 transitions. [2022-11-19 07:21:42,770 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 8850 transitions. Word has length 12 [2022-11-19 07:21:42,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:42,770 INFO L495 AbstractCegarLoop]: Abstraction has 2610 states and 8850 transitions. [2022-11-19 07:21:42,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 8850 transitions. [2022-11-19 07:21:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:21:42,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:42,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:42,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:21:42,773 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:42,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash -701529239, now seen corresponding path program 1 times [2022-11-19 07:21:42,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:42,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005902249] [2022-11-19 07:21:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:42,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:43,289 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-19 07:21:43,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:43,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005902249] [2022-11-19 07:21:43,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005902249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:43,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:43,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:21:43,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745814576] [2022-11-19 07:21:43,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:43,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:21:43,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:43,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:21:43,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:21:43,292 INFO L87 Difference]: Start difference. First operand 2610 states and 8850 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-19 07:21:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:43,591 INFO L93 Difference]: Finished difference Result 2550 states and 8657 transitions. [2022-11-19 07:21:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:21:43,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-19 07:21:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:43,602 INFO L225 Difference]: With dead ends: 2550 [2022-11-19 07:21:43,602 INFO L226 Difference]: Without dead ends: 2550 [2022-11-19 07:21:43,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:21:43,603 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 112 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:43,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 8 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:21:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2022-11-19 07:21:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2394. [2022-11-19 07:21:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2322 states have (on average 3.5245478036175713) internal successors, (8184), 2393 states have internal predecessors, (8184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 8184 transitions. [2022-11-19 07:21:43,691 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 8184 transitions. Word has length 13 [2022-11-19 07:21:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:43,692 INFO L495 AbstractCegarLoop]: Abstraction has 2394 states and 8184 transitions. [2022-11-19 07:21:43,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-19 07:21:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 8184 transitions. [2022-11-19 07:21:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:21:43,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:43,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:43,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:21:43,694 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:43,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1081520514, now seen corresponding path program 1 times [2022-11-19 07:21:43,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:43,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123717430] [2022-11-19 07:21:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:43,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:43,991 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-19 07:21:43,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:43,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123717430] [2022-11-19 07:21:43,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123717430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:43,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:43,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:21:43,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830534426] [2022-11-19 07:21:43,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:43,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:21:43,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:43,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:21:43,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:21:43,994 INFO L87 Difference]: Start difference. First operand 2394 states and 8184 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-19 07:21:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:44,181 INFO L93 Difference]: Finished difference Result 3510 states and 11891 transitions. [2022-11-19 07:21:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:21:44,182 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-19 07:21:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:44,193 INFO L225 Difference]: With dead ends: 3510 [2022-11-19 07:21:44,194 INFO L226 Difference]: Without dead ends: 3510 [2022-11-19 07:21:44,194 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-19 07:21:44,195 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 63 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:44,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 3 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:21:44,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2022-11-19 07:21:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 2566. [2022-11-19 07:21:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2494 states have (on average 3.5) internal successors, (8729), 2565 states have internal predecessors, (8729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 8729 transitions. [2022-11-19 07:21:44,307 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 8729 transitions. Word has length 13 [2022-11-19 07:21:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:44,307 INFO L495 AbstractCegarLoop]: Abstraction has 2566 states and 8729 transitions. [2022-11-19 07:21:44,307 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-19 07:21:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 8729 transitions. [2022-11-19 07:21:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:21:44,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:44,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:44,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:21:44,310 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:44,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash -289528716, now seen corresponding path program 1 times [2022-11-19 07:21:44,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:44,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836209361] [2022-11-19 07:21:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:44,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:44,677 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-19 07:21:44,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:44,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836209361] [2022-11-19 07:21:44,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836209361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:44,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:44,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:21:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625586932] [2022-11-19 07:21:44,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:44,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:21:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:44,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:21:44,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:21:44,680 INFO L87 Difference]: Start difference. First operand 2566 states and 8729 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-19 07:21:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:44,932 INFO L93 Difference]: Finished difference Result 3218 states and 9908 transitions. [2022-11-19 07:21:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:21:44,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-19 07:21:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:44,949 INFO L225 Difference]: With dead ends: 3218 [2022-11-19 07:21:44,950 INFO L226 Difference]: Without dead ends: 3088 [2022-11-19 07:21:44,950 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-19 07:21:44,951 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 54 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:44,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 10 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:21:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2022-11-19 07:21:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 2854. [2022-11-19 07:21:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2782 states have (on average 3.2771387491013657) internal successors, (9117), 2853 states have internal predecessors, (9117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 9117 transitions. [2022-11-19 07:21:45,054 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 9117 transitions. Word has length 13 [2022-11-19 07:21:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:45,055 INFO L495 AbstractCegarLoop]: Abstraction has 2854 states and 9117 transitions. [2022-11-19 07:21:45,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-19 07:21:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 9117 transitions. [2022-11-19 07:21:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:21:45,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:45,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:45,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:21:45,058 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:45,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:45,058 INFO L85 PathProgramCache]: Analyzing trace with hash -722135147, now seen corresponding path program 1 times [2022-11-19 07:21:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:45,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626737415] [2022-11-19 07:21:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:45,334 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-19 07:21:45,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:45,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626737415] [2022-11-19 07:21:45,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626737415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:45,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:45,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:21:45,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647309127] [2022-11-19 07:21:45,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:45,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:21:45,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:45,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:21:45,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:21:45,336 INFO L87 Difference]: Start difference. First operand 2854 states and 9117 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:45,495 INFO L93 Difference]: Finished difference Result 3818 states and 12076 transitions. [2022-11-19 07:21:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:21:45,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 07:21:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:45,516 INFO L225 Difference]: With dead ends: 3818 [2022-11-19 07:21:45,516 INFO L226 Difference]: Without dead ends: 3818 [2022-11-19 07:21:45,516 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-19 07:21:45,517 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:45,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:21:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2022-11-19 07:21:45,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 2839. [2022-11-19 07:21:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2767 states have (on average 3.275027105168052) internal successors, (9062), 2838 states have internal predecessors, (9062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 9062 transitions. [2022-11-19 07:21:45,629 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 9062 transitions. Word has length 14 [2022-11-19 07:21:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:45,631 INFO L495 AbstractCegarLoop]: Abstraction has 2839 states and 9062 transitions. [2022-11-19 07:21:45,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 9062 transitions. [2022-11-19 07:21:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:21:45,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:45,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:45,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:21:45,634 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:45,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:45,634 INFO L85 PathProgramCache]: Analyzing trace with hash -385454113, now seen corresponding path program 1 times [2022-11-19 07:21:45,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:45,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042689643] [2022-11-19 07:21:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:46,217 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-19 07:21:46,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:46,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042689643] [2022-11-19 07:21:46,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042689643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:46,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:46,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 07:21:46,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826697862] [2022-11-19 07:21:46,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:46,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:21:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:46,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:21:46,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:21:46,219 INFO L87 Difference]: Start difference. First operand 2839 states and 9062 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-19 07:21:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:47,011 INFO L93 Difference]: Finished difference Result 2207 states and 6833 transitions. [2022-11-19 07:21:47,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:21:47,012 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-19 07:21:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:47,022 INFO L225 Difference]: With dead ends: 2207 [2022-11-19 07:21:47,022 INFO L226 Difference]: Without dead ends: 2159 [2022-11-19 07:21:47,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:21:47,023 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 109 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:47,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 44 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-19 07:21:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2159 states. [2022-11-19 07:21:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2159 to 2159. [2022-11-19 07:21:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 2123 states have (on average 3.1130475741874704) internal successors, (6609), 2158 states have internal predecessors, (6609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 6609 transitions. [2022-11-19 07:21:47,097 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 6609 transitions. Word has length 14 [2022-11-19 07:21:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:47,097 INFO L495 AbstractCegarLoop]: Abstraction has 2159 states and 6609 transitions. [2022-11-19 07:21:47,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-19 07:21:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 6609 transitions. [2022-11-19 07:21:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:21:47,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:47,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:47,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:21:47,100 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:47,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:47,101 INFO L85 PathProgramCache]: Analyzing trace with hash -385454175, now seen corresponding path program 1 times [2022-11-19 07:21:47,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:47,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324982138] [2022-11-19 07:21:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:47,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:47,651 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-19 07:21:47,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:47,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324982138] [2022-11-19 07:21:47,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324982138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:47,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:47,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:21:47,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408383045] [2022-11-19 07:21:47,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:47,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:21:47,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:47,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:21:47,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:21:47,656 INFO L87 Difference]: Start difference. First operand 2159 states and 6609 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-19 07:21:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:48,056 INFO L93 Difference]: Finished difference Result 2722 states and 8247 transitions. [2022-11-19 07:21:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:21:48,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-19 07:21:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:48,068 INFO L225 Difference]: With dead ends: 2722 [2022-11-19 07:21:48,068 INFO L226 Difference]: Without dead ends: 2722 [2022-11-19 07:21:48,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:21:48,075 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 97 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:48,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 16 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:21:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2022-11-19 07:21:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2477. [2022-11-19 07:21:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2441 states have (on average 3.0729209340434247) internal successors, (7501), 2476 states have internal predecessors, (7501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 7501 transitions. [2022-11-19 07:21:48,154 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 7501 transitions. Word has length 14 [2022-11-19 07:21:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:48,155 INFO L495 AbstractCegarLoop]: Abstraction has 2477 states and 7501 transitions. [2022-11-19 07:21:48,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-19 07:21:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 7501 transitions. [2022-11-19 07:21:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:21:48,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:48,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:48,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:21:48,159 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:48,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:48,161 INFO L85 PathProgramCache]: Analyzing trace with hash -911356429, now seen corresponding path program 1 times [2022-11-19 07:21:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:48,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928081445] [2022-11-19 07:21:48,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:48,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:48,417 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-19 07:21:48,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:48,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928081445] [2022-11-19 07:21:48,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928081445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:48,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:48,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:21:48,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226542167] [2022-11-19 07:21:48,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:48,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:21:48,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:48,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:21:48,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:21:48,420 INFO L87 Difference]: Start difference. First operand 2477 states and 7501 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-19 07:21:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:48,540 INFO L93 Difference]: Finished difference Result 2468 states and 7471 transitions. [2022-11-19 07:21:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:21:48,541 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-19 07:21:48,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:48,552 INFO L225 Difference]: With dead ends: 2468 [2022-11-19 07:21:48,552 INFO L226 Difference]: Without dead ends: 2468 [2022-11-19 07:21:48,552 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-19 07:21:48,553 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:48,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:21:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2022-11-19 07:21:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2468. [2022-11-19 07:21:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2432 states have (on average 3.0719572368421053) internal successors, (7471), 2467 states have internal predecessors, (7471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 7471 transitions. [2022-11-19 07:21:48,630 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 7471 transitions. Word has length 15 [2022-11-19 07:21:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:48,630 INFO L495 AbstractCegarLoop]: Abstraction has 2468 states and 7471 transitions. [2022-11-19 07:21:48,630 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-19 07:21:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 7471 transitions. [2022-11-19 07:21:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:21:48,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:48,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:48,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 07:21:48,634 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:48,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:48,635 INFO L85 PathProgramCache]: Analyzing trace with hash 935826155, now seen corresponding path program 1 times [2022-11-19 07:21:48,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:48,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875195648] [2022-11-19 07:21:48,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:48,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:48,814 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-19 07:21:48,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:48,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875195648] [2022-11-19 07:21:48,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875195648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:48,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:48,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:21:48,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653680926] [2022-11-19 07:21:48,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:48,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:21:48,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:48,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:21:48,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:21:48,817 INFO L87 Difference]: Start difference. First operand 2468 states and 7471 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:48,946 INFO L93 Difference]: Finished difference Result 2771 states and 8075 transitions. [2022-11-19 07:21:48,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:21:48,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 07:21:48,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:48,958 INFO L225 Difference]: With dead ends: 2771 [2022-11-19 07:21:48,958 INFO L226 Difference]: Without dead ends: 1647 [2022-11-19 07:21:48,958 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-19 07:21:48,959 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 54 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:48,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:21:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2022-11-19 07:21:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1418. [2022-11-19 07:21:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1382 states have (on average 2.7821997105643996) internal successors, (3845), 1417 states have internal predecessors, (3845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 3845 transitions. [2022-11-19 07:21:49,005 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 3845 transitions. Word has length 15 [2022-11-19 07:21:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:49,005 INFO L495 AbstractCegarLoop]: Abstraction has 1418 states and 3845 transitions. [2022-11-19 07:21:49,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 3845 transitions. [2022-11-19 07:21:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:21:49,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:49,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:49,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 07:21:49,009 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:49,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash 384769125, now seen corresponding path program 1 times [2022-11-19 07:21:49,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:49,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312056084] [2022-11-19 07:21:49,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:49,685 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-19 07:21:49,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:49,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312056084] [2022-11-19 07:21:49,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312056084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:49,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:49,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:21:49,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468156654] [2022-11-19 07:21:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:49,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:21:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:49,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:21:49,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:21:49,687 INFO L87 Difference]: Start difference. First operand 1418 states and 3845 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-19 07:21:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:49,949 INFO L93 Difference]: Finished difference Result 920 states and 2635 transitions. [2022-11-19 07:21:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:21:49,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-19 07:21:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:49,952 INFO L225 Difference]: With dead ends: 920 [2022-11-19 07:21:49,952 INFO L226 Difference]: Without dead ends: 563 [2022-11-19 07:21:49,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:21:49,953 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:49,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 11 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:21:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-19 07:21:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 383. [2022-11-19 07:21:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 2.798429319371728) internal successors, (1069), 382 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1069 transitions. [2022-11-19 07:21:49,967 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1069 transitions. Word has length 16 [2022-11-19 07:21:49,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:49,967 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 1069 transitions. [2022-11-19 07:21:49,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-19 07:21:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1069 transitions. [2022-11-19 07:21:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:21:49,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:49,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:49,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-19 07:21:49,970 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:49,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:49,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1499636377, now seen corresponding path program 1 times [2022-11-19 07:21:49,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:49,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315381462] [2022-11-19 07:21:49,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:49,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:50,229 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-19 07:21:50,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:50,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315381462] [2022-11-19 07:21:50,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315381462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:50,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:50,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:21:50,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15349041] [2022-11-19 07:21:50,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:50,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:21:50,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:50,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:21:50,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:21:50,232 INFO L87 Difference]: Start difference. First operand 383 states and 1069 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-19 07:21:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:50,335 INFO L93 Difference]: Finished difference Result 599 states and 1675 transitions. [2022-11-19 07:21:50,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:21:50,336 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-19 07:21:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:50,337 INFO L225 Difference]: With dead ends: 599 [2022-11-19 07:21:50,337 INFO L226 Difference]: Without dead ends: 323 [2022-11-19 07:21:50,338 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-19 07:21:50,339 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:50,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:21:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-19 07:21:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-11-19 07:21:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 2.8229813664596275) internal successors, (909), 322 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 909 transitions. [2022-11-19 07:21:50,353 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 909 transitions. Word has length 16 [2022-11-19 07:21:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:50,353 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 909 transitions. [2022-11-19 07:21:50,354 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-19 07:21:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 909 transitions. [2022-11-19 07:21:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:21:50,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:50,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:50,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-19 07:21:50,355 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:50,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1814530867, now seen corresponding path program 2 times [2022-11-19 07:21:50,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:50,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847596352] [2022-11-19 07:21:50,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:50,592 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-19 07:21:50,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:50,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847596352] [2022-11-19 07:21:50,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847596352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:50,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:50,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:21:50,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068031362] [2022-11-19 07:21:50,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:50,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:21:50,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:50,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:21:50,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:21:50,597 INFO L87 Difference]: Start difference. First operand 323 states and 909 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) 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-19 07:21:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:50,733 INFO L93 Difference]: Finished difference Result 431 states and 1206 transitions. [2022-11-19 07:21:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:21:50,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) 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-19 07:21:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:50,734 INFO L225 Difference]: With dead ends: 431 [2022-11-19 07:21:50,735 INFO L226 Difference]: Without dead ends: 215 [2022-11-19 07:21:50,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 07:21:50,735 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:50,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 5 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:21:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-19 07:21:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-11-19 07:21:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.677570093457944) internal successors, (573), 214 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 573 transitions. [2022-11-19 07:21:50,742 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 573 transitions. Word has length 16 [2022-11-19 07:21:50,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:50,743 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 573 transitions. [2022-11-19 07:21:50,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) 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-19 07:21:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 573 transitions. [2022-11-19 07:21:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:21:50,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:50,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:50,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-19 07:21:50,745 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:50,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1812721087, now seen corresponding path program 3 times [2022-11-19 07:21:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:50,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108614753] [2022-11-19 07:21:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:52,516 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-19 07:21:52,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:52,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108614753] [2022-11-19 07:21:52,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108614753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:52,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:52,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 07:21:52,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067217015] [2022-11-19 07:21:52,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:52,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:21:52,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:52,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:21:52,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:21:52,518 INFO L87 Difference]: Start difference. First operand 215 states and 573 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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-19 07:21:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:52,916 INFO L93 Difference]: Finished difference Result 325 states and 877 transitions. [2022-11-19 07:21:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:21:52,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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-19 07:21:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:52,917 INFO L225 Difference]: With dead ends: 325 [2022-11-19 07:21:52,917 INFO L226 Difference]: Without dead ends: 325 [2022-11-19 07:21:52,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:21:52,918 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 50 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:52,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 12 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:21:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-19 07:21:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 307. [2022-11-19 07:21:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 2.6699346405228757) internal successors, (817), 306 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 817 transitions. [2022-11-19 07:21:52,924 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 817 transitions. Word has length 16 [2022-11-19 07:21:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:52,924 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 817 transitions. [2022-11-19 07:21:52,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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-19 07:21:52,925 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 817 transitions. [2022-11-19 07:21:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:21:52,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:52,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:52,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-19 07:21:52,926 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:52,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:52,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1831053761, now seen corresponding path program 4 times [2022-11-19 07:21:52,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:52,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628421147] [2022-11-19 07:21:52,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:52,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:54,615 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-19 07:21:54,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:54,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628421147] [2022-11-19 07:21:54,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628421147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:54,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:54,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:21:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529207208] [2022-11-19 07:21:54,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:54,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:21:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:21:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:21:54,616 INFO L87 Difference]: Start difference. First operand 307 states and 817 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-19 07:21:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:54,981 INFO L93 Difference]: Finished difference Result 323 states and 860 transitions. [2022-11-19 07:21:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:21:54,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-19 07:21:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:54,983 INFO L225 Difference]: With dead ends: 323 [2022-11-19 07:21:54,983 INFO L226 Difference]: Without dead ends: 323 [2022-11-19 07:21:54,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:21:54,983 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:54,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 5 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:21:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-19 07:21:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 215. [2022-11-19 07:21:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.635514018691589) internal successors, (564), 214 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 564 transitions. [2022-11-19 07:21:54,989 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 564 transitions. Word has length 16 [2022-11-19 07:21:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:54,989 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 564 transitions. [2022-11-19 07:21:54,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-19 07:21:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 564 transitions. [2022-11-19 07:21:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:21:54,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:54,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:54,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-19 07:21:54,990 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1664148291, now seen corresponding path program 1 times [2022-11-19 07:21:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:54,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329278431] [2022-11-19 07:21:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:54,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:56,504 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-19 07:21:56,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:56,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329278431] [2022-11-19 07:21:56,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329278431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:56,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:56,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 07:21:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072532121] [2022-11-19 07:21:56,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:56,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 07:21:56,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:56,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 07:21:56,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:21:56,506 INFO L87 Difference]: Start difference. First operand 215 states and 564 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:57,009 INFO L93 Difference]: Finished difference Result 334 states and 889 transitions. [2022-11-19 07:21:57,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:21:57,010 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 07:21:57,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:57,011 INFO L225 Difference]: With dead ends: 334 [2022-11-19 07:21:57,011 INFO L226 Difference]: Without dead ends: 334 [2022-11-19 07:21:57,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-11-19 07:21:57,012 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:57,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 17 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:21:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-19 07:21:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 291. [2022-11-19 07:21:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 2.7379310344827585) internal successors, (794), 290 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 794 transitions. [2022-11-19 07:21:57,019 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 794 transitions. Word has length 17 [2022-11-19 07:21:57,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:57,019 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 794 transitions. [2022-11-19 07:21:57,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 794 transitions. [2022-11-19 07:21:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:21:57,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:57,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:57,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-19 07:21:57,021 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:57,021 INFO L85 PathProgramCache]: Analyzing trace with hash 376277699, now seen corresponding path program 2 times [2022-11-19 07:21:57,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:57,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474749437] [2022-11-19 07:21:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:57,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:58,429 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-19 07:21:58,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:58,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474749437] [2022-11-19 07:21:58,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474749437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:58,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:58,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 07:21:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817920128] [2022-11-19 07:21:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:58,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:21:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:21:58,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:21:58,432 INFO L87 Difference]: Start difference. First operand 291 states and 794 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-19 07:21:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:58,847 INFO L93 Difference]: Finished difference Result 314 states and 860 transitions. [2022-11-19 07:21:58,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:21:58,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-19 07:21:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:58,849 INFO L225 Difference]: With dead ends: 314 [2022-11-19 07:21:58,849 INFO L226 Difference]: Without dead ends: 314 [2022-11-19 07:21:58,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:21:58,850 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:58,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 8 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:21:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-19 07:21:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 229. [2022-11-19 07:21:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.6710526315789473) internal successors, (609), 228 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:21:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 609 transitions. [2022-11-19 07:21:58,859 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 609 transitions. Word has length 17 [2022-11-19 07:21:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:58,859 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 609 transitions. [2022-11-19 07:21:58,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-19 07:21:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 609 transitions. [2022-11-19 07:21:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:21:58,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:58,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:58,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-19 07:21:58,860 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:21:58,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:58,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1731901537, now seen corresponding path program 1 times [2022-11-19 07:21:58,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:58,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862798938] [2022-11-19 07:21:58,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:58,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:01,340 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-19 07:22:01,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:01,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862798938] [2022-11-19 07:22:01,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862798938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:22:01,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:22:01,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 07:22:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697943368] [2022-11-19 07:22:01,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:22:01,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 07:22:01,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:22:01,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 07:22:01,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:22:01,343 INFO L87 Difference]: Start difference. First operand 229 states and 609 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:01,845 INFO L93 Difference]: Finished difference Result 357 states and 964 transitions. [2022-11-19 07:22:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:22:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 07:22:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:01,847 INFO L225 Difference]: With dead ends: 357 [2022-11-19 07:22:01,848 INFO L226 Difference]: Without dead ends: 357 [2022-11-19 07:22:01,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-19 07:22:01,848 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:01,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 15 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:22:01,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-11-19 07:22:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 263. [2022-11-19 07:22:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 2.6946564885496183) internal successors, (706), 262 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 706 transitions. [2022-11-19 07:22:01,855 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 706 transitions. Word has length 18 [2022-11-19 07:22:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:01,855 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 706 transitions. [2022-11-19 07:22:01,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 706 transitions. [2022-11-19 07:22:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:22:01,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:01,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:22:01,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-19 07:22:01,857 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:22:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1731902374, now seen corresponding path program 1 times [2022-11-19 07:22:01,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:22:01,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879617380] [2022-11-19 07:22:01,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:01,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:22:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:02,106 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-19 07:22:02,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:02,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879617380] [2022-11-19 07:22:02,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879617380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:22:02,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:22:02,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:22:02,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437797888] [2022-11-19 07:22:02,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:22:02,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:22:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:22:02,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:22:02,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:22:02,108 INFO L87 Difference]: Start difference. First operand 263 states and 706 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:02,174 INFO L93 Difference]: Finished difference Result 190 states and 440 transitions. [2022-11-19 07:22:02,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:22:02,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 07:22:02,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:02,175 INFO L225 Difference]: With dead ends: 190 [2022-11-19 07:22:02,175 INFO L226 Difference]: Without dead ends: 190 [2022-11-19 07:22:02,175 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-19 07:22:02,176 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:02,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:22:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-19 07:22:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-19 07:22:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.328042328042328) internal successors, (440), 189 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 440 transitions. [2022-11-19 07:22:02,179 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 440 transitions. Word has length 18 [2022-11-19 07:22:02,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:02,180 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 440 transitions. [2022-11-19 07:22:02,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 440 transitions. [2022-11-19 07:22:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:22:02,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:02,180 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-19 07:22:02,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-19 07:22:02,181 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:22:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:02,181 INFO L85 PathProgramCache]: Analyzing trace with hash -743867043, now seen corresponding path program 1 times [2022-11-19 07:22:02,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:22:02,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876200386] [2022-11-19 07:22:02,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:02,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:22:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:04,430 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-19 07:22:04,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:04,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876200386] [2022-11-19 07:22:04,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876200386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:22:04,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:22:04,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 07:22:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147106519] [2022-11-19 07:22:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:22:04,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 07:22:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:22:04,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 07:22:04,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:22:04,432 INFO L87 Difference]: Start difference. First operand 190 states and 440 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-19 07:22:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:04,938 INFO L93 Difference]: Finished difference Result 195 states and 454 transitions. [2022-11-19 07:22:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:22:04,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-19 07:22:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:04,940 INFO L225 Difference]: With dead ends: 195 [2022-11-19 07:22:04,940 INFO L226 Difference]: Without dead ends: 195 [2022-11-19 07:22:04,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:22:04,940 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:04,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 18 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:22:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-19 07:22:04,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2022-11-19 07:22:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.331578947368421) internal successors, (443), 190 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 443 transitions. [2022-11-19 07:22:04,952 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 443 transitions. Word has length 19 [2022-11-19 07:22:04,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:04,953 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 443 transitions. [2022-11-19 07:22:04,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-19 07:22:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 443 transitions. [2022-11-19 07:22:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:22:04,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:04,954 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-19 07:22:04,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-19 07:22:04,954 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:22:04,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:04,955 INFO L85 PathProgramCache]: Analyzing trace with hash -769368139, now seen corresponding path program 1 times [2022-11-19 07:22:04,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:22:04,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691802790] [2022-11-19 07:22:04,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:22:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:05,184 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-19 07:22:05,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:05,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691802790] [2022-11-19 07:22:05,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691802790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:22:05,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:22:05,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:22:05,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195823543] [2022-11-19 07:22:05,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:22:05,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:22:05,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:22:05,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:22:05,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:22:05,186 INFO L87 Difference]: Start difference. First operand 191 states and 443 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:05,273 INFO L93 Difference]: Finished difference Result 122 states and 241 transitions. [2022-11-19 07:22:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:22:05,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 07:22:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:05,274 INFO L225 Difference]: With dead ends: 122 [2022-11-19 07:22:05,274 INFO L226 Difference]: Without dead ends: 122 [2022-11-19 07:22:05,275 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-19 07:22:05,275 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:05,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:22:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-19 07:22:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2022-11-19 07:22:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.9320388349514563) internal successors, (199), 103 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 199 transitions. [2022-11-19 07:22:05,278 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 199 transitions. Word has length 19 [2022-11-19 07:22:05,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:05,278 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 199 transitions. [2022-11-19 07:22:05,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 199 transitions. [2022-11-19 07:22:05,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:22:05,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:05,279 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-19 07:22:05,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-19 07:22:05,279 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:22:05,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash 39773685, now seen corresponding path program 1 times [2022-11-19 07:22:05,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:22:05,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477495754] [2022-11-19 07:22:05,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:22:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:05,629 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-19 07:22:05,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:05,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477495754] [2022-11-19 07:22:05,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477495754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:22:05,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:22:05,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:22:05,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086247739] [2022-11-19 07:22:05,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:22:05,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:22:05,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:22:05,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:22:05,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:22:05,633 INFO L87 Difference]: Start difference. First operand 104 states and 199 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:05,733 INFO L93 Difference]: Finished difference Result 80 states and 151 transitions. [2022-11-19 07:22:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:22:05,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-19 07:22:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:05,734 INFO L225 Difference]: With dead ends: 80 [2022-11-19 07:22:05,734 INFO L226 Difference]: Without dead ends: 80 [2022-11-19 07:22:05,734 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-19 07:22:05,735 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:05,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:22:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-19 07:22:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2022-11-19 07:22:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 75 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 143 transitions. [2022-11-19 07:22:05,737 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 143 transitions. Word has length 21 [2022-11-19 07:22:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:05,737 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 143 transitions. [2022-11-19 07:22:05,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 143 transitions. [2022-11-19 07:22:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:22:05,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:05,738 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-19 07:22:05,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-19 07:22:05,738 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:22:05,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash -563684293, now seen corresponding path program 1 times [2022-11-19 07:22:05,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:22:05,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915522227] [2022-11-19 07:22:05,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:05,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:22:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:22:05,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:22:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:22:06,009 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:22:06,011 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:22:06,012 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2022-11-19 07:22:06,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2022-11-19 07:22:06,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2022-11-19 07:22:06,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2022-11-19 07:22:06,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2022-11-19 07:22:06,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2022-11-19 07:22:06,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2022-11-19 07:22:06,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2022-11-19 07:22:06,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2022-11-19 07:22:06,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2022-11-19 07:22:06,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2022-11-19 07:22:06,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2022-11-19 07:22:06,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2022-11-19 07:22:06,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2022-11-19 07:22:06,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2022-11-19 07:22:06,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2022-11-19 07:22:06,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2022-11-19 07:22:06,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2022-11-19 07:22:06,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2022-11-19 07:22:06,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2022-11-19 07:22:06,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2022-11-19 07:22:06,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2022-11-19 07:22:06,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2022-11-19 07:22:06,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2022-11-19 07:22:06,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2022-11-19 07:22:06,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2022-11-19 07:22:06,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2022-11-19 07:22:06,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2022-11-19 07:22:06,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2022-11-19 07:22:06,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2022-11-19 07:22:06,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2022-11-19 07:22:06,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2022-11-19 07:22:06,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2022-11-19 07:22:06,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2022-11-19 07:22:06,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2022-11-19 07:22:06,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2022-11-19 07:22:06,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2022-11-19 07:22:06,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2022-11-19 07:22:06,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2022-11-19 07:22:06,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2022-11-19 07:22:06,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2022-11-19 07:22:06,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2022-11-19 07:22:06,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2022-11-19 07:22:06,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2022-11-19 07:22:06,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2022-11-19 07:22:06,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2022-11-19 07:22:06,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2022-11-19 07:22:06,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2022-11-19 07:22:06,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2022-11-19 07:22:06,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2022-11-19 07:22:06,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2022-11-19 07:22:06,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2022-11-19 07:22:06,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2022-11-19 07:22:06,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2022-11-19 07:22:06,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2022-11-19 07:22:06,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2022-11-19 07:22:06,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2022-11-19 07:22:06,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2022-11-19 07:22:06,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2022-11-19 07:22:06,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2022-11-19 07:22:06,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2022-11-19 07:22:06,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2022-11-19 07:22:06,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2022-11-19 07:22:06,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2022-11-19 07:22:06,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2022-11-19 07:22:06,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2022-11-19 07:22:06,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2022-11-19 07:22:06,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2022-11-19 07:22:06,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2022-11-19 07:22:06,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2022-11-19 07:22:06,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2022-11-19 07:22:06,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2022-11-19 07:22:06,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2022-11-19 07:22:06,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2022-11-19 07:22:06,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2022-11-19 07:22:06,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-19 07:22:06,030 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 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-19 07:22:06,037 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:22:06,037 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:22:06,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:22:06 BasicIcfg [2022-11-19 07:22:06,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:22:06,170 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:22:06,170 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:22:06,171 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:22:06,171 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:21:10" (3/4) ... [2022-11-19 07:22:06,174 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:22:06,174 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:22:06,175 INFO L158 Benchmark]: Toolchain (without parser) took 58999.53ms. Allocated memory was 121.6MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 84.8MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-19 07:22:06,175 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 121.6MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:22:06,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 837.08ms. Allocated memory is still 121.6MB. Free memory was 84.7MB in the beginning and 82.8MB in the end (delta: 1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:22:06,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.23ms. Allocated memory is still 121.6MB. Free memory was 82.8MB in the beginning and 80.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:22:06,176 INFO L158 Benchmark]: Boogie Preprocessor took 78.85ms. Allocated memory is still 121.6MB. Free memory was 80.2MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:22:06,176 INFO L158 Benchmark]: RCFGBuilder took 2109.35ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 78.1MB in the beginning and 114.5MB in the end (delta: -36.4MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2022-11-19 07:22:06,176 INFO L158 Benchmark]: TraceAbstraction took 55864.69ms. Allocated memory was 159.4MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 113.4MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-19 07:22:06,177 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 4.0GB. Free memory is still 2.8GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:22:06,178 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.27ms. Allocated memory is still 121.6MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 837.08ms. Allocated memory is still 121.6MB. Free memory was 84.7MB in the beginning and 82.8MB in the end (delta: 1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.23ms. Allocated memory is still 121.6MB. Free memory was 82.8MB in the beginning and 80.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.85ms. Allocated memory is still 121.6MB. Free memory was 80.2MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2109.35ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 78.1MB in the beginning and 114.5MB in the end (delta: -36.4MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * TraceAbstraction took 55864.69ms. Allocated memory was 159.4MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 113.4MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 4.0GB. Free memory is still 2.8GB. 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: 19.6s, 186 PlacesBefore, 82 PlacesAfterwards, 178 TransitionsBefore, 73 TransitionsAfterwards, 6624 CoEnabledTransitionPairs, 8 FixpointIterations, 71 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 156 TotalNumberOfCompositions, 34115 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9659, independent: 9047, independent conditional: 0, independent unconditional: 9047, dependent: 612, dependent conditional: 0, dependent unconditional: 612, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3597, independent: 3494, independent conditional: 0, independent unconditional: 3494, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3597, independent: 3298, independent conditional: 0, independent unconditional: 3298, dependent: 299, dependent conditional: 0, dependent unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 299, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1656, independent: 894, independent conditional: 0, independent unconditional: 894, dependent: 761, dependent conditional: 0, dependent unconditional: 761, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9659, independent: 5553, independent conditional: 0, independent unconditional: 5553, dependent: 509, dependent conditional: 0, dependent unconditional: 509, unknown: 3597, unknown conditional: 0, unknown unconditional: 3597] , Statistics on independence cache: Total cache size (in pairs): 623, Positive cache size: 561, Positive conditional cache size: 0, Positive unconditional cache size: 561, Negative cache size: 62, Negative conditional cache size: 0, Negative unconditional cache size: 62, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L736] 0 _Bool x$flush_delayed; [L747] 0 int *x$read_delayed_var; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L741] 0 _Bool x$r_buff0_thd3; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L738] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L746] 0 _Bool x$read_delayed; [L709] 0 int __unbuffered_cnt = 0; [L751] 0 _Bool x$w_buff1_used; [L748] 0 int x$w_buff0; [L750] 0 int x$w_buff1; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L737] 0 int x$mem_tmp; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L731] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard1; [L732] 0 _Bool main$tmp_guard0; [L749] 0 _Bool x$w_buff0_used; [L735] 0 int x = 0; [L743] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd0; [L753] 0 int y = 0; [L745] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$r_buff1_thd2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=-2, t1780={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1781; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780={7:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=-1, t1780={7:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] 0 pthread_t t1782; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=0, t1780={7:0}, t1781={5:0}, t1782={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, 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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, 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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L828] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, 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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, 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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, 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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, 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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, 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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={7:0}, t1781={5:0}, t1782={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: 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 7 procedures, 233 locations, 75 error locations. Started 1 CEGAR loops. OverallTime: 55.5s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1459 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1459 mSDsluCounter, 245 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 166 mSDsCounter, 422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3373 IncrementalHoareTripleChecker+Invalid, 3795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 422 mSolverCounterUnsat, 79 mSDtfsCounter, 3373 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35046occurred in iteration=0, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 7250 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 418 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 5533 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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-19 07:22:06,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --- 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-8393723 [2022-11-19 07:22:08,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:22:08,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:22:08,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:22:08,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:22:08,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:22:08,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:22:08,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:22:08,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:22:08,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:22:08,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:22:08,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:22:08,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:22:08,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:22:08,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:22:08,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:22:08,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:22:08,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:22:08,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:22:08,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:22:08,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:22:08,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:22:08,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:22:08,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:22:08,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:22:08,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:22:08,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:22:08,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:22:08,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:22:08,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:22:08,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:22:08,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:22:08,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:22:08,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:22:08,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:22:08,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:22:08,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:22:08,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:22:08,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:22:08,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:22:08,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:22:08,839 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 07:22:08,879 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:22:08,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:22:08,881 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:22:08,881 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:22:08,882 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:22:08,882 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:22:08,883 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:22:08,883 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:22:08,883 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:22:08,883 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:22:08,884 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:22:08,885 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:22:08,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:22:08,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:22:08,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:22:08,887 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:22:08,888 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:22:08,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:22:08,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:22:08,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:22:08,889 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:22:08,889 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:22:08,889 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:22:08,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:22:08,890 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:22:08,890 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 07:22:08,890 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 07:22:08,891 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:22:08,891 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:22:08,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:22:08,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 07:22:08,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:22:08,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:22:08,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:22:08,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:22:08,893 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 07:22:08,894 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 07:22:08,894 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:22:08,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 07:22:08,895 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_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS 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 -> Taipan 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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 [2022-11-19 07:22:09,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:22:09,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:22:09,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:22:09,338 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:22:09,339 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:22:09,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-11-19 07:22:09,414 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/data/d4865c2a0/09d110da60314e3f9767d090e72055d6/FLAG61a4a9cf0 [2022-11-19 07:22:09,970 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:22:09,971 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-11-19 07:22:09,996 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/data/d4865c2a0/09d110da60314e3f9767d090e72055d6/FLAG61a4a9cf0 [2022-11-19 07:22:10,259 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/data/d4865c2a0/09d110da60314e3f9767d090e72055d6 [2022-11-19 07:22:10,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:22:10,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:22:10,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:22:10,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:22:10,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:22:10,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:10,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268e78ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10, skipping insertion in model container [2022-11-19 07:22:10,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:10,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:22:10,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:22:10,578 WARN L234 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_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-11-19 07:22:10,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:22:10,788 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:22:10,816 WARN L234 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_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-11-19 07:22:10,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:22:10,978 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:22:10,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10 WrapperNode [2022-11-19 07:22:10,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:22:10,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:22:10,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:22:10,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:22:10,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:11,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:11,071 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-11-19 07:22:11,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:22:11,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:22:11,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:22:11,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:22:11,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:11,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:11,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:11,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:11,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:11,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:11,122 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:11,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:11,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:22:11,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:22:11,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:22:11,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:22:11,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (1/1) ... [2022-11-19 07:22:11,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:22:11,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:22:11,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:22:11,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:22:11,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-19 07:22:11,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:22:11,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:22:11,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:22:11,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:22:11,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 07:22:11,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 07:22:11,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-19 07:22:11,246 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:22:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:22:11,247 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:22:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:22:11,247 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:22:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:22:11,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:22:11,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:22:11,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:22:11,250 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:22:11,501 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:22:11,504 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:22:12,266 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:22:13,062 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:22:13,063 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:22:13,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:22:13 BoogieIcfgContainer [2022-11-19 07:22:13,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:22:13,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:22:13,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:22:13,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:22:13,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:22:10" (1/3) ... [2022-11-19 07:22:13,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c25a8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:22:13, skipping insertion in model container [2022-11-19 07:22:13,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:22:10" (2/3) ... [2022-11-19 07:22:13,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c25a8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:22:13, skipping insertion in model container [2022-11-19 07:22:13,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:22:13" (3/3) ... [2022-11-19 07:22:13,074 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2022-11-19 07:22:13,094 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:22:13,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-19 07:22:13,094 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:22:13,291 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:22:13,340 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:22:13,365 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 179 transitions, 373 flow [2022-11-19 07:22:13,371 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 179 transitions, 373 flow [2022-11-19 07:22:13,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 179 transitions, 373 flow [2022-11-19 07:22:13,462 INFO L130 PetriNetUnfolder]: 2/176 cut-off events. [2022-11-19 07:22:13,462 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:22:13,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 2/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 247 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-11-19 07:22:13,474 INFO L119 LiptonReduction]: Number of co-enabled transitions 6624 [2022-11-19 07:22:36,658 WARN L233 SmtUtils]: Spent 7.64s on a formula simplification. DAG size of input: 232 DAG size of output: 231 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-19 07:22:55,327 INFO L134 LiptonReduction]: Checked pairs total: 34624 [2022-11-19 07:22:55,328 INFO L136 LiptonReduction]: Total number of compositions: 159 [2022-11-19 07:22:55,336 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 73 transitions, 161 flow [2022-11-19 07:22:56,779 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:56,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:22:56,833 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;@47dae8d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:22:56,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-11-19 07:22:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:22:56,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:56,976 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:22:56,977 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:22:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1142, now seen corresponding path program 1 times [2022-11-19 07:22:57,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:22:57,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654277475] [2022-11-19 07:22:57,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:57,024 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-19 07:22:57,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:22:57,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:22:57,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:22:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:57,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 07:22:57,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:22:57,378 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-19 07:22:57,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:22:57,379 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:22:57,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654277475] [2022-11-19 07:22:57,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654277475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:22:57,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:22:57,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:22:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488554234] [2022-11-19 07:22:57,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:22:57,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:22:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:22:57,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:22:57,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:22:57,465 INFO L87 Difference]: Start difference. First operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 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-19 07:22:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:58,294 INFO L93 Difference]: Finished difference Result 15204 states and 54879 transitions. [2022-11-19 07:22:58,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:22:58,313 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-19 07:22:58,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:58,551 INFO L225 Difference]: With dead ends: 15204 [2022-11-19 07:22:58,551 INFO L226 Difference]: Without dead ends: 15204 [2022-11-19 07:22:58,552 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-19 07:22:58,563 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:58,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:22:58,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2022-11-19 07:22:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 15204. [2022-11-19 07:22:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15204 states, 13315 states have (on average 4.121592189260233) internal successors, (54879), 15203 states have internal predecessors, (54879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:22:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15204 states to 15204 states and 54879 transitions. [2022-11-19 07:22:59,920 INFO L78 Accepts]: Start accepts. Automaton has 15204 states and 54879 transitions. Word has length 1 [2022-11-19 07:22:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:59,920 INFO L495 AbstractCegarLoop]: Abstraction has 15204 states and 54879 transitions. [2022-11-19 07:22:59,921 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-19 07:22:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15204 states and 54879 transitions. [2022-11-19 07:22:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 07:22:59,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:59,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 07:22:59,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:00,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:00,133 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:23:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash 34996770, now seen corresponding path program 1 times [2022-11-19 07:23:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:23:00,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697963944] [2022-11-19 07:23:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:00,135 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-19 07:23:00,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:23:00,152 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:00,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:00,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:23:00,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:00,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:00,496 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:23:00,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697963944] [2022-11-19 07:23:00,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697963944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:00,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:00,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:23:00,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379408620] [2022-11-19 07:23:00,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:00,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:00,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:23:00,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:00,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:00,502 INFO L87 Difference]: Start difference. First operand 15204 states and 54879 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:01,208 INFO L93 Difference]: Finished difference Result 13683 states and 49236 transitions. [2022-11-19 07:23:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:01,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-19 07:23:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:01,516 INFO L225 Difference]: With dead ends: 13683 [2022-11-19 07:23:01,517 INFO L226 Difference]: Without dead ends: 13683 [2022-11-19 07:23:01,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 07:23:01,519 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:01,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:23:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13683 states. [2022-11-19 07:23:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13683 to 13683. [2022-11-19 07:23:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13683 states, 12109 states have (on average 4.066066562061277) internal successors, (49236), 13682 states have internal predecessors, (49236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13683 states to 13683 states and 49236 transitions. [2022-11-19 07:23:02,591 INFO L78 Accepts]: Start accepts. Automaton has 13683 states and 49236 transitions. Word has length 4 [2022-11-19 07:23:02,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:02,592 INFO L495 AbstractCegarLoop]: Abstraction has 13683 states and 49236 transitions. [2022-11-19 07:23:02,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 13683 states and 49236 transitions. [2022-11-19 07:23:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:23:02,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:02,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:23:02,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:02,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:02,794 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:23:02,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1084900804, now seen corresponding path program 1 times [2022-11-19 07:23:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:23:02,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989216283] [2022-11-19 07:23:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:02,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:23:02,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:23:02,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:02,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:02,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:23:02,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:02,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:02,983 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:23:02,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989216283] [2022-11-19 07:23:02,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989216283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:02,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:02,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:23:02,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326715966] [2022-11-19 07:23:02,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:02,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:23:02,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:02,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:02,990 INFO L87 Difference]: Start difference. First operand 13683 states and 49236 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:03,644 INFO L93 Difference]: Finished difference Result 17556 states and 63266 transitions. [2022-11-19 07:23:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:03,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-19 07:23:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:03,753 INFO L225 Difference]: With dead ends: 17556 [2022-11-19 07:23:03,753 INFO L226 Difference]: Without dead ends: 17556 [2022-11-19 07:23:03,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-19 07:23:03,755 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:03,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 6 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:23:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17556 states. [2022-11-19 07:23:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17556 to 14790. [2022-11-19 07:23:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14790 states, 13280 states have (on average 4.209638554216867) internal successors, (55904), 14789 states have internal predecessors, (55904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14790 states to 14790 states and 55904 transitions. [2022-11-19 07:23:04,590 INFO L78 Accepts]: Start accepts. Automaton has 14790 states and 55904 transitions. Word has length 5 [2022-11-19 07:23:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:04,591 INFO L495 AbstractCegarLoop]: Abstraction has 14790 states and 55904 transitions. [2022-11-19 07:23:04,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 14790 states and 55904 transitions. [2022-11-19 07:23:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:23:04,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:04,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:23:04,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:04,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:04,799 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:23:04,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1084900806, now seen corresponding path program 1 times [2022-11-19 07:23:04,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:23:04,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216563311] [2022-11-19 07:23:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:04,800 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-19 07:23:04,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:23:04,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:04,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:04,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:23:04,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:05,058 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 07:23:05,059 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-19 07:23:05,118 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-19 07:23:05,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:05,119 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:23:05,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216563311] [2022-11-19 07:23:05,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216563311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:05,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:05,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:23:05,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169925444] [2022-11-19 07:23:05,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:05,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:05,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:23:05,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:05,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:05,125 INFO L87 Difference]: Start difference. First operand 14790 states and 55904 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:05,487 INFO L93 Difference]: Finished difference Result 8104 states and 29603 transitions. [2022-11-19 07:23:05,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:05,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-19 07:23:05,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:05,696 INFO L225 Difference]: With dead ends: 8104 [2022-11-19 07:23:05,696 INFO L226 Difference]: Without dead ends: 8104 [2022-11-19 07:23:05,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-19 07:23:05,698 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:05,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:23:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8104 states. [2022-11-19 07:23:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8104 to 8104. [2022-11-19 07:23:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8104 states, 7579 states have (on average 3.9059242644148306) internal successors, (29603), 8103 states have internal predecessors, (29603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8104 states to 8104 states and 29603 transitions. [2022-11-19 07:23:06,079 INFO L78 Accepts]: Start accepts. Automaton has 8104 states and 29603 transitions. Word has length 5 [2022-11-19 07:23:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:06,079 INFO L495 AbstractCegarLoop]: Abstraction has 8104 states and 29603 transitions. [2022-11-19 07:23:06,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 8104 states and 29603 transitions. [2022-11-19 07:23:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:23:06,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:06,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:23:06,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:06,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:06,287 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:23:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:06,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1084900807, now seen corresponding path program 1 times [2022-11-19 07:23:06,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:23:06,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022037805] [2022-11-19 07:23:06,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:06,288 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-19 07:23:06,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:23:06,295 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:06,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:06,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:23:06,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:06,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:06,485 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-19 07:23:06,533 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-19 07:23:06,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:06,534 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:23:06,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022037805] [2022-11-19 07:23:06,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022037805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:06,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:06,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:23:06,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816241851] [2022-11-19 07:23:06,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:06,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:06,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:23:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:06,536 INFO L87 Difference]: Start difference. First operand 8104 states and 29603 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:06,717 INFO L93 Difference]: Finished difference Result 2932 states and 10036 transitions. [2022-11-19 07:23:06,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:06,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-19 07:23:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:06,730 INFO L225 Difference]: With dead ends: 2932 [2022-11-19 07:23:06,731 INFO L226 Difference]: Without dead ends: 2932 [2022-11-19 07:23:06,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-19 07:23:06,733 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:06,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:23:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2022-11-19 07:23:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2801. [2022-11-19 07:23:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2727 states have (on average 3.523285661899523) internal successors, (9608), 2800 states have internal predecessors, (9608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 9608 transitions. [2022-11-19 07:23:06,813 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 9608 transitions. Word has length 5 [2022-11-19 07:23:06,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:06,813 INFO L495 AbstractCegarLoop]: Abstraction has 2801 states and 9608 transitions. [2022-11-19 07:23:06,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:06,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 9608 transitions. [2022-11-19 07:23:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:23:06,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:06,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:06,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:23:07,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:07,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:23:07,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1676635282, now seen corresponding path program 1 times [2022-11-19 07:23:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:23:07,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919778291] [2022-11-19 07:23:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:07,034 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-19 07:23:07,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:23:07,035 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:07,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:07,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:23:07,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:07,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:07,265 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:23:07,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919778291] [2022-11-19 07:23:07,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919778291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:07,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:07,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:23:07,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680886769] [2022-11-19 07:23:07,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:07,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:07,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:23:07,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:07,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:07,267 INFO L87 Difference]: Start difference. First operand 2801 states and 9608 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:07,464 INFO L93 Difference]: Finished difference Result 1210 states and 3294 transitions. [2022-11-19 07:23:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:07,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-19 07:23:07,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:07,469 INFO L225 Difference]: With dead ends: 1210 [2022-11-19 07:23:07,469 INFO L226 Difference]: Without dead ends: 1210 [2022-11-19 07:23:07,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-19 07:23:07,469 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:07,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:23:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2022-11-19 07:23:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2022-11-19 07:23:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1160 states have (on average 2.839655172413793) internal successors, (3294), 1209 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3294 transitions. [2022-11-19 07:23:07,497 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3294 transitions. Word has length 10 [2022-11-19 07:23:07,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:07,498 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 3294 transitions. [2022-11-19 07:23:07,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3294 transitions. [2022-11-19 07:23:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:23:07,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:07,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:07,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:07,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:07,722 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:23:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash -67065581, now seen corresponding path program 1 times [2022-11-19 07:23:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:23:07,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110037804] [2022-11-19 07:23:07,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:07,723 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-19 07:23:07,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:23:07,725 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:07,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:07,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:23:07,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:07,977 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-19 07:23:07,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:07,978 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:23:07,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110037804] [2022-11-19 07:23:07,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110037804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:07,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:07,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:23:07,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090635164] [2022-11-19 07:23:07,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:07,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:07,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:23:07,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:07,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:07,980 INFO L87 Difference]: Start difference. First operand 1210 states and 3294 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:08,308 INFO L93 Difference]: Finished difference Result 377 states and 828 transitions. [2022-11-19 07:23:08,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:23:08,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 07:23:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:08,310 INFO L225 Difference]: With dead ends: 377 [2022-11-19 07:23:08,310 INFO L226 Difference]: Without dead ends: 377 [2022-11-19 07:23:08,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:08,311 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:08,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:23:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-19 07:23:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-19 07:23:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 359 states have (on average 2.3064066852367686) internal successors, (828), 376 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 828 transitions. [2022-11-19 07:23:08,323 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 828 transitions. Word has length 14 [2022-11-19 07:23:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:08,324 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 828 transitions. [2022-11-19 07:23:08,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 828 transitions. [2022-11-19 07:23:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:23:08,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:08,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:08,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:08,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:08,539 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:23:08,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:08,539 INFO L85 PathProgramCache]: Analyzing trace with hash -678666898, now seen corresponding path program 1 times [2022-11-19 07:23:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:23:08,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43115333] [2022-11-19 07:23:08,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:08,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:23:08,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:23:08,543 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:08,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:08,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:23:08,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:08,845 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-19 07:23:08,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:08,846 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:23:08,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43115333] [2022-11-19 07:23:08,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43115333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:08,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:08,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:23:08,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719176334] [2022-11-19 07:23:08,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:08,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:23:08,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:23:08,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:23:08,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:08,848 INFO L87 Difference]: Start difference. First operand 377 states and 828 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:09,230 INFO L93 Difference]: Finished difference Result 226 states and 533 transitions. [2022-11-19 07:23:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:23:09,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 07:23:09,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:09,232 INFO L225 Difference]: With dead ends: 226 [2022-11-19 07:23:09,232 INFO L226 Difference]: Without dead ends: 226 [2022-11-19 07:23:09,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:09,233 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:09,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 18 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:23:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-19 07:23:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-11-19 07:23:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 222 states have (on average 2.400900900900901) internal successors, (533), 225 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 533 transitions. [2022-11-19 07:23:09,240 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 533 transitions. Word has length 18 [2022-11-19 07:23:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:09,240 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 533 transitions. [2022-11-19 07:23:09,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 533 transitions. [2022-11-19 07:23:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:23:09,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:09,242 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-19 07:23:09,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-19 07:23:09,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:09,455 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:23:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:09,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1799836132, now seen corresponding path program 1 times [2022-11-19 07:23:09,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:23:09,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361348733] [2022-11-19 07:23:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:09,456 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-19 07:23:09,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:23:09,457 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:09,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:09,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:23:09,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:17,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 180 [2022-11-19 07:23:18,792 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-19 07:23:18,818 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-19 07:23:18,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:18,819 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:23:18,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361348733] [2022-11-19 07:23:18,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361348733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:18,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:18,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:23:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866435805] [2022-11-19 07:23:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:18,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:23:18,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:23:18,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:23:18,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:23:18,821 INFO L87 Difference]: Start difference. First operand 226 states and 533 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-19 07:23:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:19,247 INFO L93 Difference]: Finished difference Result 225 states and 532 transitions. [2022-11-19 07:23:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:23:19,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-19 07:23:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:19,249 INFO L225 Difference]: With dead ends: 225 [2022-11-19 07:23:19,249 INFO L226 Difference]: Without dead ends: 225 [2022-11-19 07:23:19,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:23:19,250 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 59 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:19,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 8 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:23:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-19 07:23:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2022-11-19 07:23:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 222 states have (on average 2.3963963963963963) internal successors, (532), 224 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 532 transitions. [2022-11-19 07:23:19,255 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 532 transitions. Word has length 22 [2022-11-19 07:23:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:19,256 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 532 transitions. [2022-11-19 07:23:19,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-19 07:23:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 532 transitions. [2022-11-19 07:23:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:23:19,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:19,257 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-19 07:23:19,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:19,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:19,469 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:23:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1799836131, now seen corresponding path program 1 times [2022-11-19 07:23:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:23:19,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199723676] [2022-11-19 07:23:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:19,470 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-19 07:23:19,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:23:19,471 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:19,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:23:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:19,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 07:23:19,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:02,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 180 [2022-11-19 07:25:03,799 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-19 07:25:03,836 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-19 07:25:03,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:03,837 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:03,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199723676] [2022-11-19 07:25:03,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199723676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:03,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:03,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:25:03,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733679566] [2022-11-19 07:25:03,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:03,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:25:03,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:03,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:25:03,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:03,838 INFO L87 Difference]: Start difference. First operand 225 states and 532 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-19 07:25:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:04,184 INFO L93 Difference]: Finished difference Result 224 states and 531 transitions. [2022-11-19 07:25:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:25:04,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-19 07:25:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:04,185 INFO L225 Difference]: With dead ends: 224 [2022-11-19 07:25:04,185 INFO L226 Difference]: Without dead ends: 224 [2022-11-19 07:25:04,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:25:04,186 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:04,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 7 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:25:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-19 07:25:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-11-19 07:25:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 222 states have (on average 2.391891891891892) internal successors, (531), 223 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 531 transitions. [2022-11-19 07:25:04,191 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 531 transitions. Word has length 22 [2022-11-19 07:25:04,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:04,191 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 531 transitions. [2022-11-19 07:25:04,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-19 07:25:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 531 transitions. [2022-11-19 07:25:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:25:04,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:04,192 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-19 07:25:04,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:04,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:04,403 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:25:04,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:04,403 INFO L85 PathProgramCache]: Analyzing trace with hash 39649451, now seen corresponding path program 1 times [2022-11-19 07:25:04,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:04,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885607340] [2022-11-19 07:25:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:04,404 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-19 07:25:04,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:04,405 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:04,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:04,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:25:04,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:04,672 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-19 07:25:04,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:04,673 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:04,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885607340] [2022-11-19 07:25:04,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885607340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:04,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:04,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:25:04,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990196401] [2022-11-19 07:25:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:04,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:25:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:04,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:25:04,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:25:04,674 INFO L87 Difference]: Start difference. First operand 224 states and 531 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) 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-19 07:25:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:04,892 INFO L93 Difference]: Finished difference Result 350 states and 815 transitions. [2022-11-19 07:25:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:25:04,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) 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-19 07:25:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:04,894 INFO L225 Difference]: With dead ends: 350 [2022-11-19 07:25:04,894 INFO L226 Difference]: Without dead ends: 350 [2022-11-19 07:25:04,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-19 07:25:04,895 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:04,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:25:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-19 07:25:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 346. [2022-11-19 07:25:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 344 states have (on average 2.36046511627907) internal successors, (812), 345 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 812 transitions. [2022-11-19 07:25:04,902 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 812 transitions. Word has length 23 [2022-11-19 07:25:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:04,902 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 812 transitions. [2022-11-19 07:25:04,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) 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-19 07:25:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 812 transitions. [2022-11-19 07:25:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:25:04,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:04,903 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-19 07:25:04,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:05,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:05,104 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:25:05,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash 640799843, now seen corresponding path program 2 times [2022-11-19 07:25:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:05,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058829103] [2022-11-19 07:25:05,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:25:05,105 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-19 07:25:05,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:05,106 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:05,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:05,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:25:05,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:25:05,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:25:05,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:05,412 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-19 07:25:05,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:05,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:05,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058829103] [2022-11-19 07:25:05,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058829103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:05,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:05,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:25:05,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046583110] [2022-11-19 07:25:05,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:05,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:25:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:25:05,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:25:05,414 INFO L87 Difference]: Start difference. First operand 346 states and 812 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-19 07:25:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:05,735 INFO L93 Difference]: Finished difference Result 519 states and 1154 transitions. [2022-11-19 07:25:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:25:05,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-19 07:25:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:05,738 INFO L225 Difference]: With dead ends: 519 [2022-11-19 07:25:05,738 INFO L226 Difference]: Without dead ends: 519 [2022-11-19 07:25:05,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-19 07:25:05,739 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:05,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:25:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-11-19 07:25:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 271. [2022-11-19 07:25:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 269 states have (on average 2.342007434944238) internal successors, (630), 270 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 630 transitions. [2022-11-19 07:25:05,747 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 630 transitions. Word has length 23 [2022-11-19 07:25:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:05,747 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 630 transitions. [2022-11-19 07:25:05,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-19 07:25:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 630 transitions. [2022-11-19 07:25:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:25:05,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:05,748 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-19 07:25:05,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:05,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:05,963 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-19 07:25:05,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash -688923975, now seen corresponding path program 3 times [2022-11-19 07:25:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:05,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350103945] [2022-11-19 07:25:05,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:25:05,964 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-19 07:25:05,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:05,966 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:05,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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 (14)] Waiting until timeout for monitored process [2022-11-19 07:25:06,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:25:06,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-19 07:25:06,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:25:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:25:06,505 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-19 07:25:06,505 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:25:06,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2022-11-19 07:25:06,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2022-11-19 07:25:06,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2022-11-19 07:25:06,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2022-11-19 07:25:06,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2022-11-19 07:25:06,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2022-11-19 07:25:06,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2022-11-19 07:25:06,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2022-11-19 07:25:06,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2022-11-19 07:25:06,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2022-11-19 07:25:06,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2022-11-19 07:25:06,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2022-11-19 07:25:06,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2022-11-19 07:25:06,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2022-11-19 07:25:06,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2022-11-19 07:25:06,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2022-11-19 07:25:06,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2022-11-19 07:25:06,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2022-11-19 07:25:06,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2022-11-19 07:25:06,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2022-11-19 07:25:06,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2022-11-19 07:25:06,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2022-11-19 07:25:06,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2022-11-19 07:25:06,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2022-11-19 07:25:06,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2022-11-19 07:25:06,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2022-11-19 07:25:06,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2022-11-19 07:25:06,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2022-11-19 07:25:06,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2022-11-19 07:25:06,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2022-11-19 07:25:06,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2022-11-19 07:25:06,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2022-11-19 07:25:06,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2022-11-19 07:25:06,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2022-11-19 07:25:06,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2022-11-19 07:25:06,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2022-11-19 07:25:06,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2022-11-19 07:25:06,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2022-11-19 07:25:06,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2022-11-19 07:25:06,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2022-11-19 07:25:06,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2022-11-19 07:25:06,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2022-11-19 07:25:06,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2022-11-19 07:25:06,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2022-11-19 07:25:06,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2022-11-19 07:25:06,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2022-11-19 07:25:06,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2022-11-19 07:25:06,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2022-11-19 07:25:06,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2022-11-19 07:25:06,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2022-11-19 07:25:06,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2022-11-19 07:25:06,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2022-11-19 07:25:06,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2022-11-19 07:25:06,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2022-11-19 07:25:06,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2022-11-19 07:25:06,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2022-11-19 07:25:06,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2022-11-19 07:25:06,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2022-11-19 07:25:06,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2022-11-19 07:25:06,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2022-11-19 07:25:06,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2022-11-19 07:25:06,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2022-11-19 07:25:06,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2022-11-19 07:25:06,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2022-11-19 07:25:06,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2022-11-19 07:25:06,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2022-11-19 07:25:06,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2022-11-19 07:25:06,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2022-11-19 07:25:06,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2022-11-19 07:25:06,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2022-11-19 07:25:06,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2022-11-19 07:25:06,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2022-11-19 07:25:06,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2022-11-19 07:25:06,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2022-11-19 07:25:06,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2022-11-19 07:25:06,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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 (14)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:06,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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-19 07:25:06,744 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:06,749 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:25:06,749 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:25:06,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:25:06 BasicIcfg [2022-11-19 07:25:06,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:25:06,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:25:06,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:25:06,884 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:25:06,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:22:13" (3/4) ... [2022-11-19 07:25:06,887 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:25:06,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:25:06,899 INFO L158 Benchmark]: Toolchain (without parser) took 176634.01ms. Allocated memory was 71.3MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 51.2MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-11-19 07:25:06,899 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 71.3MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:25:06,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 707.94ms. Allocated memory is still 71.3MB. Free memory was 51.0MB in the beginning and 40.2MB in the end (delta: 10.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-19 07:25:06,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.01ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 37.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:25:06,900 INFO L158 Benchmark]: Boogie Preprocessor took 55.74ms. Allocated memory is still 71.3MB. Free memory was 37.6MB in the beginning and 34.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:25:06,901 INFO L158 Benchmark]: RCFGBuilder took 1936.50ms. Allocated memory was 71.3MB in the beginning and 121.6MB in the end (delta: 50.3MB). Free memory was 34.9MB in the beginning and 60.5MB in the end (delta: -25.6MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2022-11-19 07:25:06,902 INFO L158 Benchmark]: TraceAbstraction took 173816.23ms. Allocated memory was 121.6MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 60.5MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-19 07:25:06,903 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 3.4GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:25:06,904 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.33ms. Allocated memory is still 71.3MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 707.94ms. Allocated memory is still 71.3MB. Free memory was 51.0MB in the beginning and 40.2MB in the end (delta: 10.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.01ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 37.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.74ms. Allocated memory is still 71.3MB. Free memory was 37.6MB in the beginning and 34.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1936.50ms. Allocated memory was 71.3MB in the beginning and 121.6MB in the end (delta: 50.3MB). Free memory was 34.9MB in the beginning and 60.5MB in the end (delta: -25.6MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * TraceAbstraction took 173816.23ms. Allocated memory was 121.6MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 60.5MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 3.4GB. Free memory is still 2.1GB. 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: 42.0s, 187 PlacesBefore, 82 PlacesAfterwards, 179 TransitionsBefore, 73 TransitionsAfterwards, 6624 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 159 TotalNumberOfCompositions, 34624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8245, independent: 7627, independent conditional: 0, independent unconditional: 7627, dependent: 558, dependent conditional: 0, dependent unconditional: 558, unknown: 60, unknown conditional: 0, unknown unconditional: 60] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3390, independent: 3291, independent conditional: 0, independent unconditional: 3291, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3390, independent: 3135, independent conditional: 0, independent unconditional: 3135, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 255, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2685, independent: 766, independent conditional: 0, independent unconditional: 766, dependent: 1235, dependent conditional: 0, dependent unconditional: 1235, unknown: 684, unknown conditional: 0, unknown unconditional: 684] ], Cache Queries: [ total: 8245, independent: 4336, independent conditional: 0, independent unconditional: 4336, dependent: 466, dependent conditional: 0, dependent unconditional: 466, unknown: 3443, unknown conditional: 0, unknown unconditional: 3443] , Statistics on independence cache: Total cache size (in pairs): 470, Positive cache size: 420, Positive conditional cache size: 0, Positive unconditional cache size: 420, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L736] 0 _Bool x$flush_delayed; [L747] 0 int *x$read_delayed_var; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L741] 0 _Bool x$r_buff0_thd3; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L738] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L746] 0 _Bool x$read_delayed; [L709] 0 int __unbuffered_cnt = 0; [L751] 0 _Bool x$w_buff1_used; [L748] 0 int x$w_buff0; [L750] 0 int x$w_buff1; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L737] 0 int x$mem_tmp; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L731] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard1; [L732] 0 _Bool main$tmp_guard0; [L749] 0 _Bool x$w_buff0_used; [L735] 0 int x = 0; [L743] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd0; [L753] 0 int y = 0; [L745] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$r_buff1_thd2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=0, t1780={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1781; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780={15:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=1, t1780={15:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] 0 pthread_t t1782; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=2, t1780={15:0}, t1781={5:0}, t1782={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={15:0}, t1781={5:0}, t1782={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=2, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: 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 7 procedures, 234 locations, 75 error locations. Started 1 CEGAR loops. OverallTime: 173.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 43.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1148 IncrementalHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 36 mSDtfsCounter, 1148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35046occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 3149 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 113.8s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 1144 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1593 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-19 07:25:06,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f0501ba-a9d1-47f8-82a5-44d7dc3b9f98/bin/utaipan-I9t0OCRTmS/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