./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba --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 f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 --- 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-b5237d8 [2022-11-22 00:33:16,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:33:16,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:33:16,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:33:16,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:33:16,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:33:16,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:33:16,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:33:16,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:33:16,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:33:16,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:33:16,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:33:16,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:33:16,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:33:16,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:33:16,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:33:16,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:33:16,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:33:16,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:33:16,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:33:16,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:33:16,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:33:16,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:33:16,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:33:16,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:33:16,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:33:16,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:33:16,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:33:16,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:33:16,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:33:16,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:33:16,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:33:16,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:33:16,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:33:16,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:33:16,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:33:16,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:33:16,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:33:16,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:33:16,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:33:16,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:33:16,247 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 00:33:16,270 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:33:16,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:33:16,270 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:33:16,271 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:33:16,272 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:33:16,272 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:33:16,272 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:33:16,272 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:33:16,273 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:33:16,273 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:33:16,273 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:33:16,273 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:33:16,274 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:33:16,274 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:33:16,274 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:33:16,274 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:33:16,275 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:33:16,275 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:33:16,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 00:33:16,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 00:33:16,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:33:16,276 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:33:16,276 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:33:16,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:33:16,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:33:16,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:33:16,277 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 00:33:16,277 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 00:33:16,278 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 00:33:16,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:33:16,278 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 00:33:16,278 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:33:16,279 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:33:16,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:33:16,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:33:16,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:33:16,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:33:16,280 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:33:16,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:33:16,280 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:33:16,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:33:16,281 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:33:16,281 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_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/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_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba 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 -> f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 [2022-11-22 00:33:16,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:33:16,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:33:16,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:33:16,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:33:16,531 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:33:16,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-11-22 00:33:19,617 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:33:19,886 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:33:19,887 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-11-22 00:33:19,912 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/data/1b8064b99/ad3571596fcb441083d3b4ccf6bfcf24/FLAGae536821c [2022-11-22 00:33:19,927 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/data/1b8064b99/ad3571596fcb441083d3b4ccf6bfcf24 [2022-11-22 00:33:19,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:33:19,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:33:19,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:33:19,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:33:19,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:33:19,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:33:19" (1/1) ... [2022-11-22 00:33:19,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19634e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:19, skipping insertion in model container [2022-11-22 00:33:19,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:33:19" (1/1) ... [2022-11-22 00:33:19,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:33:20,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:33:20,210 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-11-22 00:33:20,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:33:20,524 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:33:20,536 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-11-22 00:33:20,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:33:20,612 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:33:20,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20 WrapperNode [2022-11-22 00:33:20,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:33:20,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:33:20,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:33:20,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:33:20,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (1/1) ... [2022-11-22 00:33:20,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (1/1) ... [2022-11-22 00:33:20,733 INFO L138 Inliner]: procedures = 177, calls = 80, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 154 [2022-11-22 00:33:20,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:33:20,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:33:20,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:33:20,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:33:20,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (1/1) ... [2022-11-22 00:33:20,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (1/1) ... [2022-11-22 00:33:20,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (1/1) ... [2022-11-22 00:33:20,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (1/1) ... [2022-11-22 00:33:20,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (1/1) ... [2022-11-22 00:33:20,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (1/1) ... [2022-11-22 00:33:20,768 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (1/1) ... [2022-11-22 00:33:20,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (1/1) ... [2022-11-22 00:33:20,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:33:20,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:33:20,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:33:20,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:33:20,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (1/1) ... [2022-11-22 00:33:20,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:33:20,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:20,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:33:20,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:33:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:33:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:33:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:33:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:33:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:33:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:33:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 00:33:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 00:33:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 00:33:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 00:33:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 00:33:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 00:33:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-22 00:33:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-22 00:33:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:33:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:33:20,866 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:33:21,045 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:33:21,048 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:33:21,660 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:33:21,994 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:33:21,995 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:33:21,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:33:21 BoogieIcfgContainer [2022-11-22 00:33:21,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:33:22,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:33:22,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:33:22,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:33:22,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:33:19" (1/3) ... [2022-11-22 00:33:22,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3840cb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:33:22, skipping insertion in model container [2022-11-22 00:33:22,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:20" (2/3) ... [2022-11-22 00:33:22,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3840cb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:33:22, skipping insertion in model container [2022-11-22 00:33:22,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:33:21" (3/3) ... [2022-11-22 00:33:22,012 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2022-11-22 00:33:22,032 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:33:22,032 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-22 00:33:22,032 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:33:22,237 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 00:33:22,289 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:33:22,308 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 190 transitions, 400 flow [2022-11-22 00:33:22,313 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 190 transitions, 400 flow [2022-11-22 00:33:22,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 190 transitions, 400 flow [2022-11-22 00:33:22,392 INFO L130 PetriNetUnfolder]: 2/186 cut-off events. [2022-11-22 00:33:22,393 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 00:33:22,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 2/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 199 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-22 00:33:22,403 INFO L119 LiptonReduction]: Number of co-enabled transitions 6364 [2022-11-22 00:33:38,533 INFO L134 LiptonReduction]: Checked pairs total: 21783 [2022-11-22 00:33:38,533 INFO L136 LiptonReduction]: Total number of compositions: 174 [2022-11-22 00:33:38,543 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 70 transitions, 160 flow [2022-11-22 00:33:40,932 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:40,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:33:40,972 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;@27365f07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:33:40,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-11-22 00:33:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:41,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 00:33:41,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:41,039 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 00:33:41,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:41,046 INFO L85 PathProgramCache]: Analyzing trace with hash 888, now seen corresponding path program 1 times [2022-11-22 00:33:41,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:41,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279523914] [2022-11-22 00:33:41,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:41,366 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-22 00:33:41,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:41,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279523914] [2022-11-22 00:33:41,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279523914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:41,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:41,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 00:33:41,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922340525] [2022-11-22 00:33:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:41,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 00:33:41,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:41,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 00:33:41,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:33:41,493 INFO L87 Difference]: Start difference. First operand has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 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-22 00:33:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:42,067 INFO L93 Difference]: Finished difference Result 14108 states and 58253 transitions. [2022-11-22 00:33:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 00:33:42,180 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-22 00:33:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:42,356 INFO L225 Difference]: With dead ends: 14108 [2022-11-22 00:33:42,356 INFO L226 Difference]: Without dead ends: 14108 [2022-11-22 00:33:42,357 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-22 00:33:42,359 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:42,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14108 states. [2022-11-22 00:33:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14108 to 14108. [2022-11-22 00:33:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14108 states, 13974 states have (on average 4.168670387863174) internal successors, (58253), 14107 states have internal predecessors, (58253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 58253 transitions. [2022-11-22 00:33:43,196 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 58253 transitions. Word has length 1 [2022-11-22 00:33:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:43,197 INFO L495 AbstractCegarLoop]: Abstraction has 14108 states and 58253 transitions. [2022-11-22 00:33:43,201 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-22 00:33:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 58253 transitions. [2022-11-22 00:33:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 00:33:43,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:43,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 00:33:43,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:33:43,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:43,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:43,204 INFO L85 PathProgramCache]: Analyzing trace with hash 874266, now seen corresponding path program 1 times [2022-11-22 00:33:43,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:43,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125350991] [2022-11-22 00:33:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:43,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-22 00:33:43,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:43,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125350991] [2022-11-22 00:33:43,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125350991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:43,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:43,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:33:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459219594] [2022-11-22 00:33:43,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:43,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:43,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:43,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:43,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:43,773 INFO L87 Difference]: Start difference. First operand 14108 states and 58253 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:44,115 INFO L93 Difference]: Finished difference Result 11645 states and 45566 transitions. [2022-11-22 00:33:44,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:44,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-22 00:33:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:44,215 INFO L225 Difference]: With dead ends: 11645 [2022-11-22 00:33:44,215 INFO L226 Difference]: Without dead ends: 11549 [2022-11-22 00:33:44,217 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-22 00:33:44,218 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:44,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11549 states. [2022-11-22 00:33:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11549 to 9885. [2022-11-22 00:33:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9885 states, 9836 states have (on average 4.077877185847906) internal successors, (40110), 9884 states have internal predecessors, (40110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9885 states to 9885 states and 40110 transitions. [2022-11-22 00:33:44,858 INFO L78 Accepts]: Start accepts. Automaton has 9885 states and 40110 transitions. Word has length 3 [2022-11-22 00:33:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:44,859 INFO L495 AbstractCegarLoop]: Abstraction has 9885 states and 40110 transitions. [2022-11-22 00:33:44,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 9885 states and 40110 transitions. [2022-11-22 00:33:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 00:33:44,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:44,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 00:33:44,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:33:44,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:44,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash 874267, now seen corresponding path program 1 times [2022-11-22 00:33:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:44,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824003840] [2022-11-22 00:33:44,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:44,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:45,237 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-22 00:33:45,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:45,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824003840] [2022-11-22 00:33:45,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824003840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:45,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:45,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:33:45,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297760560] [2022-11-22 00:33:45,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:45,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:45,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:45,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:45,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:45,240 INFO L87 Difference]: Start difference. First operand 9885 states and 40110 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:45,418 INFO L93 Difference]: Finished difference Result 6542 states and 25719 transitions. [2022-11-22 00:33:45,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:45,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-22 00:33:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:45,462 INFO L225 Difference]: With dead ends: 6542 [2022-11-22 00:33:45,463 INFO L226 Difference]: Without dead ends: 6446 [2022-11-22 00:33:45,463 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-22 00:33:45,464 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:45,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:45,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6446 states. [2022-11-22 00:33:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6446 to 6446. [2022-11-22 00:33:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6446 states, 6428 states have (on average 3.9612632233976353) internal successors, (25463), 6445 states have internal predecessors, (25463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 25463 transitions. [2022-11-22 00:33:45,827 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 25463 transitions. Word has length 3 [2022-11-22 00:33:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:45,827 INFO L495 AbstractCegarLoop]: Abstraction has 6446 states and 25463 transitions. [2022-11-22 00:33:45,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 25463 transitions. [2022-11-22 00:33:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:33:45,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:45,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:45,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:33:45,831 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash 816840127, now seen corresponding path program 1 times [2022-11-22 00:33:45,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:45,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69786923] [2022-11-22 00:33:45,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:45,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:46,044 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-22 00:33:46,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:46,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69786923] [2022-11-22 00:33:46,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69786923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:46,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:46,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:33:46,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891108508] [2022-11-22 00:33:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:46,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:46,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:46,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:46,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:46,047 INFO L87 Difference]: Start difference. First operand 6446 states and 25463 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:46,329 INFO L93 Difference]: Finished difference Result 6286 states and 24775 transitions. [2022-11-22 00:33:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 00:33:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:46,376 INFO L225 Difference]: With dead ends: 6286 [2022-11-22 00:33:46,377 INFO L226 Difference]: Without dead ends: 6286 [2022-11-22 00:33:46,377 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-22 00:33:46,381 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:46,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 14 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:33:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6286 states. [2022-11-22 00:33:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6286 to 6286. [2022-11-22 00:33:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6286 states, 6268 states have (on average 3.952616464582004) internal successors, (24775), 6285 states have internal predecessors, (24775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 24775 transitions. [2022-11-22 00:33:46,689 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 24775 transitions. Word has length 13 [2022-11-22 00:33:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:46,692 INFO L495 AbstractCegarLoop]: Abstraction has 6286 states and 24775 transitions. [2022-11-22 00:33:46,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 24775 transitions. [2022-11-22 00:33:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:33:46,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:46,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:46,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:33:46,706 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash -842205565, now seen corresponding path program 1 times [2022-11-22 00:33:46,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:46,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794055136] [2022-11-22 00:33:46,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:47,120 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-22 00:33:47,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:47,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794055136] [2022-11-22 00:33:47,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794055136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:47,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:47,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:47,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896925647] [2022-11-22 00:33:47,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:47,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:33:47,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:47,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:33:47,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:47,128 INFO L87 Difference]: Start difference. First operand 6286 states and 24775 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:47,350 INFO L93 Difference]: Finished difference Result 6046 states and 23823 transitions. [2022-11-22 00:33:47,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:47,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 00:33:47,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:47,389 INFO L225 Difference]: With dead ends: 6046 [2022-11-22 00:33:47,389 INFO L226 Difference]: Without dead ends: 6046 [2022-11-22 00:33:47,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:47,390 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:47,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 17 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:33:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2022-11-22 00:33:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 6046. [2022-11-22 00:33:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6046 states, 6029 states have (on average 3.9514015591308675) internal successors, (23823), 6045 states have internal predecessors, (23823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6046 states to 6046 states and 23823 transitions. [2022-11-22 00:33:47,730 INFO L78 Accepts]: Start accepts. Automaton has 6046 states and 23823 transitions. Word has length 14 [2022-11-22 00:33:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:47,730 INFO L495 AbstractCegarLoop]: Abstraction has 6046 states and 23823 transitions. [2022-11-22 00:33:47,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6046 states and 23823 transitions. [2022-11-22 00:33:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:33:47,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:47,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:47,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:33:47,733 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:47,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:47,733 INFO L85 PathProgramCache]: Analyzing trace with hash -842205564, now seen corresponding path program 1 times [2022-11-22 00:33:47,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:47,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380886205] [2022-11-22 00:33:47,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:47,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:48,230 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-22 00:33:48,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:48,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380886205] [2022-11-22 00:33:48,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380886205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:48,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:48,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:48,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33694283] [2022-11-22 00:33:48,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:48,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:33:48,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:48,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:33:48,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:48,233 INFO L87 Difference]: Start difference. First operand 6046 states and 23823 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:48,430 INFO L93 Difference]: Finished difference Result 5806 states and 22871 transitions. [2022-11-22 00:33:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:48,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 00:33:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:48,466 INFO L225 Difference]: With dead ends: 5806 [2022-11-22 00:33:48,467 INFO L226 Difference]: Without dead ends: 5806 [2022-11-22 00:33:48,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:48,470 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 88 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:48,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 12 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5806 states. [2022-11-22 00:33:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5806 to 5806. [2022-11-22 00:33:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5806 states, 5790 states have (on average 3.9500863557858374) internal successors, (22871), 5805 states have internal predecessors, (22871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5806 states to 5806 states and 22871 transitions. [2022-11-22 00:33:48,757 INFO L78 Accepts]: Start accepts. Automaton has 5806 states and 22871 transitions. Word has length 14 [2022-11-22 00:33:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:48,757 INFO L495 AbstractCegarLoop]: Abstraction has 5806 states and 22871 transitions. [2022-11-22 00:33:48,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5806 states and 22871 transitions. [2022-11-22 00:33:48,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:33:48,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:48,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:48,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:33:48,759 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash -447764594, now seen corresponding path program 1 times [2022-11-22 00:33:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:48,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609096614] [2022-11-22 00:33:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:48,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:49,015 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-22 00:33:49,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:49,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609096614] [2022-11-22 00:33:49,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609096614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:49,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:49,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:33:49,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107220054] [2022-11-22 00:33:49,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:49,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:49,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:49,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:49,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:49,018 INFO L87 Difference]: Start difference. First operand 5806 states and 22871 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:49,149 INFO L93 Difference]: Finished difference Result 5726 states and 22527 transitions. [2022-11-22 00:33:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:49,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 00:33:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:49,179 INFO L225 Difference]: With dead ends: 5726 [2022-11-22 00:33:49,180 INFO L226 Difference]: Without dead ends: 5726 [2022-11-22 00:33:49,180 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-22 00:33:49,181 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:49,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 14 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2022-11-22 00:33:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5726. [2022-11-22 00:33:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5726 states, 5710 states have (on average 3.945183887915937) internal successors, (22527), 5725 states have internal predecessors, (22527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5726 states to 5726 states and 22527 transitions. [2022-11-22 00:33:49,498 INFO L78 Accepts]: Start accepts. Automaton has 5726 states and 22527 transitions. Word has length 14 [2022-11-22 00:33:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:49,498 INFO L495 AbstractCegarLoop]: Abstraction has 5726 states and 22527 transitions. [2022-11-22 00:33:49,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5726 states and 22527 transitions. [2022-11-22 00:33:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:33:49,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:49,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:49,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:33:49,502 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:49,502 INFO L85 PathProgramCache]: Analyzing trace with hash 642592112, now seen corresponding path program 1 times [2022-11-22 00:33:49,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:49,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810809717] [2022-11-22 00:33:49,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:49,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:49,738 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-22 00:33:49,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:49,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810809717] [2022-11-22 00:33:49,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810809717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:49,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:49,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:33:49,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58961056] [2022-11-22 00:33:49,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:49,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:49,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:49,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:49,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:49,741 INFO L87 Difference]: Start difference. First operand 5726 states and 22527 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:49,891 INFO L93 Difference]: Finished difference Result 5666 states and 22274 transitions. [2022-11-22 00:33:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:49,891 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-22 00:33:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:49,930 INFO L225 Difference]: With dead ends: 5666 [2022-11-22 00:33:49,930 INFO L226 Difference]: Without dead ends: 5666 [2022-11-22 00:33:49,930 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-22 00:33:49,932 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:49,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 13 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5666 states. [2022-11-22 00:33:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5666 to 5666. [2022-11-22 00:33:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5666 states, 5650 states have (on average 3.942300884955752) internal successors, (22274), 5665 states have internal predecessors, (22274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5666 states to 5666 states and 22274 transitions. [2022-11-22 00:33:50,171 INFO L78 Accepts]: Start accepts. Automaton has 5666 states and 22274 transitions. Word has length 15 [2022-11-22 00:33:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:50,171 INFO L495 AbstractCegarLoop]: Abstraction has 5666 states and 22274 transitions. [2022-11-22 00:33:50,172 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-22 00:33:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5666 states and 22274 transitions. [2022-11-22 00:33:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:33:50,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:50,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:50,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:33:50,175 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:50,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1554483097, now seen corresponding path program 1 times [2022-11-22 00:33:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:50,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171067372] [2022-11-22 00:33:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:50,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:50,472 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-22 00:33:50,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:50,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171067372] [2022-11-22 00:33:50,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171067372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:50,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:50,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:33:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889880697] [2022-11-22 00:33:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:50,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:50,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:50,475 INFO L87 Difference]: Start difference. First operand 5666 states and 22274 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:50,605 INFO L93 Difference]: Finished difference Result 5657 states and 22235 transitions. [2022-11-22 00:33:50,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:50,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 00:33:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:50,641 INFO L225 Difference]: With dead ends: 5657 [2022-11-22 00:33:50,641 INFO L226 Difference]: Without dead ends: 5657 [2022-11-22 00:33:50,641 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-22 00:33:50,642 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:50,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 14 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:50,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5657 states. [2022-11-22 00:33:50,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5657 to 5657. [2022-11-22 00:33:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5657 states, 5641 states have (on average 3.941677007622762) internal successors, (22235), 5656 states have internal predecessors, (22235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5657 states to 5657 states and 22235 transitions. [2022-11-22 00:33:50,888 INFO L78 Accepts]: Start accepts. Automaton has 5657 states and 22235 transitions. Word has length 16 [2022-11-22 00:33:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:50,889 INFO L495 AbstractCegarLoop]: Abstraction has 5657 states and 22235 transitions. [2022-11-22 00:33:50,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 5657 states and 22235 transitions. [2022-11-22 00:33:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:33:50,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:50,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:50,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:33:50,893 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:50,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash -805054933, now seen corresponding path program 1 times [2022-11-22 00:33:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:50,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521949840] [2022-11-22 00:33:50,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:50,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:51,185 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-22 00:33:51,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:51,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521949840] [2022-11-22 00:33:51,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521949840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:51,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:51,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:51,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192907335] [2022-11-22 00:33:51,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:51,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:33:51,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:51,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:33:51,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:51,188 INFO L87 Difference]: Start difference. First operand 5657 states and 22235 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:51,399 INFO L93 Difference]: Finished difference Result 6313 states and 23795 transitions. [2022-11-22 00:33:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:51,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 00:33:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:51,436 INFO L225 Difference]: With dead ends: 6313 [2022-11-22 00:33:51,436 INFO L226 Difference]: Without dead ends: 6313 [2022-11-22 00:33:51,437 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-22 00:33:51,437 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:51,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 19 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6313 states. [2022-11-22 00:33:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6313 to 5129. [2022-11-22 00:33:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 5113 states have (on average 3.9121846274203014) internal successors, (20003), 5128 states have internal predecessors, (20003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 20003 transitions. [2022-11-22 00:33:51,672 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 20003 transitions. Word has length 16 [2022-11-22 00:33:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:51,673 INFO L495 AbstractCegarLoop]: Abstraction has 5129 states and 20003 transitions. [2022-11-22 00:33:51,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 20003 transitions. [2022-11-22 00:33:51,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:33:51,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:51,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:51,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:33:51,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:51,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:51,677 INFO L85 PathProgramCache]: Analyzing trace with hash -951002107, now seen corresponding path program 1 times [2022-11-22 00:33:51,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:51,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363986708] [2022-11-22 00:33:51,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:51,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:52,040 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-22 00:33:52,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:52,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363986708] [2022-11-22 00:33:52,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363986708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:52,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:52,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:52,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470764307] [2022-11-22 00:33:52,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:52,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:33:52,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:52,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:33:52,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:52,043 INFO L87 Difference]: Start difference. First operand 5129 states and 20003 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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-22 00:33:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:52,212 INFO L93 Difference]: Finished difference Result 5150 states and 20095 transitions. [2022-11-22 00:33:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:52,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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-22 00:33:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:52,239 INFO L225 Difference]: With dead ends: 5150 [2022-11-22 00:33:52,240 INFO L226 Difference]: Without dead ends: 5150 [2022-11-22 00:33:52,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:52,241 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:52,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 18 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2022-11-22 00:33:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 5102. [2022-11-22 00:33:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5102 states, 5086 states have (on average 3.9117184427841134) internal successors, (19895), 5101 states have internal predecessors, (19895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5102 states to 5102 states and 19895 transitions. [2022-11-22 00:33:52,455 INFO L78 Accepts]: Start accepts. Automaton has 5102 states and 19895 transitions. Word has length 17 [2022-11-22 00:33:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:52,455 INFO L495 AbstractCegarLoop]: Abstraction has 5102 states and 19895 transitions. [2022-11-22 00:33:52,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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-22 00:33:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5102 states and 19895 transitions. [2022-11-22 00:33:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:33:52,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:52,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:52,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 00:33:52,459 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:52,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1056808475, now seen corresponding path program 1 times [2022-11-22 00:33:52,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:52,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534541843] [2022-11-22 00:33:52,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:52,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:52,799 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-22 00:33:52,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:52,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534541843] [2022-11-22 00:33:52,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534541843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:52,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:52,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:52,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887671075] [2022-11-22 00:33:52,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:52,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:33:52,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:52,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:33:52,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:52,802 INFO L87 Difference]: Start difference. First operand 5102 states and 19895 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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-22 00:33:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:52,968 INFO L93 Difference]: Finished difference Result 5066 states and 19748 transitions. [2022-11-22 00:33:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:52,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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-22 00:33:52,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:52,995 INFO L225 Difference]: With dead ends: 5066 [2022-11-22 00:33:52,995 INFO L226 Difference]: Without dead ends: 5066 [2022-11-22 00:33:52,996 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-22 00:33:52,996 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 80 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:52,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 20 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2022-11-22 00:33:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 5066. [2022-11-22 00:33:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5066 states, 5050 states have (on average 3.9104950495049504) internal successors, (19748), 5065 states have internal predecessors, (19748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5066 states to 5066 states and 19748 transitions. [2022-11-22 00:33:53,204 INFO L78 Accepts]: Start accepts. Automaton has 5066 states and 19748 transitions. Word has length 17 [2022-11-22 00:33:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:53,205 INFO L495 AbstractCegarLoop]: Abstraction has 5066 states and 19748 transitions. [2022-11-22 00:33:53,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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-22 00:33:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5066 states and 19748 transitions. [2022-11-22 00:33:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:33:53,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:53,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:53,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 00:33:53,209 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:53,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:53,210 INFO L85 PathProgramCache]: Analyzing trace with hash 813102779, now seen corresponding path program 1 times [2022-11-22 00:33:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:53,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208480450] [2022-11-22 00:33:53,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:53,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:53,637 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-22 00:33:53,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:53,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208480450] [2022-11-22 00:33:53,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208480450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:53,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:53,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:33:53,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889107673] [2022-11-22 00:33:53,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:53,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:33:53,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:53,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:33:53,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:33:53,641 INFO L87 Difference]: Start difference. First operand 5066 states and 19748 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-22 00:33:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:53,874 INFO L93 Difference]: Finished difference Result 5450 states and 20404 transitions. [2022-11-22 00:33:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:33:53,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-22 00:33:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:53,904 INFO L225 Difference]: With dead ends: 5450 [2022-11-22 00:33:53,904 INFO L226 Difference]: Without dead ends: 5450 [2022-11-22 00:33:53,904 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-22 00:33:53,905 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:53,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 17 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:33:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5450 states. [2022-11-22 00:33:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5450 to 4538. [2022-11-22 00:33:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4538 states, 4522 states have (on average 3.8735072976559044) internal successors, (17516), 4537 states have internal predecessors, (17516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 17516 transitions. [2022-11-22 00:33:54,104 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 17516 transitions. Word has length 17 [2022-11-22 00:33:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:54,105 INFO L495 AbstractCegarLoop]: Abstraction has 4538 states and 17516 transitions. [2022-11-22 00:33:54,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-22 00:33:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 17516 transitions. [2022-11-22 00:33:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 00:33:54,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:54,111 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-22 00:33:54,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 00:33:54,112 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:54,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash 580075581, now seen corresponding path program 1 times [2022-11-22 00:33:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:54,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545910661] [2022-11-22 00:33:54,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:54,392 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-22 00:33:54,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:54,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545910661] [2022-11-22 00:33:54,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545910661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:54,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:54,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:33:54,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747911890] [2022-11-22 00:33:54,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:54,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:33:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:54,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:33:54,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:54,395 INFO L87 Difference]: Start difference. First operand 4538 states and 17516 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 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-22 00:33:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:54,588 INFO L93 Difference]: Finished difference Result 6230 states and 23625 transitions. [2022-11-22 00:33:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:54,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 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-22 00:33:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:54,614 INFO L225 Difference]: With dead ends: 6230 [2022-11-22 00:33:54,614 INFO L226 Difference]: Without dead ends: 6230 [2022-11-22 00:33:54,614 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-22 00:33:54,615 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 74 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:54,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 16 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2022-11-22 00:33:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 4886. [2022-11-22 00:33:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4886 states, 4870 states have (on average 3.862217659137577) internal successors, (18809), 4885 states have internal predecessors, (18809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 18809 transitions. [2022-11-22 00:33:54,831 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 18809 transitions. Word has length 18 [2022-11-22 00:33:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:54,831 INFO L495 AbstractCegarLoop]: Abstraction has 4886 states and 18809 transitions. [2022-11-22 00:33:54,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 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-22 00:33:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 18809 transitions. [2022-11-22 00:33:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 00:33:54,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:54,837 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-22 00:33:54,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 00:33:54,837 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:54,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:54,838 INFO L85 PathProgramCache]: Analyzing trace with hash -563617965, now seen corresponding path program 1 times [2022-11-22 00:33:54,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:54,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255782463] [2022-11-22 00:33:54,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:54,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:55,898 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-22 00:33:55,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:55,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255782463] [2022-11-22 00:33:55,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255782463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:55,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:55,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 00:33:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116899174] [2022-11-22 00:33:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:55,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 00:33:55,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:55,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 00:33:55,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:33:55,901 INFO L87 Difference]: Start difference. First operand 4886 states and 18809 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-22 00:33:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:57,099 INFO L93 Difference]: Finished difference Result 7302 states and 28109 transitions. [2022-11-22 00:33:57,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 00:33:57,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-22 00:33:57,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:57,124 INFO L225 Difference]: With dead ends: 7302 [2022-11-22 00:33:57,124 INFO L226 Difference]: Without dead ends: 6630 [2022-11-22 00:33:57,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-22 00:33:57,125 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:57,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 158 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 00:33:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2022-11-22 00:33:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 6558. [2022-11-22 00:33:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6558 states, 6542 states have (on average 3.801131152552736) internal successors, (24867), 6557 states have internal predecessors, (24867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 24867 transitions. [2022-11-22 00:33:57,384 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 24867 transitions. Word has length 18 [2022-11-22 00:33:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:57,385 INFO L495 AbstractCegarLoop]: Abstraction has 6558 states and 24867 transitions. [2022-11-22 00:33:57,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-22 00:33:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 24867 transitions. [2022-11-22 00:33:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 00:33:57,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:57,393 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-22 00:33:57,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 00:33:57,393 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:57,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash -563617995, now seen corresponding path program 1 times [2022-11-22 00:33:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:57,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653664056] [2022-11-22 00:33:57,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:57,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:57,939 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-22 00:33:57,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:57,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653664056] [2022-11-22 00:33:57,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653664056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:57,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:57,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 00:33:57,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842163595] [2022-11-22 00:33:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:57,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 00:33:57,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:57,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 00:33:57,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:33:57,945 INFO L87 Difference]: Start difference. First operand 6558 states and 24867 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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-22 00:33:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:58,249 INFO L93 Difference]: Finished difference Result 6350 states and 22963 transitions. [2022-11-22 00:33:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:33:58,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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-22 00:33:58,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:58,279 INFO L225 Difference]: With dead ends: 6350 [2022-11-22 00:33:58,279 INFO L226 Difference]: Without dead ends: 6350 [2022-11-22 00:33:58,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:33:58,280 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 139 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:58,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 33 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:33:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6350 states. [2022-11-22 00:33:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6350 to 5634. [2022-11-22 00:33:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5634 states, 5618 states have (on average 3.680669277322891) internal successors, (20678), 5633 states have internal predecessors, (20678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5634 states to 5634 states and 20678 transitions. [2022-11-22 00:33:58,498 INFO L78 Accepts]: Start accepts. Automaton has 5634 states and 20678 transitions. Word has length 18 [2022-11-22 00:33:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:58,499 INFO L495 AbstractCegarLoop]: Abstraction has 5634 states and 20678 transitions. [2022-11-22 00:33:58,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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-22 00:33:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5634 states and 20678 transitions. [2022-11-22 00:33:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:33:58,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:58,507 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-22 00:33:58,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 00:33:58,508 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:58,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash -920100396, now seen corresponding path program 1 times [2022-11-22 00:33:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:58,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361385106] [2022-11-22 00:33:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:58,849 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-22 00:33:58,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:58,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361385106] [2022-11-22 00:33:58,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361385106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:58,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:58,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:33:58,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525526787] [2022-11-22 00:33:58,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:58,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:33:58,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:58,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:33:58,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:33:58,852 INFO L87 Difference]: Start difference. First operand 5634 states and 20678 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:59,106 INFO L93 Difference]: Finished difference Result 8872 states and 31978 transitions. [2022-11-22 00:33:59,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:33:59,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-22 00:33:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:59,147 INFO L225 Difference]: With dead ends: 8872 [2022-11-22 00:33:59,148 INFO L226 Difference]: Without dead ends: 8728 [2022-11-22 00:33:59,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:33:59,149 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 168 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:59,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 17 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:33:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2022-11-22 00:33:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 5490. [2022-11-22 00:33:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5490 states, 5474 states have (on average 3.646693459992693) internal successors, (19962), 5489 states have internal predecessors, (19962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5490 states to 5490 states and 19962 transitions. [2022-11-22 00:33:59,394 INFO L78 Accepts]: Start accepts. Automaton has 5490 states and 19962 transitions. Word has length 19 [2022-11-22 00:33:59,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:59,395 INFO L495 AbstractCegarLoop]: Abstraction has 5490 states and 19962 transitions. [2022-11-22 00:33:59,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 5490 states and 19962 transitions. [2022-11-22 00:33:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:33:59,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:59,404 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-22 00:33:59,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 00:33:59,405 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:59,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:59,405 INFO L85 PathProgramCache]: Analyzing trace with hash -292285588, now seen corresponding path program 1 times [2022-11-22 00:33:59,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:59,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693646364] [2022-11-22 00:33:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:59,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:59,518 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-22 00:33:59,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:59,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693646364] [2022-11-22 00:33:59,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693646364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:59,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:59,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:33:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055637021] [2022-11-22 00:33:59,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:59,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:33:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:33:59,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:59,521 INFO L87 Difference]: Start difference. First operand 5490 states and 19962 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:59,674 INFO L93 Difference]: Finished difference Result 6582 states and 24165 transitions. [2022-11-22 00:33:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:59,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-22 00:33:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:59,688 INFO L225 Difference]: With dead ends: 6582 [2022-11-22 00:33:59,688 INFO L226 Difference]: Without dead ends: 4166 [2022-11-22 00:33:59,688 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-22 00:33:59,689 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 57 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:59,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 6 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2022-11-22 00:33:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 3314. [2022-11-22 00:33:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3314 states, 3305 states have (on average 3.587897125567322) internal successors, (11858), 3313 states have internal predecessors, (11858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 11858 transitions. [2022-11-22 00:33:59,813 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 11858 transitions. Word has length 19 [2022-11-22 00:33:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:59,814 INFO L495 AbstractCegarLoop]: Abstraction has 3314 states and 11858 transitions. [2022-11-22 00:33:59,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 11858 transitions. [2022-11-22 00:33:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:33:59,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:59,820 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-22 00:33:59,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 00:33:59,820 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:33:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:59,821 INFO L85 PathProgramCache]: Analyzing trace with hash 413451824, now seen corresponding path program 1 times [2022-11-22 00:33:59,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:59,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032823794] [2022-11-22 00:33:59,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:59,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:00,932 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-22 00:34:00,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:00,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032823794] [2022-11-22 00:34:00,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032823794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:00,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:00,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-22 00:34:00,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136113981] [2022-11-22 00:34:00,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:00,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 00:34:00,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:00,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 00:34:00,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:34:00,935 INFO L87 Difference]: Start difference. First operand 3314 states and 11858 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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-22 00:34:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:02,080 INFO L93 Difference]: Finished difference Result 4164 states and 14668 transitions. [2022-11-22 00:34:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 00:34:02,080 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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-22 00:34:02,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:02,087 INFO L225 Difference]: With dead ends: 4164 [2022-11-22 00:34:02,087 INFO L226 Difference]: Without dead ends: 2340 [2022-11-22 00:34:02,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-22 00:34:02,088 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 115 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:02,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 155 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 00:34:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2022-11-22 00:34:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 1940. [2022-11-22 00:34:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1931 states have (on average 3.372345934748835) internal successors, (6512), 1939 states have internal predecessors, (6512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 6512 transitions. [2022-11-22 00:34:02,145 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 6512 transitions. Word has length 19 [2022-11-22 00:34:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:02,145 INFO L495 AbstractCegarLoop]: Abstraction has 1940 states and 6512 transitions. [2022-11-22 00:34:02,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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-22 00:34:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 6512 transitions. [2022-11-22 00:34:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:34:02,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:02,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:02,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 00:34:02,150 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:34:02,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1847852123, now seen corresponding path program 1 times [2022-11-22 00:34:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:02,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392630030] [2022-11-22 00:34:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:02,395 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-22 00:34:02,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:02,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392630030] [2022-11-22 00:34:02,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392630030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:02,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:02,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:34:02,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639785939] [2022-11-22 00:34:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:02,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:34:02,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:34:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:34:02,397 INFO L87 Difference]: Start difference. First operand 1940 states and 6512 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:02,543 INFO L93 Difference]: Finished difference Result 2794 states and 9163 transitions. [2022-11-22 00:34:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:34:02,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 00:34:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:02,550 INFO L225 Difference]: With dead ends: 2794 [2022-11-22 00:34:02,551 INFO L226 Difference]: Without dead ends: 2422 [2022-11-22 00:34:02,551 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-22 00:34:02,552 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 64 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:02,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 23 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2022-11-22 00:34:02,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 1738. [2022-11-22 00:34:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1729 states have (on average 3.3048004626951997) internal successors, (5714), 1737 states have internal predecessors, (5714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 5714 transitions. [2022-11-22 00:34:02,600 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 5714 transitions. Word has length 20 [2022-11-22 00:34:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:02,600 INFO L495 AbstractCegarLoop]: Abstraction has 1738 states and 5714 transitions. [2022-11-22 00:34:02,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 5714 transitions. [2022-11-22 00:34:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:34:02,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:02,603 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-22 00:34:02,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-22 00:34:02,603 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:34:02,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash 450835120, now seen corresponding path program 1 times [2022-11-22 00:34:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:02,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430771192] [2022-11-22 00:34:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:04,466 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-22 00:34:04,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:04,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430771192] [2022-11-22 00:34:04,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430771192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:04,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:04,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 00:34:04,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749952618] [2022-11-22 00:34:04,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:04,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 00:34:04,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:04,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 00:34:04,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-22 00:34:04,468 INFO L87 Difference]: Start difference. First operand 1738 states and 5714 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:05,208 INFO L93 Difference]: Finished difference Result 2377 states and 7784 transitions. [2022-11-22 00:34:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 00:34:05,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 00:34:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:05,215 INFO L225 Difference]: With dead ends: 2377 [2022-11-22 00:34:05,215 INFO L226 Difference]: Without dead ends: 2377 [2022-11-22 00:34:05,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2022-11-22 00:34:05,216 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 151 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:05,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 45 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:34:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-11-22 00:34:05,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1990. [2022-11-22 00:34:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1981 states have (on average 3.2569409389197377) internal successors, (6452), 1989 states have internal predecessors, (6452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 6452 transitions. [2022-11-22 00:34:05,277 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 6452 transitions. Word has length 21 [2022-11-22 00:34:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:05,277 INFO L495 AbstractCegarLoop]: Abstraction has 1990 states and 6452 transitions. [2022-11-22 00:34:05,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 6452 transitions. [2022-11-22 00:34:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:34:05,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:05,283 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-22 00:34:05,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 00:34:05,283 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:34:05,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:05,284 INFO L85 PathProgramCache]: Analyzing trace with hash -57821407, now seen corresponding path program 1 times [2022-11-22 00:34:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:05,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749189158] [2022-11-22 00:34:05,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:05,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:06,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-22 00:34:06,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:06,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749189158] [2022-11-22 00:34:06,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749189158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:06,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:06,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 00:34:06,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933643482] [2022-11-22 00:34:06,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:06,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 00:34:06,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:06,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 00:34:06,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:34:06,219 INFO L87 Difference]: Start difference. First operand 1990 states and 6452 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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-22 00:34:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:07,211 INFO L93 Difference]: Finished difference Result 1672 states and 5433 transitions. [2022-11-22 00:34:07,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 00:34:07,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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-22 00:34:07,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:07,213 INFO L225 Difference]: With dead ends: 1672 [2022-11-22 00:34:07,213 INFO L226 Difference]: Without dead ends: 712 [2022-11-22 00:34:07,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-22 00:34:07,214 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 93 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:07,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 142 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 00:34:07,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-11-22 00:34:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 472. [2022-11-22 00:34:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 2.713375796178344) internal successors, (1278), 471 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1278 transitions. [2022-11-22 00:34:07,224 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1278 transitions. Word has length 21 [2022-11-22 00:34:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:07,224 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 1278 transitions. [2022-11-22 00:34:07,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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-22 00:34:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1278 transitions. [2022-11-22 00:34:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:34:07,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:07,226 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-22 00:34:07,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-22 00:34:07,226 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:34:07,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:07,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1913600808, now seen corresponding path program 2 times [2022-11-22 00:34:07,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:07,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771143768] [2022-11-22 00:34:07,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:07,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:08,483 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-22 00:34:08,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:08,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771143768] [2022-11-22 00:34:08,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771143768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:08,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:08,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 00:34:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965880389] [2022-11-22 00:34:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:08,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 00:34:08,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:08,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 00:34:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-22 00:34:08,485 INFO L87 Difference]: Start difference. First operand 472 states and 1278 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:09,011 INFO L93 Difference]: Finished difference Result 601 states and 1637 transitions. [2022-11-22 00:34:09,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:34:09,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 00:34:09,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:09,013 INFO L225 Difference]: With dead ends: 601 [2022-11-22 00:34:09,013 INFO L226 Difference]: Without dead ends: 601 [2022-11-22 00:34:09,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-11-22 00:34:09,014 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:09,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 35 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:34:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-11-22 00:34:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 433. [2022-11-22 00:34:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 2.736111111111111) internal successors, (1182), 432 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1182 transitions. [2022-11-22 00:34:09,025 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1182 transitions. Word has length 21 [2022-11-22 00:34:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:09,026 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 1182 transitions. [2022-11-22 00:34:09,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1182 transitions. [2022-11-22 00:34:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:34:09,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:09,029 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-22 00:34:09,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-22 00:34:09,029 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:34:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:09,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1369848938, now seen corresponding path program 3 times [2022-11-22 00:34:09,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:09,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027049715] [2022-11-22 00:34:09,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:09,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:10,453 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-22 00:34:10,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:10,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027049715] [2022-11-22 00:34:10,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027049715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:10,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:10,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 00:34:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216205548] [2022-11-22 00:34:10,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:10,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 00:34:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:10,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 00:34:10,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:34:10,455 INFO L87 Difference]: Start difference. First operand 433 states and 1182 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:11,010 INFO L93 Difference]: Finished difference Result 425 states and 1154 transitions. [2022-11-22 00:34:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 00:34:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 00:34:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:11,011 INFO L225 Difference]: With dead ends: 425 [2022-11-22 00:34:11,012 INFO L226 Difference]: Without dead ends: 425 [2022-11-22 00:34:11,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2022-11-22 00:34:11,015 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 91 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:11,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 19 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:34:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-11-22 00:34:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 296. [2022-11-22 00:34:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.694915254237288) internal successors, (795), 295 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 795 transitions. [2022-11-22 00:34:11,025 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 795 transitions. Word has length 21 [2022-11-22 00:34:11,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:11,026 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 795 transitions. [2022-11-22 00:34:11,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 795 transitions. [2022-11-22 00:34:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:34:11,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:11,028 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-22 00:34:11,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-22 00:34:11,028 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:34:11,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:11,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1090982759, now seen corresponding path program 1 times [2022-11-22 00:34:11,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:11,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620491664] [2022-11-22 00:34:11,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:11,233 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-22 00:34:11,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:11,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620491664] [2022-11-22 00:34:11,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620491664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:11,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:11,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:34:11,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545224186] [2022-11-22 00:34:11,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:11,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:11,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:11,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:11,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:34:11,235 INFO L87 Difference]: Start difference. First operand 296 states and 795 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 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-22 00:34:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:11,290 INFO L93 Difference]: Finished difference Result 274 states and 709 transitions. [2022-11-22 00:34:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:11,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 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-22 00:34:11,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:11,292 INFO L225 Difference]: With dead ends: 274 [2022-11-22 00:34:11,292 INFO L226 Difference]: Without dead ends: 274 [2022-11-22 00:34:11,292 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-22 00:34:11,293 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:11,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-22 00:34:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2022-11-22 00:34:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 2.597069597069597) internal successors, (709), 273 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 709 transitions. [2022-11-22 00:34:11,299 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 709 transitions. Word has length 22 [2022-11-22 00:34:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:11,299 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 709 transitions. [2022-11-22 00:34:11,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 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-22 00:34:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 709 transitions. [2022-11-22 00:34:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:34:11,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:11,300 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-22 00:34:11,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-22 00:34:11,301 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:34:11,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:11,301 INFO L85 PathProgramCache]: Analyzing trace with hash 472528972, now seen corresponding path program 1 times [2022-11-22 00:34:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:11,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313290542] [2022-11-22 00:34:11,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:11,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:11,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-22 00:34:11,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:11,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313290542] [2022-11-22 00:34:11,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313290542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:11,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:11,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:34:11,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838109444] [2022-11-22 00:34:11,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:11,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:34:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:11,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:34:11,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:34:11,497 INFO L87 Difference]: Start difference. First operand 274 states and 709 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:11,571 INFO L93 Difference]: Finished difference Result 229 states and 545 transitions. [2022-11-22 00:34:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:34:11,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-22 00:34:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:11,572 INFO L225 Difference]: With dead ends: 229 [2022-11-22 00:34:11,572 INFO L226 Difference]: Without dead ends: 229 [2022-11-22 00:34:11,573 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-22 00:34:11,573 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:11,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 15 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-22 00:34:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-11-22 00:34:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.3903508771929824) internal successors, (545), 228 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 545 transitions. [2022-11-22 00:34:11,578 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 545 transitions. Word has length 23 [2022-11-22 00:34:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:11,578 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 545 transitions. [2022-11-22 00:34:11,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 545 transitions. [2022-11-22 00:34:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:34:11,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:11,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:11,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-22 00:34:11,581 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:34:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1635857657, now seen corresponding path program 1 times [2022-11-22 00:34:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:11,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571173309] [2022-11-22 00:34:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:11,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:11,787 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-22 00:34:11,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:11,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571173309] [2022-11-22 00:34:11,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571173309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:11,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:11,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:34:11,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068766062] [2022-11-22 00:34:11,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:11,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:34:11,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:11,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:34:11,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:34:11,790 INFO L87 Difference]: Start difference. First operand 229 states and 545 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:11,876 INFO L93 Difference]: Finished difference Result 186 states and 420 transitions. [2022-11-22 00:34:11,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:34:11,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:34:11,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:11,877 INFO L225 Difference]: With dead ends: 186 [2022-11-22 00:34:11,878 INFO L226 Difference]: Without dead ends: 186 [2022-11-22 00:34:11,878 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-22 00:34:11,878 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 72 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:11,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 17 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-22 00:34:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-11-22 00:34:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.27027027027027) internal successors, (420), 185 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 420 transitions. [2022-11-22 00:34:11,883 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 420 transitions. Word has length 24 [2022-11-22 00:34:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:11,884 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 420 transitions. [2022-11-22 00:34:11,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 420 transitions. [2022-11-22 00:34:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 00:34:11,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:11,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:11,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-22 00:34:11,885 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:34:11,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:11,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1935439646, now seen corresponding path program 1 times [2022-11-22 00:34:11,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:11,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393739811] [2022-11-22 00:34:11,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:11,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:12,113 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-22 00:34:12,113 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:12,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393739811] [2022-11-22 00:34:12,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393739811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:12,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:12,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:34:12,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625779913] [2022-11-22 00:34:12,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:12,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:34:12,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:12,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:34:12,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:12,115 INFO L87 Difference]: Start difference. First operand 186 states and 420 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:12,215 INFO L93 Difference]: Finished difference Result 167 states and 382 transitions. [2022-11-22 00:34:12,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:34:12,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-22 00:34:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:12,216 INFO L225 Difference]: With dead ends: 167 [2022-11-22 00:34:12,216 INFO L226 Difference]: Without dead ends: 167 [2022-11-22 00:34:12,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:12,217 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:12,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 17 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-22 00:34:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-11-22 00:34:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.3012048192771086) internal successors, (382), 166 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 382 transitions. [2022-11-22 00:34:12,221 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 382 transitions. Word has length 25 [2022-11-22 00:34:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:12,221 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 382 transitions. [2022-11-22 00:34:12,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:34:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 382 transitions. [2022-11-22 00:34:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-22 00:34:12,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:12,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:12,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-22 00:34:12,222 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:34:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash -391019442, now seen corresponding path program 1 times [2022-11-22 00:34:12,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:12,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235499687] [2022-11-22 00:34:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:34:12,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 00:34:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:34:12,401 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 00:34:12,401 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 00:34:12,402 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (55 of 56 remaining) [2022-11-22 00:34:12,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2022-11-22 00:34:12,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2022-11-22 00:34:12,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2022-11-22 00:34:12,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2022-11-22 00:34:12,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2022-11-22 00:34:12,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2022-11-22 00:34:12,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2022-11-22 00:34:12,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2022-11-22 00:34:12,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2022-11-22 00:34:12,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2022-11-22 00:34:12,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2022-11-22 00:34:12,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2022-11-22 00:34:12,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2022-11-22 00:34:12,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2022-11-22 00:34:12,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2022-11-22 00:34:12,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2022-11-22 00:34:12,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2022-11-22 00:34:12,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2022-11-22 00:34:12,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2022-11-22 00:34:12,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2022-11-22 00:34:12,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2022-11-22 00:34:12,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2022-11-22 00:34:12,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2022-11-22 00:34:12,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2022-11-22 00:34:12,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2022-11-22 00:34:12,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2022-11-22 00:34:12,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2022-11-22 00:34:12,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2022-11-22 00:34:12,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2022-11-22 00:34:12,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2022-11-22 00:34:12,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 56 remaining) [2022-11-22 00:34:12,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2022-11-22 00:34:12,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (22 of 56 remaining) [2022-11-22 00:34:12,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 56 remaining) [2022-11-22 00:34:12,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 56 remaining) [2022-11-22 00:34:12,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 56 remaining) [2022-11-22 00:34:12,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 56 remaining) [2022-11-22 00:34:12,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2022-11-22 00:34:12,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2022-11-22 00:34:12,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2022-11-22 00:34:12,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2022-11-22 00:34:12,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2022-11-22 00:34:12,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2022-11-22 00:34:12,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2022-11-22 00:34:12,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2022-11-22 00:34:12,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2022-11-22 00:34:12,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2022-11-22 00:34:12,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2022-11-22 00:34:12,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2022-11-22 00:34:12,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2022-11-22 00:34:12,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2022-11-22 00:34:12,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2022-11-22 00:34:12,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2022-11-22 00:34:12,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2022-11-22 00:34:12,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2022-11-22 00:34:12,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-22 00:34:12,416 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:12,421 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 00:34:12,422 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:34:12,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:34:12 BasicIcfg [2022-11-22 00:34:12,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:34:12,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:34:12,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:34:12,570 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:34:12,571 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:33:21" (3/4) ... [2022-11-22 00:34:12,573 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 00:34:12,574 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:34:12,574 INFO L158 Benchmark]: Toolchain (without parser) took 52643.36ms. Allocated memory was 136.3MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 88.9MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2022-11-22 00:34:12,574 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 136.3MB. Free memory was 103.0MB in the beginning and 102.9MB in the end (delta: 27.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:34:12,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.03ms. Allocated memory is still 136.3MB. Free memory was 88.9MB in the beginning and 65.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-22 00:34:12,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.18ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 65.5MB in the beginning and 149.3MB in the end (delta: -83.8MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-11-22 00:34:12,576 INFO L158 Benchmark]: Boogie Preprocessor took 39.38ms. Allocated memory is still 178.3MB. Free memory was 149.3MB in the beginning and 147.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:34:12,578 INFO L158 Benchmark]: RCFGBuilder took 1224.13ms. Allocated memory is still 178.3MB. Free memory was 147.2MB in the beginning and 69.6MB in the end (delta: 77.6MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2022-11-22 00:34:12,579 INFO L158 Benchmark]: TraceAbstraction took 50568.16ms. Allocated memory was 178.3MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 68.6MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2022-11-22 00:34:12,579 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 5.5GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:34:12,588 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.34ms. Allocated memory is still 136.3MB. Free memory was 103.0MB in the beginning and 102.9MB in the end (delta: 27.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.03ms. Allocated memory is still 136.3MB. Free memory was 88.9MB in the beginning and 65.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.18ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 65.5MB in the beginning and 149.3MB in the end (delta: -83.8MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.38ms. Allocated memory is still 178.3MB. Free memory was 149.3MB in the beginning and 147.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1224.13ms. Allocated memory is still 178.3MB. Free memory was 147.2MB in the beginning and 69.6MB in the end (delta: 77.6MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * TraceAbstraction took 50568.16ms. Allocated memory was 178.3MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 68.6MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 5.5GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.2s, 201 PlacesBefore, 82 PlacesAfterwards, 190 TransitionsBefore, 70 TransitionsAfterwards, 6364 CoEnabledTransitionPairs, 8 FixpointIterations, 78 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 174 TotalNumberOfCompositions, 21783 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10827, independent: 10386, independent conditional: 0, independent unconditional: 10386, dependent: 416, dependent conditional: 0, dependent unconditional: 416, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4287, independent: 4192, independent conditional: 0, independent unconditional: 4192, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4287, independent: 3916, independent conditional: 0, independent unconditional: 3916, dependent: 371, dependent conditional: 0, dependent unconditional: 371, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 371, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1997, independent: 1319, independent conditional: 0, independent unconditional: 1319, dependent: 544, dependent conditional: 0, dependent unconditional: 544, unknown: 133, unknown conditional: 0, unknown unconditional: 133] ], Cache Queries: [ total: 10827, independent: 6194, independent conditional: 0, independent unconditional: 6194, dependent: 327, dependent conditional: 0, dependent unconditional: 327, unknown: 4306, unknown conditional: 0, unknown unconditional: 4306] , Statistics on independence cache: Total cache size (in pairs): 649, Positive cache size: 604, Positive conditional cache size: 0, Positive unconditional cache size: 604, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2721, ((void *)0), P0, ((void *)0))=10, t2721={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t2722; [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=0, y=0, z=0] [L790] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L863] FCALL, FORK 0 pthread_create(&t2722, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2722, ((void *)0), P1, ((void *)0))=11, t2721={7:0}, t2722={8:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L802] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L864] 0 pthread_t t2723; [L865] FCALL, FORK 0 pthread_create(&t2723, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2723, ((void *)0), P2, ((void *)0))=12, t2721={7:0}, t2722={8:0}, t2723={9:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L866] 0 pthread_t t2724; [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2724, ((void *)0), P3, ((void *)0))=13, t2721={7:0}, t2722={8:0}, t2723={9:0}, t2724={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L805] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=0] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L817] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=0] [L820] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L835] 4 a = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2721={7:0}, t2722={8:0}, t2723={9:0}, t2724={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 240 locations, 56 error locations. Started 1 CEGAR loops. OverallTime: 50.1s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1886 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1886 mSDsluCounter, 884 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 660 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4284 IncrementalHoareTripleChecker+Invalid, 4575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 224 mSDtfsCounter, 4284 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46644occurred in iteration=0, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 12038 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 441 ConstructedInterpolants, 0 QuantifiedInterpolants, 6417 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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-22 00:34:12,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba --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 f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 --- 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-b5237d8 [2022-11-22 00:34:15,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:34:15,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:34:15,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:34:15,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:34:15,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:34:15,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:34:15,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:34:15,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:34:15,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:34:15,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:34:15,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:34:15,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:34:15,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:34:15,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:34:15,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:34:15,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:34:15,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:34:15,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:34:15,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:34:15,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:34:15,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:34:15,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:34:15,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:34:15,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:34:15,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:34:15,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:34:15,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:34:15,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:34:15,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:34:15,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:34:15,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:34:15,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:34:15,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:34:15,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:34:15,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:34:15,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:34:15,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:34:15,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:34:15,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:34:15,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:34:15,484 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-22 00:34:15,507 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:34:15,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:34:15,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:34:15,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:34:15,509 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:34:15,509 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:34:15,510 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:34:15,510 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:34:15,510 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:34:15,511 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:34:15,511 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:34:15,511 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:34:15,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 00:34:15,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 00:34:15,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:34:15,513 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:34:15,513 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:34:15,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:34:15,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:34:15,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:34:15,515 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 00:34:15,515 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 00:34:15,515 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 00:34:15,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:34:15,516 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 00:34:15,516 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-22 00:34:15,516 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-22 00:34:15,517 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:34:15,517 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:34:15,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:34:15,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-22 00:34:15,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:34:15,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:34:15,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:34:15,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:34:15,519 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-22 00:34:15,519 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-22 00:34:15,520 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:34:15,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-22 00:34:15,520 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_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/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_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba 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 -> f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 [2022-11-22 00:34:15,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:34:16,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:34:16,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:34:16,006 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:34:16,007 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:34:16,008 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-11-22 00:34:19,143 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:34:19,467 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:34:19,467 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-11-22 00:34:19,493 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/data/1801f4a2a/519e0cdd39a44e09909e452053a00e3a/FLAG68e122242 [2022-11-22 00:34:19,520 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/data/1801f4a2a/519e0cdd39a44e09909e452053a00e3a [2022-11-22 00:34:19,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:34:19,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:34:19,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:34:19,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:34:19,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:34:19,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:19" (1/1) ... [2022-11-22 00:34:19,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4510adaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:19, skipping insertion in model container [2022-11-22 00:34:19,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:19" (1/1) ... [2022-11-22 00:34:19,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:34:19,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:34:19,820 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-11-22 00:34:20,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:34:20,153 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:34:20,176 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-11-22 00:34:20,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:34:20,256 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:34:20,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20 WrapperNode [2022-11-22 00:34:20,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:34:20,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:34:20,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:34:20,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:34:20,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (1/1) ... [2022-11-22 00:34:20,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (1/1) ... [2022-11-22 00:34:20,330 INFO L138 Inliner]: procedures = 181, calls = 80, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 155 [2022-11-22 00:34:20,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:34:20,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:34:20,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:34:20,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:34:20,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (1/1) ... [2022-11-22 00:34:20,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (1/1) ... [2022-11-22 00:34:20,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (1/1) ... [2022-11-22 00:34:20,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (1/1) ... [2022-11-22 00:34:20,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (1/1) ... [2022-11-22 00:34:20,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (1/1) ... [2022-11-22 00:34:20,368 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (1/1) ... [2022-11-22 00:34:20,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (1/1) ... [2022-11-22 00:34:20,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:34:20,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:34:20,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:34:20,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:34:20,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (1/1) ... [2022-11-22 00:34:20,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:34:20,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:20,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:34:20,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:34:20,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-22 00:34:20,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:34:20,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:34:20,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:34:20,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:34:20,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-22 00:34:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-22 00:34:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-22 00:34:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 00:34:20,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 00:34:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 00:34:20,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 00:34:20,494 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 00:34:20,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 00:34:20,494 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-22 00:34:20,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-22 00:34:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:34:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:34:20,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:34:20,497 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:34:20,713 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:34:20,715 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:34:21,454 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:34:21,937 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:34:21,938 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:34:21,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:21 BoogieIcfgContainer [2022-11-22 00:34:21,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:34:21,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:34:21,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:34:21,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:34:21,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:34:19" (1/3) ... [2022-11-22 00:34:21,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42be5a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:21, skipping insertion in model container [2022-11-22 00:34:21,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:20" (2/3) ... [2022-11-22 00:34:21,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42be5a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:21, skipping insertion in model container [2022-11-22 00:34:21,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:21" (3/3) ... [2022-11-22 00:34:21,953 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2022-11-22 00:34:21,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:34:21,973 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-22 00:34:21,974 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:34:22,123 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 00:34:22,168 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:34:22,185 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 191 transitions, 402 flow [2022-11-22 00:34:22,190 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 191 transitions, 402 flow [2022-11-22 00:34:22,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 191 transitions, 402 flow [2022-11-22 00:34:22,327 INFO L130 PetriNetUnfolder]: 2/187 cut-off events. [2022-11-22 00:34:22,327 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 00:34:22,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 2/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 201 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-22 00:34:22,340 INFO L119 LiptonReduction]: Number of co-enabled transitions 6364 [2022-11-22 00:35:00,555 INFO L134 LiptonReduction]: Checked pairs total: 24642 [2022-11-22 00:35:00,556 INFO L136 LiptonReduction]: Total number of compositions: 177 [2022-11-22 00:35:00,564 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 70 transitions, 160 flow [2022-11-22 00:35:02,800 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:02,846 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:35:02,871 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;@424a8ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:35:02,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-11-22 00:35:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:02,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 00:35:02,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:02,999 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 00:35:03,000 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:35:03,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash 892, now seen corresponding path program 1 times [2022-11-22 00:35:03,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:35:03,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237380738] [2022-11-22 00:35:03,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:03,027 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-22 00:35:03,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:35:03,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:03,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:03,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-22 00:35:03,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:03,261 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-22 00:35:03,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:35:03,262 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:35:03,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237380738] [2022-11-22 00:35:03,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237380738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:03,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:03,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 00:35:03,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618780666] [2022-11-22 00:35:03,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:03,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 00:35:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:35:03,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 00:35:03,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:35:03,580 INFO L87 Difference]: Start difference. First operand has 46644 states, 45746 states have (on average 4.390045031259564) internal successors, (200827), 46643 states have internal predecessors, (200827), 0 states have call successors, (0), 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-22 00:35:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:04,218 INFO L93 Difference]: Finished difference Result 14108 states and 58253 transitions. [2022-11-22 00:35:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 00:35:04,221 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-22 00:35:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:04,394 INFO L225 Difference]: With dead ends: 14108 [2022-11-22 00:35:04,394 INFO L226 Difference]: Without dead ends: 14108 [2022-11-22 00:35:04,395 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-22 00:35:04,399 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:04,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14108 states. [2022-11-22 00:35:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14108 to 14108. [2022-11-22 00:35:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14108 states, 13974 states have (on average 4.168670387863174) internal successors, (58253), 14107 states have internal predecessors, (58253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 58253 transitions. [2022-11-22 00:35:05,539 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 58253 transitions. Word has length 1 [2022-11-22 00:35:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:05,539 INFO L495 AbstractCegarLoop]: Abstraction has 14108 states and 58253 transitions. [2022-11-22 00:35:05,540 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-22 00:35:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 58253 transitions. [2022-11-22 00:35:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 00:35:05,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:05,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 00:35:05,557 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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)] Ended with exit code 0 [2022-11-22 00:35:05,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:05,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:35:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash 881124, now seen corresponding path program 1 times [2022-11-22 00:35:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:35:05,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470608063] [2022-11-22 00:35:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:05,766 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-22 00:35:05,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:35:05,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:05,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:05,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:35:05,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:06,062 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 00:35:06,063 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-22 00:35:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:06,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:35:06,092 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:35:06,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470608063] [2022-11-22 00:35:06,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470608063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:06,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:06,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:35:06,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472235864] [2022-11-22 00:35:06,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:06,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:35:06,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:35:06,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:35:06,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:35:06,096 INFO L87 Difference]: Start difference. First operand 14108 states and 58253 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:06,560 INFO L93 Difference]: Finished difference Result 8861 states and 35774 transitions. [2022-11-22 00:35:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:35:06,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-22 00:35:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:06,635 INFO L225 Difference]: With dead ends: 8861 [2022-11-22 00:35:06,635 INFO L226 Difference]: Without dead ends: 8861 [2022-11-22 00:35:06,636 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-22 00:35:06,639 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:06,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8861 states. [2022-11-22 00:35:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8861 to 8861. [2022-11-22 00:35:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8861 states, 8812 states have (on average 4.059691330004539) internal successors, (35774), 8860 states have internal predecessors, (35774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8861 states to 8861 states and 35774 transitions. [2022-11-22 00:35:07,106 INFO L78 Accepts]: Start accepts. Automaton has 8861 states and 35774 transitions. Word has length 3 [2022-11-22 00:35:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:07,106 INFO L495 AbstractCegarLoop]: Abstraction has 8861 states and 35774 transitions. [2022-11-22 00:35:07,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand 8861 states and 35774 transitions. [2022-11-22 00:35:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 00:35:07,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:07,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 00:35:07,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:35:07,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:07,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:35:07,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash 881125, now seen corresponding path program 1 times [2022-11-22 00:35:07,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:35:07,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281730090] [2022-11-22 00:35:07,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:07,320 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-22 00:35:07,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:35:07,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:07,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:07,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 00:35:07,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:07,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:35:07,535 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-22 00:35:07,567 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-22 00:35:07,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:35:07,568 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:35:07,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281730090] [2022-11-22 00:35:07,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281730090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:07,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:07,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:35:07,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097749618] [2022-11-22 00:35:07,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:07,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:35:07,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:35:07,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:35:07,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:35:07,573 INFO L87 Difference]: Start difference. First operand 8861 states and 35774 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:07,929 INFO L93 Difference]: Finished difference Result 5598 states and 22127 transitions. [2022-11-22 00:35:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:35:07,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-22 00:35:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:07,966 INFO L225 Difference]: With dead ends: 5598 [2022-11-22 00:35:07,967 INFO L226 Difference]: Without dead ends: 5598 [2022-11-22 00:35:07,967 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-22 00:35:07,972 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:07,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:35:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2022-11-22 00:35:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 5598. [2022-11-22 00:35:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5598 states, 5580 states have (on average 3.965412186379928) internal successors, (22127), 5597 states have internal predecessors, (22127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 22127 transitions. [2022-11-22 00:35:08,181 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 22127 transitions. Word has length 3 [2022-11-22 00:35:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:08,182 INFO L495 AbstractCegarLoop]: Abstraction has 5598 states and 22127 transitions. [2022-11-22 00:35:08,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 22127 transitions. [2022-11-22 00:35:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:35:08,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:08,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:08,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:08,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:08,386 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:35:08,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1675537981, now seen corresponding path program 1 times [2022-11-22 00:35:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:35:08,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100734976] [2022-11-22 00:35:08,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:08,388 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-22 00:35:08,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:35:08,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:08,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:08,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:35:08,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:08,633 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-22 00:35:08,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:35:08,634 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:35:08,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100734976] [2022-11-22 00:35:08,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100734976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:08,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:08,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:35:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935894987] [2022-11-22 00:35:08,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:08,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:35:08,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:35:08,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:35:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:35:08,636 INFO L87 Difference]: Start difference. First operand 5598 states and 22127 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:09,121 INFO L93 Difference]: Finished difference Result 4028 states and 13932 transitions. [2022-11-22 00:35:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:35:09,122 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-22 00:35:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:09,155 INFO L225 Difference]: With dead ends: 4028 [2022-11-22 00:35:09,155 INFO L226 Difference]: Without dead ends: 3708 [2022-11-22 00:35:09,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:35:09,158 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:09,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:35:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2022-11-22 00:35:09,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3708. [2022-11-22 00:35:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3708 states, 3690 states have (on average 3.481842818428184) internal successors, (12848), 3707 states have internal predecessors, (12848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 12848 transitions. [2022-11-22 00:35:09,330 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 12848 transitions. Word has length 13 [2022-11-22 00:35:09,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:09,331 INFO L495 AbstractCegarLoop]: Abstraction has 3708 states and 12848 transitions. [2022-11-22 00:35:09,331 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-22 00:35:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 12848 transitions. [2022-11-22 00:35:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:35:09,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:09,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:09,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:09,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:09,553 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:35:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 99097404, now seen corresponding path program 1 times [2022-11-22 00:35:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:35:09,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771182849] [2022-11-22 00:35:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:09,555 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-22 00:35:09,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:35:09,557 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:09,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:09,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 00:35:09,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:09,839 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-22 00:35:09,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:35:09,839 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:35:09,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771182849] [2022-11-22 00:35:09,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771182849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:09,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:09,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:35:09,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117771098] [2022-11-22 00:35:09,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:09,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:35:09,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:35:09,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:35:09,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:35:09,842 INFO L87 Difference]: Start difference. First operand 3708 states and 12848 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:10,257 INFO L93 Difference]: Finished difference Result 1814 states and 5271 transitions. [2022-11-22 00:35:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:35:10,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 00:35:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:10,267 INFO L225 Difference]: With dead ends: 1814 [2022-11-22 00:35:10,267 INFO L226 Difference]: Without dead ends: 1602 [2022-11-22 00:35:10,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:35:10,268 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:10,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 52 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:35:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2022-11-22 00:35:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1602. [2022-11-22 00:35:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1584 states have (on average 2.898989898989899) internal successors, (4592), 1601 states have internal predecessors, (4592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 4592 transitions. [2022-11-22 00:35:10,324 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 4592 transitions. Word has length 16 [2022-11-22 00:35:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:10,324 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 4592 transitions. [2022-11-22 00:35:10,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 4592 transitions. [2022-11-22 00:35:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:35:10,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:10,329 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-22 00:35:10,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-11-22 00:35:10,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:10,542 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:35:10,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2122086181, now seen corresponding path program 1 times [2022-11-22 00:35:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:35:10,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918739356] [2022-11-22 00:35:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:10,543 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-22 00:35:10,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:35:10,544 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:10,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:10,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 00:35:10,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:10,881 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-22 00:35:10,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:35:10,882 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:35:10,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918739356] [2022-11-22 00:35:10,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918739356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:10,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:10,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:35:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228823250] [2022-11-22 00:35:10,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:10,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:35:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:35:10,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:35:10,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:35:10,885 INFO L87 Difference]: Start difference. First operand 1602 states and 4592 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:11,434 INFO L93 Difference]: Finished difference Result 815 states and 2257 transitions. [2022-11-22 00:35:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:35:11,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-22 00:35:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:11,438 INFO L225 Difference]: With dead ends: 815 [2022-11-22 00:35:11,439 INFO L226 Difference]: Without dead ends: 738 [2022-11-22 00:35:11,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:35:11,440 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 65 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:11,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 93 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:35:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-11-22 00:35:11,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2022-11-22 00:35:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 726 states have (on average 2.830578512396694) internal successors, (2055), 737 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2055 transitions. [2022-11-22 00:35:11,465 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2055 transitions. Word has length 19 [2022-11-22 00:35:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:11,466 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 2055 transitions. [2022-11-22 00:35:11,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2055 transitions. [2022-11-22 00:35:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:35:11,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:11,474 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-22 00:35:11,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:11,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:11,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:35:11,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1476321387, now seen corresponding path program 1 times [2022-11-22 00:35:11,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:35:11,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310441243] [2022-11-22 00:35:11,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:11,680 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-22 00:35:11,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:35:11,704 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:11,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:11,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 00:35:11,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:12,039 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-22 00:35:12,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:35:12,040 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:35:12,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310441243] [2022-11-22 00:35:12,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310441243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:12,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:12,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:35:12,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106870177] [2022-11-22 00:35:12,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:12,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:35:12,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:35:12,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:35:12,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:35:12,043 INFO L87 Difference]: Start difference. First operand 738 states and 2055 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:12,687 INFO L93 Difference]: Finished difference Result 598 states and 1779 transitions. [2022-11-22 00:35:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:35:12,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:35:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:12,689 INFO L225 Difference]: With dead ends: 598 [2022-11-22 00:35:12,690 INFO L226 Difference]: Without dead ends: 584 [2022-11-22 00:35:12,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:35:12,691 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 62 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:12,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 131 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:35:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-11-22 00:35:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-11-22 00:35:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 580 states have (on average 3.0224137931034485) internal successors, (1753), 583 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1753 transitions. [2022-11-22 00:35:12,711 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1753 transitions. Word has length 22 [2022-11-22 00:35:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:12,711 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 1753 transitions. [2022-11-22 00:35:12,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1753 transitions. [2022-11-22 00:35:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-22 00:35:12,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:12,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:12,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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)] Ended with exit code 0 [2022-11-22 00:35:12,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:12,926 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:35:12,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:12,927 INFO L85 PathProgramCache]: Analyzing trace with hash -330037304, now seen corresponding path program 1 times [2022-11-22 00:35:12,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:35:12,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41445557] [2022-11-22 00:35:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:12,928 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-22 00:35:12,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:35:12,929 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:12,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:13,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:35:13,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:14,146 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 72 treesize of output 68 [2022-11-22 00:35:14,167 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-22 00:35:14,174 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-22 00:35:14,249 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-22 00:35:14,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:35:14,250 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:35:14,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41445557] [2022-11-22 00:35:14,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41445557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:14,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:14,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:35:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269789232] [2022-11-22 00:35:14,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:14,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:35:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:35:14,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:35:14,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:35:14,252 INFO L87 Difference]: Start difference. First operand 584 states and 1753 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:14,452 INFO L93 Difference]: Finished difference Result 583 states and 1752 transitions. [2022-11-22 00:35:14,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:35:14,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-22 00:35:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:14,455 INFO L225 Difference]: With dead ends: 583 [2022-11-22 00:35:14,455 INFO L226 Difference]: Without dead ends: 583 [2022-11-22 00:35:14,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-22 00:35:14,456 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:14,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-11-22 00:35:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2022-11-22 00:35:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 580 states have (on average 3.0206896551724136) internal successors, (1752), 582 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1752 transitions. [2022-11-22 00:35:14,475 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 1752 transitions. Word has length 26 [2022-11-22 00:35:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:14,476 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 1752 transitions. [2022-11-22 00:35:14,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1752 transitions. [2022-11-22 00:35:14,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-22 00:35:14,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:14,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:14,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:14,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:14,692 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:35:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash -330037307, now seen corresponding path program 1 times [2022-11-22 00:35:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:35:14,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21427272] [2022-11-22 00:35:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:14,694 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-22 00:35:14,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:35:14,695 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:14,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:14,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:35:14,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:15,828 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 72 treesize of output 68 [2022-11-22 00:35:15,842 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-22 00:35:15,858 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-22 00:35:15,867 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:35:15,869 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:35:16,068 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-22 00:35:16,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:35:16,069 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:35:16,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21427272] [2022-11-22 00:35:16,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21427272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:16,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:16,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:35:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258033404] [2022-11-22 00:35:16,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:16,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:35:16,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:35:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:35:16,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:35:16,072 INFO L87 Difference]: Start difference. First operand 583 states and 1752 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:16,320 INFO L93 Difference]: Finished difference Result 582 states and 1751 transitions. [2022-11-22 00:35:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:35:16,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-22 00:35:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:16,323 INFO L225 Difference]: With dead ends: 582 [2022-11-22 00:35:16,323 INFO L226 Difference]: Without dead ends: 582 [2022-11-22 00:35:16,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:35:16,324 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:16,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 13 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-22 00:35:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2022-11-22 00:35:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 580 states have (on average 3.018965517241379) internal successors, (1751), 581 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1751 transitions. [2022-11-22 00:35:16,346 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1751 transitions. Word has length 26 [2022-11-22 00:35:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:16,348 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 1751 transitions. [2022-11-22 00:35:16,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1751 transitions. [2022-11-22 00:35:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-22 00:35:16,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:16,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:16,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:16,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:16,564 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-22 00:35:16,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:16,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1641221038, now seen corresponding path program 1 times [2022-11-22 00:35:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:35:16,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703039485] [2022-11-22 00:35:16,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:16,567 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-22 00:35:16,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:35:16,568 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:16,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:35:16,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 00:35:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:35:17,173 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-22 00:35:17,186 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 00:35:17,188 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (55 of 56 remaining) [2022-11-22 00:35:17,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2022-11-22 00:35:17,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2022-11-22 00:35:17,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2022-11-22 00:35:17,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2022-11-22 00:35:17,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2022-11-22 00:35:17,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2022-11-22 00:35:17,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2022-11-22 00:35:17,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2022-11-22 00:35:17,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2022-11-22 00:35:17,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2022-11-22 00:35:17,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2022-11-22 00:35:17,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2022-11-22 00:35:17,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2022-11-22 00:35:17,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2022-11-22 00:35:17,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2022-11-22 00:35:17,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2022-11-22 00:35:17,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2022-11-22 00:35:17,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2022-11-22 00:35:17,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2022-11-22 00:35:17,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2022-11-22 00:35:17,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2022-11-22 00:35:17,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2022-11-22 00:35:17,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2022-11-22 00:35:17,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2022-11-22 00:35:17,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2022-11-22 00:35:17,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2022-11-22 00:35:17,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2022-11-22 00:35:17,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2022-11-22 00:35:17,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2022-11-22 00:35:17,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2022-11-22 00:35:17,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 56 remaining) [2022-11-22 00:35:17,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2022-11-22 00:35:17,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (22 of 56 remaining) [2022-11-22 00:35:17,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 56 remaining) [2022-11-22 00:35:17,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 56 remaining) [2022-11-22 00:35:17,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 56 remaining) [2022-11-22 00:35:17,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 56 remaining) [2022-11-22 00:35:17,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2022-11-22 00:35:17,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2022-11-22 00:35:17,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2022-11-22 00:35:17,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2022-11-22 00:35:17,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2022-11-22 00:35:17,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2022-11-22 00:35:17,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2022-11-22 00:35:17,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2022-11-22 00:35:17,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2022-11-22 00:35:17,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2022-11-22 00:35:17,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2022-11-22 00:35:17,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2022-11-22 00:35:17,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2022-11-22 00:35:17,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2022-11-22 00:35:17,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2022-11-22 00:35:17,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2022-11-22 00:35:17,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2022-11-22 00:35:17,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2022-11-22 00:35:17,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:17,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/mathsat -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-22 00:35:17,417 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:17,423 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 00:35:17,423 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:35:17,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:35:17 BasicIcfg [2022-11-22 00:35:17,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:35:17,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:35:17,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:35:17,613 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:35:17,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:21" (3/4) ... [2022-11-22 00:35:17,616 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 00:35:17,617 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:35:17,617 INFO L158 Benchmark]: Toolchain (without parser) took 58091.15ms. Allocated memory was 77.6MB in the beginning and 4.5GB in the end (delta: 4.5GB). Free memory was 57.0MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-22 00:35:17,618 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 77.6MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:35:17,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.23ms. Allocated memory is still 77.6MB. Free memory was 56.7MB in the beginning and 32.9MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-22 00:35:17,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.07ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 32.6MB in the beginning and 76.4MB in the end (delta: -43.8MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2022-11-22 00:35:17,619 INFO L158 Benchmark]: Boogie Preprocessor took 42.95ms. Allocated memory is still 98.6MB. Free memory was 76.4MB in the beginning and 74.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:35:17,619 INFO L158 Benchmark]: RCFGBuilder took 1566.34ms. Allocated memory is still 98.6MB. Free memory was 73.8MB in the beginning and 42.3MB in the end (delta: 31.5MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2022-11-22 00:35:17,620 INFO L158 Benchmark]: TraceAbstraction took 55668.78ms. Allocated memory was 98.6MB in the beginning and 4.5GB in the end (delta: 4.5GB). Free memory was 41.5MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-22 00:35:17,621 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 4.5GB. Free memory is still 3.1GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:35:17,625 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 77.6MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.23ms. Allocated memory is still 77.6MB. Free memory was 56.7MB in the beginning and 32.9MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.07ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 32.6MB in the beginning and 76.4MB in the end (delta: -43.8MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.95ms. Allocated memory is still 98.6MB. Free memory was 76.4MB in the beginning and 74.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1566.34ms. Allocated memory is still 98.6MB. Free memory was 73.8MB in the beginning and 42.3MB in the end (delta: 31.5MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * TraceAbstraction took 55668.78ms. Allocated memory was 98.6MB in the beginning and 4.5GB in the end (delta: 4.5GB). Free memory was 41.5MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 4.5GB. Free memory is still 3.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: 38.4s, 202 PlacesBefore, 82 PlacesAfterwards, 191 TransitionsBefore, 70 TransitionsAfterwards, 6364 CoEnabledTransitionPairs, 9 FixpointIterations, 75 TrivialSequentialCompositions, 95 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 177 TotalNumberOfCompositions, 24642 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11179, independent: 10666, independent conditional: 0, independent unconditional: 10666, dependent: 444, dependent conditional: 0, dependent unconditional: 444, unknown: 69, unknown conditional: 0, unknown unconditional: 69] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4359, independent: 4262, independent conditional: 0, independent unconditional: 4262, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4359, independent: 4007, independent conditional: 0, independent unconditional: 4007, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 352, independent: 255, independent conditional: 0, independent unconditional: 255, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3179, independent: 1635, independent conditional: 0, independent unconditional: 1635, dependent: 1195, dependent conditional: 0, dependent unconditional: 1195, unknown: 349, unknown conditional: 0, unknown unconditional: 349] ], Cache Queries: [ total: 11179, independent: 6404, independent conditional: 0, independent unconditional: 6404, dependent: 356, dependent conditional: 0, dependent unconditional: 356, unknown: 4419, unknown conditional: 0, unknown unconditional: 4419] , Statistics on independence cache: Total cache size (in pairs): 617, Positive cache size: 576, Positive conditional cache size: 0, Positive unconditional cache size: 576, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 4, Unknown conditional cache size: 0, Unknown unconditional cache size: 4 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2721, ((void *)0), P0, ((void *)0))=-1, t2721={1073741826:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] EXPR 1 \read(a) [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L790] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L862] 0 pthread_t t2722; [L863] FCALL, FORK 0 pthread_create(&t2722, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2722, ((void *)0), P1, ((void *)0))=0, t2721={1073741826:0}, t2722={-2147483646:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L805] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L864] 0 pthread_t t2723; [L865] FCALL, FORK 0 pthread_create(&t2723, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2723, ((void *)0), P2, ((void *)0))=1, t2721={1073741826:0}, t2722={-2147483646:0}, t2723={6:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L817] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L866] 0 pthread_t t2724; [L820] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2724, ((void *)0), P3, ((void *)0))=2, t2721={1073741826:0}, t2722={-2147483646:0}, t2723={6:0}, t2724={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 a = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2721={1073741826:0}, t2722={-2147483646:0}, t2723={6:0}, t2724={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=128, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 241 locations, 56 error locations. Started 1 CEGAR loops. OverallTime: 55.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 40.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 349 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 242 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1291 IncrementalHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 107 mSDtfsCounter, 1291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46644occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1325 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-22 00:35:17,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffa006db-45e3-44ab-a9f4-b85bba816197/bin/utaipan-g80aRyZoba/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