./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 09aaf4da9760e082dee1b84490861799ac10c7d3871bbdf2d8243e88d9e00b49 --- 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:24:16,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:24:16,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:24:16,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:24:16,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:24:16,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:24:16,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:24:16,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:24:16,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:24:16,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:24:16,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:24:16,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:24:16,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:24:16,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:24:16,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:24:16,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:24:16,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:24:16,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:24:16,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:24:16,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:24:16,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:24:16,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:24:16,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:24:16,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:24:16,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:24:16,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:24:16,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:24:16,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:24:16,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:24:16,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:24:16,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:24:16,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:24:16,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:24:16,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:24:16,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:24:16,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:24:16,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:24:16,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:24:16,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:24:16,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:24:16,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:24:16,306 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 00:24:16,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:24:16,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:24:16,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:24:16,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:24:16,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:24:16,364 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:24:16,364 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:24:16,364 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:24:16,365 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:24:16,365 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:24:16,366 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:24:16,366 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:24:16,366 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:24:16,366 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:24:16,367 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:24:16,367 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:24:16,367 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:24:16,367 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:24:16,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 00:24:16,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 00:24:16,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:24:16,369 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:24:16,369 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:24:16,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:24:16,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:24:16,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:24:16,370 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 00:24:16,370 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 00:24:16,370 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 00:24:16,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:24:16,371 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 00:24:16,371 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:24:16,371 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:24:16,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:24:16,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:24:16,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:24:16,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:24:16,372 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:24:16,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:24:16,373 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:24:16,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:24:16,373 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:24:16,374 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_ceda874c-f76a-4cf6-a07b-dbd63d259680/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_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 -> 09aaf4da9760e082dee1b84490861799ac10c7d3871bbdf2d8243e88d9e00b49 [2022-11-22 00:24:16,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:24:16,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:24:16,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:24:16,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:24:16,662 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:24:16,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i [2022-11-22 00:24:19,734 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:24:19,982 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:24:19,983 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i [2022-11-22 00:24:20,017 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/data/a6d1daa20/d3ec5a9264d440a4a5035cdc6b5bb9e5/FLAG3638981eb [2022-11-22 00:24:20,030 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/data/a6d1daa20/d3ec5a9264d440a4a5035cdc6b5bb9e5 [2022-11-22 00:24:20,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:24:20,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:24:20,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:24:20,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:24:20,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:24:20,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:24:20" (1/1) ... [2022-11-22 00:24:20,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50caf15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20, skipping insertion in model container [2022-11-22 00:24:20,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:24:20" (1/1) ... [2022-11-22 00:24:20,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:24:20,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:24:20,270 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_ceda874c-f76a-4cf6-a07b-dbd63d259680/sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i[992,1005] [2022-11-22 00:24:20,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:24:20,623 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:24:20,639 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_ceda874c-f76a-4cf6-a07b-dbd63d259680/sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i[992,1005] [2022-11-22 00:24:20,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:24:20,741 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:24:20,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20 WrapperNode [2022-11-22 00:24:20,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:24:20,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:24:20,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:24:20,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:24:20,751 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:24:20" (1/1) ... [2022-11-22 00:24:20,768 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:24:20" (1/1) ... [2022-11-22 00:24:20,794 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-11-22 00:24:20,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:24:20,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:24:20,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:24:20,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:24:20,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20" (1/1) ... [2022-11-22 00:24:20,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20" (1/1) ... [2022-11-22 00:24:20,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20" (1/1) ... [2022-11-22 00:24:20,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20" (1/1) ... [2022-11-22 00:24:20,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20" (1/1) ... [2022-11-22 00:24:20,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20" (1/1) ... [2022-11-22 00:24:20,825 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20" (1/1) ... [2022-11-22 00:24:20,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20" (1/1) ... [2022-11-22 00:24:20,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:24:20,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:24:20,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:24:20,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:24:20,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20" (1/1) ... [2022-11-22 00:24:20,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:24:20,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:24:20,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:24:20,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:24:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:24:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:24:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:24:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:24:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:24:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:24:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 00:24:20,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 00:24:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 00:24:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 00:24:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 00:24:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 00:24:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:24:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:24:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:24:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:24:20,943 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:24:21,171 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:24:21,174 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:24:21,977 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:24:22,697 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:24:22,697 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:24:22,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:24:22 BoogieIcfgContainer [2022-11-22 00:24:22,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:24:22,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:24:22,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:24:22,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:24:22,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:24:20" (1/3) ... [2022-11-22 00:24:22,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd617c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:24:22, skipping insertion in model container [2022-11-22 00:24:22,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:20" (2/3) ... [2022-11-22 00:24:22,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd617c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:24:22, skipping insertion in model container [2022-11-22 00:24:22,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:24:22" (3/3) ... [2022-11-22 00:24:22,715 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.opt.i [2022-11-22 00:24:22,735 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:24:22,735 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-11-22 00:24:22,735 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:24:22,886 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 00:24:22,927 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:24:22,946 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 196 transitions, 407 flow [2022-11-22 00:24:22,950 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 196 transitions, 407 flow [2022-11-22 00:24:22,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 196 transitions, 407 flow [2022-11-22 00:24:23,079 INFO L130 PetriNetUnfolder]: 2/193 cut-off events. [2022-11-22 00:24:23,079 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 00:24:23,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 2/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-11-22 00:24:23,090 INFO L119 LiptonReduction]: Number of co-enabled transitions 9024 [2022-11-22 00:24:57,715 INFO L134 LiptonReduction]: Checked pairs total: 44672 [2022-11-22 00:24:57,715 INFO L136 LiptonReduction]: Total number of compositions: 196 [2022-11-22 00:24:57,724 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 100 places, 91 transitions, 197 flow [2022-11-22 00:25:01,538 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 0 states 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:25:01,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:25:01,569 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;@988ab42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:25:01,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2022-11-22 00:25:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 0 states 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:25:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 00:25:01,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:01,678 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 00:25:01,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:01,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1228, now seen corresponding path program 1 times [2022-11-22 00:25:01,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:01,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598558053] [2022-11-22 00:25:01,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:01,854 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:25:01,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:01,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598558053] [2022-11-22 00:25:01,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598558053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:01,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:01,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 00:25:01,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888935564] [2022-11-22 00:25:01,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:01,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 00:25:01,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:01,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 00:25:01,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:25:02,046 INFO L87 Difference]: Start difference. First operand has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 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:25:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:02,490 INFO L93 Difference]: Finished difference Result 14832 states and 53255 transitions. [2022-11-22 00:25:02,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 00:25:02,493 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:25:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:02,986 INFO L225 Difference]: With dead ends: 14832 [2022-11-22 00:25:02,986 INFO L226 Difference]: Without dead ends: 14832 [2022-11-22 00:25:03,004 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:25:03,008 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:03,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:25:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14832 states. [2022-11-22 00:25:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14832 to 14832. [2022-11-22 00:25:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14832 states, 12754 states have (on average 4.175552767759134) internal successors, (53255), 14831 states have internal predecessors, (53255), 0 states have call successors, (0), 0 states 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:25:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14832 states to 14832 states and 53255 transitions. [2022-11-22 00:25:04,545 INFO L78 Accepts]: Start accepts. Automaton has 14832 states and 53255 transitions. Word has length 1 [2022-11-22 00:25:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:04,545 INFO L495 AbstractCegarLoop]: Abstraction has 14832 states and 53255 transitions. [2022-11-22 00:25:04,545 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:25:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 14832 states and 53255 transitions. [2022-11-22 00:25:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 00:25:04,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:04,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 00:25:04,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:25:04,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:04,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash 37550221, now seen corresponding path program 1 times [2022-11-22 00:25:04,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:04,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230980356] [2022-11-22 00:25:04,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:04,944 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:25:04,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:04,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230980356] [2022-11-22 00:25:04,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230980356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:04,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:04,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:25:04,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701481403] [2022-11-22 00:25:04,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:04,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:25:04,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:04,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:25:04,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:25:04,948 INFO L87 Difference]: Start difference. First operand 14832 states and 53255 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:05,236 INFO L93 Difference]: Finished difference Result 5184 states and 17962 transitions. [2022-11-22 00:25:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:25:05,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-22 00:25:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:05,265 INFO L225 Difference]: With dead ends: 5184 [2022-11-22 00:25:05,265 INFO L226 Difference]: Without dead ends: 5184 [2022-11-22 00:25:05,265 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:25:05,266 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:05,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:25:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5184 states. [2022-11-22 00:25:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5184 to 5184. [2022-11-22 00:25:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 4865 states have (on average 3.692086330935252) internal successors, (17962), 5183 states have internal predecessors, (17962), 0 states have call successors, (0), 0 states 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:25:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 17962 transitions. [2022-11-22 00:25:05,655 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 17962 transitions. Word has length 4 [2022-11-22 00:25:05,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:05,655 INFO L495 AbstractCegarLoop]: Abstraction has 5184 states and 17962 transitions. [2022-11-22 00:25:05,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 17962 transitions. [2022-11-22 00:25:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 00:25:05,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:05,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 00:25:05,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:25:05,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:05,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:05,657 INFO L85 PathProgramCache]: Analyzing trace with hash 37550220, now seen corresponding path program 1 times [2022-11-22 00:25:05,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:05,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144634355] [2022-11-22 00:25:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:05,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:05,780 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:25:05,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:05,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144634355] [2022-11-22 00:25:05,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144634355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:05,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:05,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:25:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790098701] [2022-11-22 00:25:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:05,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:25:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:05,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:25:05,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:25:05,785 INFO L87 Difference]: Start difference. First operand 5184 states and 17962 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:05,960 INFO L93 Difference]: Finished difference Result 3398 states and 10085 transitions. [2022-11-22 00:25:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:25:05,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-22 00:25:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:05,974 INFO L225 Difference]: With dead ends: 3398 [2022-11-22 00:25:05,975 INFO L226 Difference]: Without dead ends: 3308 [2022-11-22 00:25:05,975 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:25:05,976 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:05,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:25:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2022-11-22 00:25:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3004. [2022-11-22 00:25:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 2922 states have (on average 3.1830937713894594) internal successors, (9301), 3003 states have internal predecessors, (9301), 0 states have call successors, (0), 0 states 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:25:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 9301 transitions. [2022-11-22 00:25:06,081 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 9301 transitions. Word has length 4 [2022-11-22 00:25:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:06,081 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 9301 transitions. [2022-11-22 00:25:06,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 9301 transitions. [2022-11-22 00:25:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:25:06,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:06,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:06,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:25:06,083 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1487711725, now seen corresponding path program 1 times [2022-11-22 00:25:06,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:06,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352414687] [2022-11-22 00:25:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:06,367 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:25:06,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:06,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352414687] [2022-11-22 00:25:06,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352414687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:06,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:06,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:25:06,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211224192] [2022-11-22 00:25:06,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:06,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:25:06,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:06,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:25:06,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:25:06,370 INFO L87 Difference]: Start difference. First operand 3004 states and 9301 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:06,558 INFO L93 Difference]: Finished difference Result 2964 states and 9159 transitions. [2022-11-22 00:25:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:25:06,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 00:25:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:06,574 INFO L225 Difference]: With dead ends: 2964 [2022-11-22 00:25:06,574 INFO L226 Difference]: Without dead ends: 2964 [2022-11-22 00:25:06,575 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:25:06,575 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:06,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:25:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2022-11-22 00:25:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2964. [2022-11-22 00:25:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2882 states have (on average 3.178001387925052) internal successors, (9159), 2963 states have internal predecessors, (9159), 0 states have call successors, (0), 0 states 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:25:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 9159 transitions. [2022-11-22 00:25:06,700 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 9159 transitions. Word has length 11 [2022-11-22 00:25:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:06,701 INFO L495 AbstractCegarLoop]: Abstraction has 2964 states and 9159 transitions. [2022-11-22 00:25:06,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:06,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 9159 transitions. [2022-11-22 00:25:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:25:06,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:06,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:06,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:25:06,706 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:06,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:06,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1487712111, now seen corresponding path program 1 times [2022-11-22 00:25:06,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:06,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499932426] [2022-11-22 00:25:06,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:06,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:07,832 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:25:07,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:07,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499932426] [2022-11-22 00:25:07,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499932426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:07,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:07,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:25:07,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438220326] [2022-11-22 00:25:07,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:07,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:25:07,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:07,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:25:07,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:25:07,839 INFO L87 Difference]: Start difference. First operand 2964 states and 9159 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:08,039 INFO L93 Difference]: Finished difference Result 2959 states and 9140 transitions. [2022-11-22 00:25:08,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:25:08,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 00:25:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:08,053 INFO L225 Difference]: With dead ends: 2959 [2022-11-22 00:25:08,053 INFO L226 Difference]: Without dead ends: 2959 [2022-11-22 00:25:08,054 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:25:08,055 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:08,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:25:08,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2022-11-22 00:25:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2959. [2022-11-22 00:25:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2877 states have (on average 3.1769204031977756) internal successors, (9140), 2958 states have internal predecessors, (9140), 0 states have call successors, (0), 0 states 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:25:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 9140 transitions. [2022-11-22 00:25:08,144 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 9140 transitions. Word has length 11 [2022-11-22 00:25:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:08,144 INFO L495 AbstractCegarLoop]: Abstraction has 2959 states and 9140 transitions. [2022-11-22 00:25:08,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 9140 transitions. [2022-11-22 00:25:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:25:08,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:08,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:08,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:25:08,152 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1262300375, now seen corresponding path program 1 times [2022-11-22 00:25:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:08,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441049517] [2022-11-22 00:25:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:09,186 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:25:09,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:09,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441049517] [2022-11-22 00:25:09,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441049517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:09,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:09,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:25:09,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159599610] [2022-11-22 00:25:09,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:09,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:25:09,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:09,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:25:09,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:25:09,190 INFO L87 Difference]: Start difference. First operand 2959 states and 9140 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:09,445 INFO L93 Difference]: Finished difference Result 2944 states and 9088 transitions. [2022-11-22 00:25:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:25:09,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 00:25:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:09,458 INFO L225 Difference]: With dead ends: 2944 [2022-11-22 00:25:09,458 INFO L226 Difference]: Without dead ends: 2944 [2022-11-22 00:25:09,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:25:09,459 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 59 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:09,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 11 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:25:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2022-11-22 00:25:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2944. [2022-11-22 00:25:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2862 states have (on average 3.175401816911251) internal successors, (9088), 2943 states have internal predecessors, (9088), 0 states have call successors, (0), 0 states 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:25:09,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 9088 transitions. [2022-11-22 00:25:09,542 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 9088 transitions. Word has length 12 [2022-11-22 00:25:09,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:09,543 INFO L495 AbstractCegarLoop]: Abstraction has 2944 states and 9088 transitions. [2022-11-22 00:25:09,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 9088 transitions. [2022-11-22 00:25:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:25:09,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:09,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:09,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:25:09,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:09,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:09,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1128272236, now seen corresponding path program 1 times [2022-11-22 00:25:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:09,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753254875] [2022-11-22 00:25:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:09,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:09,714 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:25:09,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:09,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753254875] [2022-11-22 00:25:09,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753254875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:09,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:09,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:25:09,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498356817] [2022-11-22 00:25:09,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:09,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:25:09,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:09,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:25:09,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:25:09,719 INFO L87 Difference]: Start difference. First operand 2944 states and 9088 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:09,920 INFO L93 Difference]: Finished difference Result 3388 states and 10162 transitions. [2022-11-22 00:25:09,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:25:09,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 00:25:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:09,934 INFO L225 Difference]: With dead ends: 3388 [2022-11-22 00:25:09,935 INFO L226 Difference]: Without dead ends: 3388 [2022-11-22 00:25:09,935 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:25:09,936 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:09,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:25:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2022-11-22 00:25:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 2864. [2022-11-22 00:25:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2864 states, 2783 states have (on average 3.170679123248293) internal successors, (8824), 2863 states have internal predecessors, (8824), 0 states have call successors, (0), 0 states 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:25:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 8824 transitions. [2022-11-22 00:25:10,013 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 8824 transitions. Word has length 12 [2022-11-22 00:25:10,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:10,014 INFO L495 AbstractCegarLoop]: Abstraction has 2864 states and 8824 transitions. [2022-11-22 00:25:10,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 8824 transitions. [2022-11-22 00:25:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:25:10,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:10,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:10,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:25:10,015 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1128272235, now seen corresponding path program 1 times [2022-11-22 00:25:10,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:10,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132774528] [2022-11-22 00:25:10,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:10,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:10,265 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:25:10,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:10,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132774528] [2022-11-22 00:25:10,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132774528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:10,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:10,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:25:10,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030258793] [2022-11-22 00:25:10,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:10,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:25:10,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:10,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:25:10,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:25:10,268 INFO L87 Difference]: Start difference. First operand 2864 states and 8824 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:10,447 INFO L93 Difference]: Finished difference Result 2784 states and 8560 transitions. [2022-11-22 00:25:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:25:10,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 00:25:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:10,459 INFO L225 Difference]: With dead ends: 2784 [2022-11-22 00:25:10,459 INFO L226 Difference]: Without dead ends: 2784 [2022-11-22 00:25:10,459 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:25:10,461 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:10,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 2 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:25:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2022-11-22 00:25:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2022-11-22 00:25:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2704 states have (on average 3.165680473372781) internal successors, (8560), 2783 states have internal predecessors, (8560), 0 states have call successors, (0), 0 states 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:25:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 8560 transitions. [2022-11-22 00:25:10,530 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 8560 transitions. Word has length 12 [2022-11-22 00:25:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:10,531 INFO L495 AbstractCegarLoop]: Abstraction has 2784 states and 8560 transitions. [2022-11-22 00:25:10,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 8560 transitions. [2022-11-22 00:25:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:25:10,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:10,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:10,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:25:10,533 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:10,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1128271850, now seen corresponding path program 1 times [2022-11-22 00:25:10,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:10,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879187477] [2022-11-22 00:25:10,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:10,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:11,278 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:25:11,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:11,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879187477] [2022-11-22 00:25:11,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879187477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:11,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:11,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:25:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363492082] [2022-11-22 00:25:11,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:11,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:25:11,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:25:11,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:25:11,281 INFO L87 Difference]: Start difference. First operand 2784 states and 8560 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:11,489 INFO L93 Difference]: Finished difference Result 2764 states and 8489 transitions. [2022-11-22 00:25:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:25:11,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 00:25:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:11,503 INFO L225 Difference]: With dead ends: 2764 [2022-11-22 00:25:11,504 INFO L226 Difference]: Without dead ends: 2764 [2022-11-22 00:25:11,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:25:11,505 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 40 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:11,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 10 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:25:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2022-11-22 00:25:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2022-11-22 00:25:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2684 states have (on average 3.162816691505216) internal successors, (8489), 2763 states have internal predecessors, (8489), 0 states have call successors, (0), 0 states 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:25:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 8489 transitions. [2022-11-22 00:25:11,601 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 8489 transitions. Word has length 12 [2022-11-22 00:25:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:11,602 INFO L495 AbstractCegarLoop]: Abstraction has 2764 states and 8489 transitions. [2022-11-22 00:25:11,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 8489 transitions. [2022-11-22 00:25:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:25:11,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:11,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:11,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:25:11,604 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:11,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash -479312996, now seen corresponding path program 1 times [2022-11-22 00:25:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:11,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151888709] [2022-11-22 00:25:11,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:25:12,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:12,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151888709] [2022-11-22 00:25:12,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151888709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:12,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:12,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:25:12,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938848486] [2022-11-22 00:25:12,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:12,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:25:12,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:12,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:25:12,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:25:12,113 INFO L87 Difference]: Start difference. First operand 2764 states and 8489 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:12,388 INFO L93 Difference]: Finished difference Result 3968 states and 12081 transitions. [2022-11-22 00:25:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:25:12,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 00:25:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:12,406 INFO L225 Difference]: With dead ends: 3968 [2022-11-22 00:25:12,406 INFO L226 Difference]: Without dead ends: 3968 [2022-11-22 00:25:12,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:25:12,407 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 108 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:12,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 11 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:25:12,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2022-11-22 00:25:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 2884. [2022-11-22 00:25:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2804 states have (on average 3.159771754636234) internal successors, (8860), 2883 states have internal predecessors, (8860), 0 states have call successors, (0), 0 states 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:25:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 8860 transitions. [2022-11-22 00:25:12,494 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 8860 transitions. Word has length 13 [2022-11-22 00:25:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:12,494 INFO L495 AbstractCegarLoop]: Abstraction has 2884 states and 8860 transitions. [2022-11-22 00:25:12,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 8860 transitions. [2022-11-22 00:25:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:25:12,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:12,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:12,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:25:12,496 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash -532748541, now seen corresponding path program 1 times [2022-11-22 00:25:12,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:12,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872507782] [2022-11-22 00:25:12,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:12,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:12,657 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:25:12,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:12,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872507782] [2022-11-22 00:25:12,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872507782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:12,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:12,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:25:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595873604] [2022-11-22 00:25:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:12,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:25:12,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:12,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:25:12,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:25:12,659 INFO L87 Difference]: Start difference. First operand 2884 states and 8860 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:12,818 INFO L93 Difference]: Finished difference Result 2718 states and 7896 transitions. [2022-11-22 00:25:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:25:12,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 00:25:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:12,829 INFO L225 Difference]: With dead ends: 2718 [2022-11-22 00:25:12,829 INFO L226 Difference]: Without dead ends: 2718 [2022-11-22 00:25:12,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:25:12,830 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:12,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 5 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:25:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2022-11-22 00:25:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2402. [2022-11-22 00:25:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2402 states, 2322 states have (on average 3.128337639965547) internal successors, (7264), 2401 states have internal predecessors, (7264), 0 states have call successors, (0), 0 states 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:25:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 7264 transitions. [2022-11-22 00:25:12,895 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 7264 transitions. Word has length 13 [2022-11-22 00:25:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:12,896 INFO L495 AbstractCegarLoop]: Abstraction has 2402 states and 7264 transitions. [2022-11-22 00:25:12,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 7264 transitions. [2022-11-22 00:25:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:25:12,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:12,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:12,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 00:25:12,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:12,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:12,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2093586990, now seen corresponding path program 1 times [2022-11-22 00:25:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:12,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386046716] [2022-11-22 00:25:12,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:14,927 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:25:14,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:14,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386046716] [2022-11-22 00:25:14,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386046716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:14,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:14,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:25:14,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721472406] [2022-11-22 00:25:14,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:14,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:25:14,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:14,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:25:14,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:25:14,930 INFO L87 Difference]: Start difference. First operand 2402 states and 7264 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:25:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:15,269 INFO L93 Difference]: Finished difference Result 2348 states and 7096 transitions. [2022-11-22 00:25:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:25:15,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:25:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:15,281 INFO L225 Difference]: With dead ends: 2348 [2022-11-22 00:25:15,282 INFO L226 Difference]: Without dead ends: 2348 [2022-11-22 00:25:15,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:25:15,283 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 79 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:15,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 7 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:25:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2022-11-22 00:25:15,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2348. [2022-11-22 00:25:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2272 states have (on average 3.1232394366197185) internal successors, (7096), 2347 states have internal predecessors, (7096), 0 states have call successors, (0), 0 states 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:25:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 7096 transitions. [2022-11-22 00:25:15,362 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 7096 transitions. Word has length 14 [2022-11-22 00:25:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:15,363 INFO L495 AbstractCegarLoop]: Abstraction has 2348 states and 7096 transitions. [2022-11-22 00:25:15,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:25:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 7096 transitions. [2022-11-22 00:25:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:25:15,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:15,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:15,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 00:25:15,366 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:15,366 INFO L85 PathProgramCache]: Analyzing trace with hash 664663054, now seen corresponding path program 1 times [2022-11-22 00:25:15,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:15,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417148803] [2022-11-22 00:25:15,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:15,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:25:15,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:15,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417148803] [2022-11-22 00:25:15,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417148803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:15,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:15,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:25:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687267537] [2022-11-22 00:25:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:15,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:25:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:25:15,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:25:15,676 INFO L87 Difference]: Start difference. First operand 2348 states and 7096 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:15,941 INFO L93 Difference]: Finished difference Result 2115 states and 5593 transitions. [2022-11-22 00:25:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:25:15,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 00:25:15,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:15,951 INFO L225 Difference]: With dead ends: 2115 [2022-11-22 00:25:15,951 INFO L226 Difference]: Without dead ends: 2115 [2022-11-22 00:25:15,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:25:15,953 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 57 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:15,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 8 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:25:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2022-11-22 00:25:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1881. [2022-11-22 00:25:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1805 states have (on average 2.8166204986149586) internal successors, (5084), 1880 states have internal predecessors, (5084), 0 states have call successors, (0), 0 states 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:25:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 5084 transitions. [2022-11-22 00:25:16,015 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 5084 transitions. Word has length 14 [2022-11-22 00:25:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:16,017 INFO L495 AbstractCegarLoop]: Abstraction has 1881 states and 5084 transitions. [2022-11-22 00:25:16,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 5084 transitions. [2022-11-22 00:25:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:25:16,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:16,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:16,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 00:25:16,019 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:16,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:16,020 INFO L85 PathProgramCache]: Analyzing trace with hash 664663104, now seen corresponding path program 1 times [2022-11-22 00:25:16,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:16,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354099884] [2022-11-22 00:25:16,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:16,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:25:16,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:16,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354099884] [2022-11-22 00:25:16,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354099884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:16,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:16,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:25:16,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962813981] [2022-11-22 00:25:16,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:16,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:25:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:16,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:25:16,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:25:16,637 INFO L87 Difference]: Start difference. First operand 1881 states and 5084 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:25:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:17,200 INFO L93 Difference]: Finished difference Result 1314 states and 3671 transitions. [2022-11-22 00:25:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:25:17,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:25:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:17,210 INFO L225 Difference]: With dead ends: 1314 [2022-11-22 00:25:17,210 INFO L226 Difference]: Without dead ends: 1266 [2022-11-22 00:25:17,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:25:17,211 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:17,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 17 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:25:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2022-11-22 00:25:17,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2022-11-22 00:25:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1228 states have (on average 2.833061889250814) internal successors, (3479), 1265 states have internal predecessors, (3479), 0 states have call successors, (0), 0 states 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:25:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 3479 transitions. [2022-11-22 00:25:17,254 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 3479 transitions. Word has length 14 [2022-11-22 00:25:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:17,254 INFO L495 AbstractCegarLoop]: Abstraction has 1266 states and 3479 transitions. [2022-11-22 00:25:17,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:25:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 3479 transitions. [2022-11-22 00:25:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:25:17,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:17,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:17,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 00:25:17,257 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:17,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:17,258 INFO L85 PathProgramCache]: Analyzing trace with hash -205876693, now seen corresponding path program 1 times [2022-11-22 00:25:17,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:17,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947850054] [2022-11-22 00:25:17,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:17,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:19,227 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:25:19,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:19,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947850054] [2022-11-22 00:25:19,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947850054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:19,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:19,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:25:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925579203] [2022-11-22 00:25:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:19,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:25:19,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:25:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:25:19,229 INFO L87 Difference]: Start difference. First operand 1266 states and 3479 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:25:19,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:19,972 INFO L93 Difference]: Finished difference Result 1847 states and 5270 transitions. [2022-11-22 00:25:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 00:25:19,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:25:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:19,979 INFO L225 Difference]: With dead ends: 1847 [2022-11-22 00:25:19,979 INFO L226 Difference]: Without dead ends: 1847 [2022-11-22 00:25:19,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:25:19,980 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 112 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:19,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 8 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:25:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2022-11-22 00:25:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1310. [2022-11-22 00:25:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1272 states have (on average 2.8553459119496853) internal successors, (3632), 1309 states have internal predecessors, (3632), 0 states have call successors, (0), 0 states 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:25:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 3632 transitions. [2022-11-22 00:25:20,014 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 3632 transitions. Word has length 15 [2022-11-22 00:25:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:20,014 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 3632 transitions. [2022-11-22 00:25:20,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:25:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 3632 transitions. [2022-11-22 00:25:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:25:20,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:20,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:20,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 00:25:20,017 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:20,017 INFO L85 PathProgramCache]: Analyzing trace with hash 869834463, now seen corresponding path program 2 times [2022-11-22 00:25:20,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138960127] [2022-11-22 00:25:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:20,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:22,206 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:25:22,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:22,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138960127] [2022-11-22 00:25:22,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138960127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:22,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:22,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 00:25:22,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841898415] [2022-11-22 00:25:22,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:22,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 00:25:22,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:22,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 00:25:22,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:25:22,212 INFO L87 Difference]: Start difference. First operand 1310 states and 3632 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:25:23,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:23,157 INFO L93 Difference]: Finished difference Result 1696 states and 4757 transitions. [2022-11-22 00:25:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 00:25:23,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:25:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:23,165 INFO L225 Difference]: With dead ends: 1696 [2022-11-22 00:25:23,165 INFO L226 Difference]: Without dead ends: 1678 [2022-11-22 00:25:23,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-22 00:25:23,166 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 67 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:23,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 24 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 00:25:23,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2022-11-22 00:25:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1305. [2022-11-22 00:25:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1267 states have (on average 2.834254143646409) internal successors, (3591), 1304 states have internal predecessors, (3591), 0 states have call successors, (0), 0 states 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:25:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 3591 transitions. [2022-11-22 00:25:23,209 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 3591 transitions. Word has length 15 [2022-11-22 00:25:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:23,210 INFO L495 AbstractCegarLoop]: Abstraction has 1305 states and 3591 transitions. [2022-11-22 00:25:23,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:25:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 3591 transitions. [2022-11-22 00:25:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:25:23,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:23,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:23,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 00:25:23,213 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash -870278267, now seen corresponding path program 1 times [2022-11-22 00:25:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:23,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002543151] [2022-11-22 00:25:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:25:23,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:23,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002543151] [2022-11-22 00:25:23,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002543151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:23,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:23,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:25:23,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757421987] [2022-11-22 00:25:23,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:23,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:25:23,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:23,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:25:23,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:25:23,343 INFO L87 Difference]: Start difference. First operand 1305 states and 3591 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:23,459 INFO L93 Difference]: Finished difference Result 1090 states and 3257 transitions. [2022-11-22 00:25:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:25:23,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 00:25:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:23,462 INFO L225 Difference]: With dead ends: 1090 [2022-11-22 00:25:23,462 INFO L226 Difference]: Without dead ends: 287 [2022-11-22 00:25:23,462 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:25:23,463 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:23,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 2 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:25:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-22 00:25:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2022-11-22 00:25:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 2.7797202797202796) internal successors, (795), 286 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:25:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 795 transitions. [2022-11-22 00:25:23,473 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 795 transitions. Word has length 15 [2022-11-22 00:25:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:23,473 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 795 transitions. [2022-11-22 00:25:23,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 795 transitions. [2022-11-22 00:25:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:25:23,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:23,475 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:25:23,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 00:25:23,475 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:23,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:23,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1469465520, now seen corresponding path program 1 times [2022-11-22 00:25:23,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:23,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544958126] [2022-11-22 00:25:23,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:23,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:25:23,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:23,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544958126] [2022-11-22 00:25:23,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544958126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:23,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:23,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:25:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252467321] [2022-11-22 00:25:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:23,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:25:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:23,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:25:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:25:23,822 INFO L87 Difference]: Start difference. First operand 287 states and 795 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) 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:25:23,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:23,900 INFO L93 Difference]: Finished difference Result 207 states and 491 transitions. [2022-11-22 00:25:23,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:25:23,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) 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:25:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:23,902 INFO L225 Difference]: With dead ends: 207 [2022-11-22 00:25:23,902 INFO L226 Difference]: Without dead ends: 207 [2022-11-22 00:25:23,902 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:25:23,903 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:23,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:25:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-22 00:25:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-11-22 00:25:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.383495145631068) internal successors, (491), 206 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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:25:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 491 transitions. [2022-11-22 00:25:23,911 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 491 transitions. Word has length 16 [2022-11-22 00:25:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:23,911 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 491 transitions. [2022-11-22 00:25:23,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) 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:25:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 491 transitions. [2022-11-22 00:25:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:25:23,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:23,913 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:25:23,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 00:25:23,913 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:23,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:23,914 INFO L85 PathProgramCache]: Analyzing trace with hash -430039619, now seen corresponding path program 1 times [2022-11-22 00:25:23,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:23,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853551895] [2022-11-22 00:25:23,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:23,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:26,013 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:25:26,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:26,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853551895] [2022-11-22 00:25:26,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853551895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:26,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:26,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:25:26,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353720373] [2022-11-22 00:25:26,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:26,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:25:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:26,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:25:26,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:25:26,016 INFO L87 Difference]: Start difference. First operand 207 states and 491 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:26,385 INFO L93 Difference]: Finished difference Result 255 states and 611 transitions. [2022-11-22 00:25:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:25:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 00:25:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:26,387 INFO L225 Difference]: With dead ends: 255 [2022-11-22 00:25:26,387 INFO L226 Difference]: Without dead ends: 255 [2022-11-22 00:25:26,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:25:26,388 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:26,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 9 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:25:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-22 00:25:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 217. [2022-11-22 00:25:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.388888888888889) internal successors, (516), 216 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:25:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 516 transitions. [2022-11-22 00:25:26,393 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 516 transitions. Word has length 17 [2022-11-22 00:25:26,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:26,393 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 516 transitions. [2022-11-22 00:25:26,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 516 transitions. [2022-11-22 00:25:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:25:26,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:26,394 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:25:26,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 00:25:26,395 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1758737039, now seen corresponding path program 2 times [2022-11-22 00:25:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:26,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958995237] [2022-11-22 00:25:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:26,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:28,784 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:25:28,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:28,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958995237] [2022-11-22 00:25:28,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958995237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:28,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:28,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 00:25:28,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989015215] [2022-11-22 00:25:28,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:28,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 00:25:28,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:28,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 00:25:28,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-22 00:25:28,786 INFO L87 Difference]: Start difference. First operand 217 states and 516 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:29,229 INFO L93 Difference]: Finished difference Result 256 states and 616 transitions. [2022-11-22 00:25:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:25:29,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 00:25:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:29,231 INFO L225 Difference]: With dead ends: 256 [2022-11-22 00:25:29,231 INFO L226 Difference]: Without dead ends: 256 [2022-11-22 00:25:29,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-22 00:25:29,232 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:29,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 9 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:25:29,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-22 00:25:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 185. [2022-11-22 00:25:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.358695652173913) internal successors, (434), 184 states have internal predecessors, (434), 0 states have call successors, (0), 0 states 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:25:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 434 transitions. [2022-11-22 00:25:29,240 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 434 transitions. Word has length 17 [2022-11-22 00:25:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:29,240 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 434 transitions. [2022-11-22 00:25:29,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 434 transitions. [2022-11-22 00:25:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 00:25:29,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:29,243 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:25:29,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-22 00:25:29,244 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:29,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1504505960, now seen corresponding path program 1 times [2022-11-22 00:25:29,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:29,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783437104] [2022-11-22 00:25:29,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:29,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:25:29,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:29,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783437104] [2022-11-22 00:25:29,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783437104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:29,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:29,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:25:29,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815002955] [2022-11-22 00:25:29,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:29,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:25:29,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:29,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:25:29,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:25:29,534 INFO L87 Difference]: Start difference. First operand 185 states and 434 transitions. Second operand has 4 states, 4 states have (on average 4.5) 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:25:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:29,638 INFO L93 Difference]: Finished difference Result 117 states and 234 transitions. [2022-11-22 00:25:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:25:29,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) 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:25:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:29,639 INFO L225 Difference]: With dead ends: 117 [2022-11-22 00:25:29,639 INFO L226 Difference]: Without dead ends: 117 [2022-11-22 00:25:29,640 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:25:29,640 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:29,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:25:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-22 00:25:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-22 00:25:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.0172413793103448) internal successors, (234), 116 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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:25:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 234 transitions. [2022-11-22 00:25:29,643 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 234 transitions. Word has length 18 [2022-11-22 00:25:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:29,643 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 234 transitions. [2022-11-22 00:25:29,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) 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:25:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 234 transitions. [2022-11-22 00:25:29,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:25:29,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:29,644 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:25:29,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 00:25:29,644 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1422717930, now seen corresponding path program 1 times [2022-11-22 00:25:29,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:29,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750564065] [2022-11-22 00:25:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:29,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:29,981 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:25:29,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:29,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750564065] [2022-11-22 00:25:29,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750564065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:29,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:29,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:25:29,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019284550] [2022-11-22 00:25:29,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:29,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:25:29,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:29,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:25:29,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:25:29,984 INFO L87 Difference]: Start difference. First operand 117 states and 234 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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:25:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:30,086 INFO L93 Difference]: Finished difference Result 93 states and 186 transitions. [2022-11-22 00:25:30,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:25:30,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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:25:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:30,088 INFO L225 Difference]: With dead ends: 93 [2022-11-22 00:25:30,088 INFO L226 Difference]: Without dead ends: 93 [2022-11-22 00:25:30,088 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:25:30,088 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 53 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:30,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 5 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:25:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-22 00:25:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-22 00:25:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.0217391304347827) internal successors, (186), 92 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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:25:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 186 transitions. [2022-11-22 00:25:30,091 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 186 transitions. Word has length 20 [2022-11-22 00:25:30,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:30,091 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 186 transitions. [2022-11-22 00:25:30,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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:25:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 186 transitions. [2022-11-22 00:25:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:25:30,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:30,092 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:25:30,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-22 00:25:30,092 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash 560622085, now seen corresponding path program 1 times [2022-11-22 00:25:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:30,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946119701] [2022-11-22 00:25:30,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:25:33,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:33,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946119701] [2022-11-22 00:25:33,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946119701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:33,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:33,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 00:25:33,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928065580] [2022-11-22 00:25:33,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:33,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 00:25:33,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:33,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 00:25:33,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:25:33,004 INFO L87 Difference]: Start difference. First operand 93 states and 186 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 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:25:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:33,727 INFO L93 Difference]: Finished difference Result 231 states and 458 transitions. [2022-11-22 00:25:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:25:33,728 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 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:25:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:33,729 INFO L225 Difference]: With dead ends: 231 [2022-11-22 00:25:33,729 INFO L226 Difference]: Without dead ends: 131 [2022-11-22 00:25:33,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-11-22 00:25:33,730 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 87 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:33,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 13 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:25:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-22 00:25:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2022-11-22 00:25:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.0) internal successors, (178), 89 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:25:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 178 transitions. [2022-11-22 00:25:33,733 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 178 transitions. Word has length 22 [2022-11-22 00:25:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:33,733 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 178 transitions. [2022-11-22 00:25:33,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 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:25:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 178 transitions. [2022-11-22 00:25:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:25:33,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:33,734 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:25:33,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-22 00:25:33,735 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:33,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash 461244285, now seen corresponding path program 2 times [2022-11-22 00:25:33,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:33,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457366061] [2022-11-22 00:25:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:33,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:35,907 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:25:35,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:35,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457366061] [2022-11-22 00:25:35,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457366061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:35,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:35,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 00:25:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242981016] [2022-11-22 00:25:35,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:35,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 00:25:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:35,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 00:25:35,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:25:35,909 INFO L87 Difference]: Start difference. First operand 90 states and 178 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:36,299 INFO L93 Difference]: Finished difference Result 171 states and 331 transitions. [2022-11-22 00:25:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:25:36,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:25:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:36,300 INFO L225 Difference]: With dead ends: 171 [2022-11-22 00:25:36,300 INFO L226 Difference]: Without dead ends: 80 [2022-11-22 00:25:36,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:25:36,301 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:36,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 9 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:25:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-22 00:25:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2022-11-22 00:25:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.8305084745762712) internal successors, (108), 59 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:25:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 108 transitions. [2022-11-22 00:25:36,303 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 108 transitions. Word has length 22 [2022-11-22 00:25:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:36,304 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 108 transitions. [2022-11-22 00:25:36,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 108 transitions. [2022-11-22 00:25:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:25:36,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:36,305 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:25:36,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-22 00:25:36,305 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:36,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:36,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1342115977, now seen corresponding path program 3 times [2022-11-22 00:25:36,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:36,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98919568] [2022-11-22 00:25:36,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:36,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:38,281 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:25:38,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:38,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98919568] [2022-11-22 00:25:38,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98919568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:38,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:38,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 00:25:38,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576035114] [2022-11-22 00:25:38,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:38,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 00:25:38,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:38,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 00:25:38,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:25:38,283 INFO L87 Difference]: Start difference. First operand 60 states and 108 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:38,631 INFO L93 Difference]: Finished difference Result 123 states and 222 transitions. [2022-11-22 00:25:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:25:38,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:25:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:38,633 INFO L225 Difference]: With dead ends: 123 [2022-11-22 00:25:38,633 INFO L226 Difference]: Without dead ends: 65 [2022-11-22 00:25:38,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-11-22 00:25:38,633 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 57 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:38,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 11 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:25:38,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-22 00:25:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2022-11-22 00:25:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 58 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:25:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 97 transitions. [2022-11-22 00:25:38,636 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 97 transitions. Word has length 22 [2022-11-22 00:25:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:38,636 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 97 transitions. [2022-11-22 00:25:38,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:25:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 97 transitions. [2022-11-22 00:25:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:25:38,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:38,636 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:25:38,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-22 00:25:38,637 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:38,637 INFO L85 PathProgramCache]: Analyzing trace with hash -359722667, now seen corresponding path program 4 times [2022-11-22 00:25:38,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:38,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092603079] [2022-11-22 00:25:38,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:38,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:40,631 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:25:40,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:40,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092603079] [2022-11-22 00:25:40,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092603079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:25:40,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:25:40,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-22 00:25:40,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907606253] [2022-11-22 00:25:40,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:25:40,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 00:25:40,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:40,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 00:25:40,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:25:40,634 INFO L87 Difference]: Start difference. First operand 59 states and 97 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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:25:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:25:41,110 INFO L93 Difference]: Finished difference Result 85 states and 145 transitions. [2022-11-22 00:25:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:25:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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:25:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:25:41,111 INFO L225 Difference]: With dead ends: 85 [2022-11-22 00:25:41,111 INFO L226 Difference]: Without dead ends: 49 [2022-11-22 00:25:41,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-11-22 00:25:41,112 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:25:41,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 9 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:25:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-22 00:25:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-22 00:25:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:25:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2022-11-22 00:25:41,114 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 22 [2022-11-22 00:25:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:25:41,115 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2022-11-22 00:25:41,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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:25:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2022-11-22 00:25:41,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:25:41,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:25:41,116 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:25:41,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-22 00:25:41,116 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:25:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:25:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2011099461, now seen corresponding path program 5 times [2022-11-22 00:25:41,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:25:41,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374337269] [2022-11-22 00:25:41,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:25:41,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:25:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:25:41,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 00:25:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:25:41,375 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 00:25:41,375 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 00:25:41,377 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2022-11-22 00:25:41,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2022-11-22 00:25:41,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2022-11-22 00:25:41,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2022-11-22 00:25:41,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2022-11-22 00:25:41,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2022-11-22 00:25:41,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2022-11-22 00:25:41,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2022-11-22 00:25:41,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2022-11-22 00:25:41,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2022-11-22 00:25:41,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2022-11-22 00:25:41,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2022-11-22 00:25:41,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2022-11-22 00:25:41,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2022-11-22 00:25:41,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2022-11-22 00:25:41,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2022-11-22 00:25:41,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2022-11-22 00:25:41,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2022-11-22 00:25:41,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2022-11-22 00:25:41,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2022-11-22 00:25:41,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2022-11-22 00:25:41,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2022-11-22 00:25:41,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2022-11-22 00:25:41,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2022-11-22 00:25:41,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2022-11-22 00:25:41,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2022-11-22 00:25:41,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2022-11-22 00:25:41,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2022-11-22 00:25:41,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2022-11-22 00:25:41,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2022-11-22 00:25:41,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2022-11-22 00:25:41,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2022-11-22 00:25:41,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2022-11-22 00:25:41,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2022-11-22 00:25:41,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2022-11-22 00:25:41,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2022-11-22 00:25:41,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2022-11-22 00:25:41,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2022-11-22 00:25:41,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2022-11-22 00:25:41,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2022-11-22 00:25:41,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2022-11-22 00:25:41,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2022-11-22 00:25:41,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2022-11-22 00:25:41,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2022-11-22 00:25:41,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2022-11-22 00:25:41,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2022-11-22 00:25:41,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2022-11-22 00:25:41,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2022-11-22 00:25:41,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2022-11-22 00:25:41,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2022-11-22 00:25:41,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2022-11-22 00:25:41,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2022-11-22 00:25:41,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2022-11-22 00:25:41,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2022-11-22 00:25:41,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2022-11-22 00:25:41,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2022-11-22 00:25:41,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2022-11-22 00:25:41,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2022-11-22 00:25:41,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2022-11-22 00:25:41,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2022-11-22 00:25:41,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2022-11-22 00:25:41,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2022-11-22 00:25:41,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2022-11-22 00:25:41,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2022-11-22 00:25:41,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2022-11-22 00:25:41,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2022-11-22 00:25:41,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2022-11-22 00:25:41,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2022-11-22 00:25:41,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2022-11-22 00:25:41,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2022-11-22 00:25:41,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2022-11-22 00:25:41,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2022-11-22 00:25:41,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2022-11-22 00:25:41,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2022-11-22 00:25:41,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2022-11-22 00:25:41,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2022-11-22 00:25:41,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2022-11-22 00:25:41,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2022-11-22 00:25:41,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2022-11-22 00:25:41,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2022-11-22 00:25:41,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2022-11-22 00:25:41,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2022-11-22 00:25:41,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2022-11-22 00:25:41,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2022-11-22 00:25:41,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2022-11-22 00:25:41,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2022-11-22 00:25:41,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2022-11-22 00:25:41,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2022-11-22 00:25:41,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2022-11-22 00:25:41,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2022-11-22 00:25:41,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2022-11-22 00:25:41,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2022-11-22 00:25:41,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2022-11-22 00:25:41,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2022-11-22 00:25:41,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2022-11-22 00:25:41,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2022-11-22 00:25:41,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2022-11-22 00:25:41,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2022-11-22 00:25:41,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2022-11-22 00:25:41,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2022-11-22 00:25:41,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2022-11-22 00:25:41,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-22 00:25:41,407 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:25:41,413 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 00:25:41,414 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:25:41,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:25:41 BasicIcfg [2022-11-22 00:25:41,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:25:41,522 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:25:41,523 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:25:41,523 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:25:41,523 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:24:22" (3/4) ... [2022-11-22 00:25:41,526 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 00:25:41,526 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:25:41,527 INFO L158 Benchmark]: Toolchain (without parser) took 81488.14ms. Allocated memory was 172.0MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 127.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-11-22 00:25:41,527 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 172.0MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:25:41,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 700.64ms. Allocated memory is still 172.0MB. Free memory was 127.0MB in the beginning and 101.3MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-22 00:25:41,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.05ms. Allocated memory is still 172.0MB. Free memory was 101.3MB in the beginning and 98.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:25:41,528 INFO L158 Benchmark]: Boogie Preprocessor took 36.66ms. Allocated memory is still 172.0MB. Free memory was 98.6MB in the beginning and 96.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:25:41,528 INFO L158 Benchmark]: RCFGBuilder took 1867.62ms. Allocated memory was 172.0MB in the beginning and 237.0MB in the end (delta: 65.0MB). Free memory was 96.2MB in the beginning and 158.7MB in the end (delta: -62.6MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2022-11-22 00:25:41,529 INFO L158 Benchmark]: TraceAbstraction took 78819.87ms. Allocated memory was 237.0MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 157.7MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-11-22 00:25:41,529 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 3.8GB. Free memory is still 1.8GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:25:41,530 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.26ms. Allocated memory is still 172.0MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 700.64ms. Allocated memory is still 172.0MB. Free memory was 127.0MB in the beginning and 101.3MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.05ms. Allocated memory is still 172.0MB. Free memory was 101.3MB in the beginning and 98.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.66ms. Allocated memory is still 172.0MB. Free memory was 98.6MB in the beginning and 96.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1867.62ms. Allocated memory was 172.0MB in the beginning and 237.0MB in the end (delta: 65.0MB). Free memory was 96.2MB in the beginning and 158.7MB in the end (delta: -62.6MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * TraceAbstraction took 78819.87ms. Allocated memory was 237.0MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 157.7MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 3.8GB. Free memory is still 1.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.8s, 204 PlacesBefore, 100 PlacesAfterwards, 196 TransitionsBefore, 91 TransitionsAfterwards, 9024 CoEnabledTransitionPairs, 8 FixpointIterations, 69 TrivialSequentialCompositions, 121 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 196 TotalNumberOfCompositions, 44672 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17176, independent: 16561, independent conditional: 0, independent unconditional: 16561, dependent: 572, dependent conditional: 0, dependent unconditional: 572, unknown: 43, unknown conditional: 0, unknown unconditional: 43] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6439, independent: 6341, independent conditional: 0, independent unconditional: 6341, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6439, independent: 4928, independent conditional: 0, independent unconditional: 4928, dependent: 1511, dependent conditional: 0, dependent unconditional: 1511, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1511, independent: 1413, independent conditional: 0, independent unconditional: 1413, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5864, independent: 5144, independent conditional: 0, independent unconditional: 5144, dependent: 642, dependent conditional: 0, dependent unconditional: 642, unknown: 78, unknown conditional: 0, unknown unconditional: 78] ], Cache Queries: [ total: 17176, independent: 10220, independent conditional: 0, independent unconditional: 10220, dependent: 478, dependent conditional: 0, dependent unconditional: 478, unknown: 6478, unknown conditional: 0, unknown unconditional: 6478] , Statistics on independence cache: Total cache size (in pairs): 925, Positive cache size: 881, Positive conditional cache size: 0, Positive unconditional cache size: 881, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2112; [L853] FCALL, FORK 0 pthread_create(&t2112, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2112, ((void *)0), P0, ((void *)0))=0, t2112={4:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] 0 pthread_t t2113; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2112={4:0}, t2113={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] FCALL, FORK 0 pthread_create(&t2113, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2113, ((void *)0), P1, ((void *)0))=1, t2112={4:0}, t2113={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] 0 pthread_t t2114; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2112={4:0}, t2113={5:0}, t2114={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] FCALL, FORK 0 pthread_create(&t2114, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2114, ((void *)0), P2, ((void *)0))=2, t2112={4:0}, t2113={5:0}, t2114={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] EXPR 3 \read(x) [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L814] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L815] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L816] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L817] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L819] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L821] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L822] EXPR 3 \read(x) [L822] 3 __unbuffered_p2_EAX = x [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] EXPR 3 \read(x) [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] 3 x = x$flush_delayed ? x$mem_tmp : x [L824] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=51, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L827] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=51, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L833] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=52, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=52, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=52, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 \read(x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=1, main$tmp_guard1=0, t2112={4:0}, t2113={5:0}, t2114={7:0}, weak$$choice0=52, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 x$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(x) [L873] 0 x$mem_tmp = x [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] EXPR 0 \read(x) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 \read(x) [L883] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] 0 x = x$flush_delayed ? x$mem_tmp : x [L885] 0 x$flush_delayed = (_Bool)0 [L887] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=49, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 857]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 257 locations, 101 error locations. Started 1 CEGAR loops. OverallTime: 78.5s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 38.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1316 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1316 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 549 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3621 IncrementalHoareTripleChecker+Invalid, 4170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 549 mSolverCounterUnsat, 66 mSDtfsCounter, 3621 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119052occurred in iteration=0, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 3548 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 5473 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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:25:41,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 09aaf4da9760e082dee1b84490861799ac10c7d3871bbdf2d8243e88d9e00b49 --- 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:25:44,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:25:44,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:25:44,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:25:44,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:25:44,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:25:44,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:25:44,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:25:44,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:25:44,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:25:44,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:25:44,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:25:44,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:25:44,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:25:44,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:25:44,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:25:44,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:25:44,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:25:44,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:25:44,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:25:44,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:25:44,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:25:44,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:25:44,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:25:44,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:25:44,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:25:44,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:25:44,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:25:44,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:25:44,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:25:44,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:25:44,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:25:44,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:25:44,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:25:44,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:25:44,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:25:44,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:25:44,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:25:44,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:25:44,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:25:44,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:25:44,132 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-22 00:25:44,179 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:25:44,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:25:44,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:25:44,180 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:25:44,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:25:44,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:25:44,181 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:25:44,182 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:25:44,182 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:25:44,182 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:25:44,183 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:25:44,183 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:25:44,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 00:25:44,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 00:25:44,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:25:44,185 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:25:44,185 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:25:44,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:25:44,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:25:44,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:25:44,186 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 00:25:44,186 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 00:25:44,186 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 00:25:44,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:25:44,187 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 00:25:44,187 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-22 00:25:44,187 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-22 00:25:44,187 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:25:44,187 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:25:44,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:25:44,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-22 00:25:44,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:25:44,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:25:44,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:25:44,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:25:44,189 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-22 00:25:44,189 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-22 00:25:44,190 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:25:44,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-22 00:25:44,190 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_ceda874c-f76a-4cf6-a07b-dbd63d259680/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_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 -> 09aaf4da9760e082dee1b84490861799ac10c7d3871bbdf2d8243e88d9e00b49 [2022-11-22 00:25:44,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:25:44,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:25:44,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:25:44,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:25:44,591 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:25:44,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i [2022-11-22 00:25:47,694 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:25:48,014 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:25:48,015 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i [2022-11-22 00:25:48,029 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/data/a2339d7da/3810ca6c1b3642208b5ef86c213d42fd/FLAGb3a9ffa35 [2022-11-22 00:25:48,044 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/data/a2339d7da/3810ca6c1b3642208b5ef86c213d42fd [2022-11-22 00:25:48,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:25:48,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:25:48,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:25:48,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:25:48,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:25:48,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:25:48" (1/1) ... [2022-11-22 00:25:48,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3fcd80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48, skipping insertion in model container [2022-11-22 00:25:48,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:25:48" (1/1) ... [2022-11-22 00:25:48,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:25:48,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:25:48,266 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_ceda874c-f76a-4cf6-a07b-dbd63d259680/sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i[992,1005] [2022-11-22 00:25:48,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:25:48,614 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:25:48,631 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_ceda874c-f76a-4cf6-a07b-dbd63d259680/sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i[992,1005] [2022-11-22 00:25:48,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:25:48,795 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:25:48,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48 WrapperNode [2022-11-22 00:25:48,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:25:48,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:25:48,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:25:48,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:25:48,805 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:25:48" (1/1) ... [2022-11-22 00:25:48,838 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:25:48" (1/1) ... [2022-11-22 00:25:48,862 INFO L138 Inliner]: procedures = 180, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2022-11-22 00:25:48,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:25:48,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:25:48,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:25:48,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:25:48,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48" (1/1) ... [2022-11-22 00:25:48,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48" (1/1) ... [2022-11-22 00:25:48,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48" (1/1) ... [2022-11-22 00:25:48,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48" (1/1) ... [2022-11-22 00:25:48,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48" (1/1) ... [2022-11-22 00:25:48,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48" (1/1) ... [2022-11-22 00:25:48,896 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48" (1/1) ... [2022-11-22 00:25:48,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48" (1/1) ... [2022-11-22 00:25:48,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:25:48,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:25:48,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:25:48,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:25:48,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48" (1/1) ... [2022-11-22 00:25:48,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:25:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:25:48,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:25:48,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:25:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-22 00:25:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:25:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:25:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:25:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:25:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-22 00:25:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-22 00:25:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-22 00:25:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 00:25:49,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 00:25:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 00:25:49,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 00:25:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 00:25:49,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 00:25:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:25:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:25:49,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:25:49,015 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:25:49,244 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:25:49,246 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:25:49,993 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:25:50,816 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:25:50,816 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:25:50,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:25:50 BoogieIcfgContainer [2022-11-22 00:25:50,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:25:50,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:25:50,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:25:50,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:25:50,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:25:48" (1/3) ... [2022-11-22 00:25:50,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713cb7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:25:50, skipping insertion in model container [2022-11-22 00:25:50,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:25:48" (2/3) ... [2022-11-22 00:25:50,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713cb7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:25:50, skipping insertion in model container [2022-11-22 00:25:50,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:25:50" (3/3) ... [2022-11-22 00:25:50,839 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.opt.i [2022-11-22 00:25:50,858 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:25:50,859 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-11-22 00:25:50,860 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:25:51,036 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 00:25:51,085 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:25:51,113 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 197 transitions, 409 flow [2022-11-22 00:25:51,117 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 197 transitions, 409 flow [2022-11-22 00:25:51,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 197 transitions, 409 flow [2022-11-22 00:25:51,280 INFO L130 PetriNetUnfolder]: 2/194 cut-off events. [2022-11-22 00:25:51,280 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 00:25:51,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 2/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 331 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-11-22 00:25:51,292 INFO L119 LiptonReduction]: Number of co-enabled transitions 9024 [2022-11-22 00:25:58,819 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 191 DAG size of output: 189 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 00:26:08,871 WARN L233 SmtUtils]: Spent 7.02s on a formula simplification. DAG size of input: 219 DAG size of output: 217 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 00:27:11,095 INFO L134 LiptonReduction]: Checked pairs total: 44861 [2022-11-22 00:27:11,096 INFO L136 LiptonReduction]: Total number of compositions: 199 [2022-11-22 00:27:11,104 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 100 places, 91 transitions, 197 flow [2022-11-22 00:27:14,627 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 0 states 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:27:14,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:27:14,679 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;@15ba25ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:27:14,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2022-11-22 00:27:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 0 states 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:27:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 00:27:15,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:15,151 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 00:27:15,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1232, now seen corresponding path program 1 times [2022-11-22 00:27:15,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:15,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280151759] [2022-11-22 00:27:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:27:15,185 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:27:15,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:15,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:15,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:15,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-22 00:27:15,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:15,536 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:27:15,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:15,537 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:15,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280151759] [2022-11-22 00:27:15,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280151759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:15,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:15,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 00:27:15,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144191316] [2022-11-22 00:27:15,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:15,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 00:27:15,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:15,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 00:27:15,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:27:15,817 INFO L87 Difference]: Start difference. First operand has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 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:27:16,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:16,723 INFO L93 Difference]: Finished difference Result 14832 states and 53255 transitions. [2022-11-22 00:27:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 00:27:16,740 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:27:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:17,013 INFO L225 Difference]: With dead ends: 14832 [2022-11-22 00:27:17,013 INFO L226 Difference]: Without dead ends: 14832 [2022-11-22 00:27:17,026 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:27:17,030 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:17,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:27:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14832 states. [2022-11-22 00:27:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14832 to 14832. [2022-11-22 00:27:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14832 states, 12754 states have (on average 4.175552767759134) internal successors, (53255), 14831 states have internal predecessors, (53255), 0 states have call successors, (0), 0 states 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:27:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14832 states to 14832 states and 53255 transitions. [2022-11-22 00:27:18,131 INFO L78 Accepts]: Start accepts. Automaton has 14832 states and 53255 transitions. Word has length 1 [2022-11-22 00:27:18,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:18,133 INFO L495 AbstractCegarLoop]: Abstraction has 14832 states and 53255 transitions. [2022-11-22 00:27:18,133 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:27:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 14832 states and 53255 transitions. [2022-11-22 00:27:18,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 00:27:18,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:18,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 00:27:18,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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)] Forceful destruction successful, exit code 0 [2022-11-22 00:27:18,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:18,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:18,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash 37732750, now seen corresponding path program 1 times [2022-11-22 00:27:18,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:18,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110841733] [2022-11-22 00:27:18,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:27:18,355 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:27:18,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:18,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:18,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:18,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:27:18,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:18,718 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 00:27:18,720 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:27:18,759 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:27:18,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:18,760 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:18,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110841733] [2022-11-22 00:27:18,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110841733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:18,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:18,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:27:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311247740] [2022-11-22 00:27:18,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:18,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:27:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:18,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:27:18,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:27:18,764 INFO L87 Difference]: Start difference. First operand 14832 states and 53255 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:19,211 INFO L93 Difference]: Finished difference Result 7176 states and 24912 transitions. [2022-11-22 00:27:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:27:19,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-22 00:27:19,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:19,254 INFO L225 Difference]: With dead ends: 7176 [2022-11-22 00:27:19,254 INFO L226 Difference]: Without dead ends: 7176 [2022-11-22 00:27:19,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:27:19,260 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:19,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:27:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7176 states. [2022-11-22 00:27:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7176 to 7176. [2022-11-22 00:27:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7176 states, 6559 states have (on average 3.798139960359811) internal successors, (24912), 7175 states have internal predecessors, (24912), 0 states have call successors, (0), 0 states 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:27:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7176 states to 7176 states and 24912 transitions. [2022-11-22 00:27:19,692 INFO L78 Accepts]: Start accepts. Automaton has 7176 states and 24912 transitions. Word has length 4 [2022-11-22 00:27:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:19,693 INFO L495 AbstractCegarLoop]: Abstraction has 7176 states and 24912 transitions. [2022-11-22 00:27:19,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7176 states and 24912 transitions. [2022-11-22 00:27:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 00:27:19,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:19,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 00:27:19,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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)] Ended with exit code 0 [2022-11-22 00:27:19,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:19,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash 37732751, now seen corresponding path program 1 times [2022-11-22 00:27:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:19,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710410362] [2022-11-22 00:27:19,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:27:19,908 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:27:19,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:19,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:19,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:20,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 00:27:20,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:20,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:27:20,260 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:27:20,295 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:27:20,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:20,295 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:20,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710410362] [2022-11-22 00:27:20,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710410362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:20,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:20,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:27:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960384841] [2022-11-22 00:27:20,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:20,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:27:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:20,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:27:20,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:27:20,298 INFO L87 Difference]: Start difference. First operand 7176 states and 24912 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:20,569 INFO L93 Difference]: Finished difference Result 2206 states and 7261 transitions. [2022-11-22 00:27:20,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:27:20,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-22 00:27:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:20,581 INFO L225 Difference]: With dead ends: 2206 [2022-11-22 00:27:20,581 INFO L226 Difference]: Without dead ends: 2206 [2022-11-22 00:27:20,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:27:20,583 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:20,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:27:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2022-11-22 00:27:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 2206. [2022-11-22 00:27:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 2124 states have (on average 3.4185499058380415) internal successors, (7261), 2205 states have internal predecessors, (7261), 0 states have call successors, (0), 0 states 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:27:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 7261 transitions. [2022-11-22 00:27:20,736 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 7261 transitions. Word has length 4 [2022-11-22 00:27:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:20,737 INFO L495 AbstractCegarLoop]: Abstraction has 2206 states and 7261 transitions. [2022-11-22 00:27:20,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 7261 transitions. [2022-11-22 00:27:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:27:20,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:20,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:27:20,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:20,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:20,950 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:20,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:20,950 INFO L85 PathProgramCache]: Analyzing trace with hash 347513283, now seen corresponding path program 1 times [2022-11-22 00:27:20,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:20,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409649070] [2022-11-22 00:27:20,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:27:20,951 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:27:20,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:20,967 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:20,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:21,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:27:21,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:21,484 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:27:21,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:21,484 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:21,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409649070] [2022-11-22 00:27:21,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409649070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:21,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:21,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:27:21,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978771198] [2022-11-22 00:27:21,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:21,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:27:21,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:21,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:27:21,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:27:21,487 INFO L87 Difference]: Start difference. First operand 2206 states and 7261 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:21,785 INFO L93 Difference]: Finished difference Result 1023 states and 2708 transitions. [2022-11-22 00:27:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:27:21,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 00:27:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:21,789 INFO L225 Difference]: With dead ends: 1023 [2022-11-22 00:27:21,789 INFO L226 Difference]: Without dead ends: 1023 [2022-11-22 00:27:21,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:27:21,790 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:21,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:27:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-11-22 00:27:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2022-11-22 00:27:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 965 states have (on average 2.806217616580311) internal successors, (2708), 1022 states have internal predecessors, (2708), 0 states have call successors, (0), 0 states 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:27:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 2708 transitions. [2022-11-22 00:27:21,818 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 2708 transitions. Word has length 11 [2022-11-22 00:27:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:21,819 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 2708 transitions. [2022-11-22 00:27:21,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 2708 transitions. [2022-11-22 00:27:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:27:21,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:21,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:27:21,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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)] Ended with exit code 0 [2022-11-22 00:27:22,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:22,038 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:22,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 467500736, now seen corresponding path program 1 times [2022-11-22 00:27:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:22,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729935628] [2022-11-22 00:27:22,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:27:22,040 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:27:22,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:22,042 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:22,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:22,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 00:27:22,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:22,419 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:27:22,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:22,420 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:22,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729935628] [2022-11-22 00:27:22,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729935628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:22,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:22,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:27:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962037325] [2022-11-22 00:27:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:27:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:27:22,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:27:22,422 INFO L87 Difference]: Start difference. First operand 1023 states and 2708 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:22,717 INFO L93 Difference]: Finished difference Result 322 states and 687 transitions. [2022-11-22 00:27:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:27:22,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 00:27:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:22,719 INFO L225 Difference]: With dead ends: 322 [2022-11-22 00:27:22,719 INFO L226 Difference]: Without dead ends: 322 [2022-11-22 00:27:22,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:27:22,720 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:22,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:27:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-22 00:27:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2022-11-22 00:27:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 302 states have (on average 2.274834437086093) internal successors, (687), 321 states have internal predecessors, (687), 0 states have call successors, (0), 0 states 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:27:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 687 transitions. [2022-11-22 00:27:22,729 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 687 transitions. Word has length 14 [2022-11-22 00:27:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:22,729 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 687 transitions. [2022-11-22 00:27:22,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 687 transitions. [2022-11-22 00:27:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 00:27:22,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:22,731 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:27:22,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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)] Forceful destruction successful, exit code 0 [2022-11-22 00:27:22,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:22,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash 367837886, now seen corresponding path program 1 times [2022-11-22 00:27:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:22,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828749138] [2022-11-22 00:27:22,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:27:22,946 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:27:22,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:22,947 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:22,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:23,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 00:27:23,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:23,292 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:27:23,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:23,293 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:23,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828749138] [2022-11-22 00:27:23,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828749138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:23,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:23,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:27:23,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713768697] [2022-11-22 00:27:23,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:23,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:27:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:23,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:27:23,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:27:23,296 INFO L87 Difference]: Start difference. First operand 322 states and 687 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:23,750 INFO L93 Difference]: Finished difference Result 183 states and 420 transitions. [2022-11-22 00:27:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:27:23,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-22 00:27:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:23,752 INFO L225 Difference]: With dead ends: 183 [2022-11-22 00:27:23,752 INFO L226 Difference]: Without dead ends: 183 [2022-11-22 00:27:23,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:27:23,754 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:23,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 18 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:27:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-22 00:27:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-22 00:27:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 2.346368715083799) internal successors, (420), 182 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:27:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 420 transitions. [2022-11-22 00:27:23,761 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 420 transitions. Word has length 18 [2022-11-22 00:27:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:23,761 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 420 transitions. [2022-11-22 00:27:23,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 420 transitions. [2022-11-22 00:27:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:27:23,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:23,762 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:27:23,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:23,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:23,975 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:23,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:23,976 INFO L85 PathProgramCache]: Analyzing trace with hash -440998642, now seen corresponding path program 1 times [2022-11-22 00:27:23,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:23,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519456628] [2022-11-22 00:27:23,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:27:23,977 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:27:23,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:23,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:23,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:24,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:27:24,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:24,483 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 34 treesize of output 30 [2022-11-22 00:27:24,767 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:27:24,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:24,767 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:24,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519456628] [2022-11-22 00:27:24,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519456628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:24,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:24,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:27:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920140487] [2022-11-22 00:27:24,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:24,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:27:24,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:27:24,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:27:24,769 INFO L87 Difference]: Start difference. First operand 183 states and 420 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:25,037 INFO L93 Difference]: Finished difference Result 182 states and 419 transitions. [2022-11-22 00:27:25,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:27:25,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:25,039 INFO L225 Difference]: With dead ends: 182 [2022-11-22 00:27:25,039 INFO L226 Difference]: Without dead ends: 182 [2022-11-22 00:27:25,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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:27:25,040 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:25,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:27:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-22 00:27:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-11-22 00:27:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 179 states have (on average 2.340782122905028) internal successors, (419), 181 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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:27:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 419 transitions. [2022-11-22 00:27:25,045 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 419 transitions. Word has length 22 [2022-11-22 00:27:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:25,045 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 419 transitions. [2022-11-22 00:27:25,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 419 transitions. [2022-11-22 00:27:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:27:25,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:25,046 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:27:25,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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)] Forceful destruction successful, exit code 0 [2022-11-22 00:27:25,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:25,247 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:25,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:25,247 INFO L85 PathProgramCache]: Analyzing trace with hash -440998641, now seen corresponding path program 1 times [2022-11-22 00:27:25,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:25,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015472548] [2022-11-22 00:27:25,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:27:25,248 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:27:25,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:25,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:25,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:25,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 00:27:25,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:25,762 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 34 treesize of output 30 [2022-11-22 00:27:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:27:25,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:25,962 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:25,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015472548] [2022-11-22 00:27:25,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015472548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:25,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:25,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:27:25,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518607067] [2022-11-22 00:27:25,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:25,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:27:25,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:25,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:27:25,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:27:25,964 INFO L87 Difference]: Start difference. First operand 182 states and 419 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:26,175 INFO L93 Difference]: Finished difference Result 181 states and 418 transitions. [2022-11-22 00:27:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:27:26,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:26,177 INFO L225 Difference]: With dead ends: 181 [2022-11-22 00:27:26,177 INFO L226 Difference]: Without dead ends: 181 [2022-11-22 00:27:26,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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:27:26,178 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:26,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:27:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-22 00:27:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-22 00:27:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.335195530726257) internal successors, (418), 180 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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:27:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 418 transitions. [2022-11-22 00:27:26,184 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 418 transitions. Word has length 22 [2022-11-22 00:27:26,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:26,184 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 418 transitions. [2022-11-22 00:27:26,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 418 transitions. [2022-11-22 00:27:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:27:26,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:26,185 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:27:26,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:26,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:26,386 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:26,387 INFO L85 PathProgramCache]: Analyzing trace with hash -440998253, now seen corresponding path program 1 times [2022-11-22 00:27:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:26,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295351337] [2022-11-22 00:27:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:27:26,387 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:27:26,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:26,388 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:26,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:26,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-22 00:27:26,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:27,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-11-22 00:27:27,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:27:27,414 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:27:27,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:27,415 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:27,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295351337] [2022-11-22 00:27:27,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295351337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:27,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:27,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:27:27,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470650081] [2022-11-22 00:27:27,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:27,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:27:27,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:27,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:27:27,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:27:27,416 INFO L87 Difference]: Start difference. First operand 181 states and 418 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:27,785 INFO L93 Difference]: Finished difference Result 224 states and 504 transitions. [2022-11-22 00:27:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:27:27,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:27,787 INFO L225 Difference]: With dead ends: 224 [2022-11-22 00:27:27,787 INFO L226 Difference]: Without dead ends: 224 [2022-11-22 00:27:27,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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:27:27,788 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:27,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:27:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-22 00:27:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 191. [2022-11-22 00:27:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 189 states have (on average 2.291005291005291) internal successors, (433), 190 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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:27:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 433 transitions. [2022-11-22 00:27:27,794 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 433 transitions. Word has length 22 [2022-11-22 00:27:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:27,794 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 433 transitions. [2022-11-22 00:27:27,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 433 transitions. [2022-11-22 00:27:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:27:27,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:27,795 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:27:27,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:27,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:27,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:27,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:27,996 INFO L85 PathProgramCache]: Analyzing trace with hash 86299783, now seen corresponding path program 2 times [2022-11-22 00:27:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:27,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677116797] [2022-11-22 00:27:27,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 00:27:27,997 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:27:27,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:27,998 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:28,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:28,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-22 00:27:28,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:27:28,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-22 00:27:28,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:28,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 74 [2022-11-22 00:27:29,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:27:29,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2022-11-22 00:27:29,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:27:29,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:27:30,022 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:27:30,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:30,023 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:30,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677116797] [2022-11-22 00:27:30,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677116797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:30,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:30,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:27:30,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104790411] [2022-11-22 00:27:30,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:30,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:27:30,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:30,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:27:30,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:27:30,024 INFO L87 Difference]: Start difference. First operand 191 states and 433 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:27:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:30,622 INFO L93 Difference]: Finished difference Result 310 states and 681 transitions. [2022-11-22 00:27:30,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:27:30,622 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:27:30,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:30,623 INFO L225 Difference]: With dead ends: 310 [2022-11-22 00:27:30,623 INFO L226 Difference]: Without dead ends: 310 [2022-11-22 00:27:30,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:27:30,624 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:30,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 5 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:27:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-22 00:27:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 223. [2022-11-22 00:27:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 221 states have (on average 2.3031674208144794) internal successors, (509), 222 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:27:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 509 transitions. [2022-11-22 00:27:30,633 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 509 transitions. Word has length 22 [2022-11-22 00:27:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:30,633 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 509 transitions. [2022-11-22 00:27:30,634 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:27:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 509 transitions. [2022-11-22 00:27:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:27:30,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:30,635 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:27:30,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:30,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:30,848 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:30,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:30,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1936722893, now seen corresponding path program 3 times [2022-11-22 00:27:30,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:30,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320146753] [2022-11-22 00:27:30,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:27:30,849 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:27:30,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:30,850 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:30,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (12)] Waiting until timeout for monitored process [2022-11-22 00:27:31,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 00:27:31,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:27:31,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 00:27:31,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:31,248 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:27:31,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:31,248 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:31,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320146753] [2022-11-22 00:27:31,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320146753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:31,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:31,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:27:31,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707734567] [2022-11-22 00:27:31,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:31,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:27:31,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:31,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:27:31,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:27:31,250 INFO L87 Difference]: Start difference. First operand 223 states and 509 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:31,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:31,526 INFO L93 Difference]: Finished difference Result 299 states and 660 transitions. [2022-11-22 00:27:31,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:27:31,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:31,527 INFO L225 Difference]: With dead ends: 299 [2022-11-22 00:27:31,527 INFO L226 Difference]: Without dead ends: 299 [2022-11-22 00:27:31,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:27:31,528 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:31,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 6 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:27:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-22 00:27:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 232. [2022-11-22 00:27:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 230 states have (on average 2.3043478260869565) internal successors, (530), 231 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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:27:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 530 transitions. [2022-11-22 00:27:31,535 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 530 transitions. Word has length 22 [2022-11-22 00:27:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:31,536 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 530 transitions. [2022-11-22 00:27:31,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 530 transitions. [2022-11-22 00:27:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:27:31,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:31,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:27:31,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (12)] Forceful destruction successful, exit code 0 [2022-11-22 00:27:31,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:31,750 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:31,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash -45048777, now seen corresponding path program 4 times [2022-11-22 00:27:31,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:31,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902286208] [2022-11-22 00:27:31,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:27:31,752 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:27:31,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:31,753 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:31,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (13)] Waiting until timeout for monitored process [2022-11-22 00:27:32,081 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:27:32,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:27:32,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-22 00:27:32,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:32,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 00:27:32,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:27:32,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:27:32,747 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:27:32,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:32,748 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:32,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902286208] [2022-11-22 00:27:32,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902286208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:32,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:32,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:27:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449550052] [2022-11-22 00:27:32,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:32,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:27:32,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:27:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:27:32,749 INFO L87 Difference]: Start difference. First operand 232 states and 530 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:27:33,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:33,381 INFO L93 Difference]: Finished difference Result 363 states and 777 transitions. [2022-11-22 00:27:33,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:27:33,382 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:27:33,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:33,383 INFO L225 Difference]: With dead ends: 363 [2022-11-22 00:27:33,383 INFO L226 Difference]: Without dead ends: 363 [2022-11-22 00:27:33,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:27:33,384 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:33,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 10 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:27:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-11-22 00:27:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 226. [2022-11-22 00:27:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 224 states have (on average 2.299107142857143) internal successors, (515), 225 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:27:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 515 transitions. [2022-11-22 00:27:33,392 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 515 transitions. Word has length 22 [2022-11-22 00:27:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:33,393 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 515 transitions. [2022-11-22 00:27:33,393 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:27:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 515 transitions. [2022-11-22 00:27:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:27:33,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:33,394 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:27:33,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (13)] Forceful destruction successful, exit code 0 [2022-11-22 00:27:33,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:33,615 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:33,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1317153277, now seen corresponding path program 5 times [2022-11-22 00:27:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:33,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550555242] [2022-11-22 00:27:33,617 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-22 00:27:33,618 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:27:33,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:33,619 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:33,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (14)] Waiting until timeout for monitored process [2022-11-22 00:27:33,952 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-22 00:27:33,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:27:33,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-22 00:27:33,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:34,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 00:27:34,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:27:34,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:27:34,662 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:27:34,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:34,662 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:34,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550555242] [2022-11-22 00:27:34,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550555242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:34,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:34,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:27:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105204967] [2022-11-22 00:27:34,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:34,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:27:34,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:34,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:27:34,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:27:34,664 INFO L87 Difference]: Start difference. First operand 226 states and 515 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:27:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:35,292 INFO L93 Difference]: Finished difference Result 281 states and 622 transitions. [2022-11-22 00:27:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:27:35,293 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:27:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:35,294 INFO L225 Difference]: With dead ends: 281 [2022-11-22 00:27:35,294 INFO L226 Difference]: Without dead ends: 281 [2022-11-22 00:27:35,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:27:35,295 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:35,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:27:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-22 00:27:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 219. [2022-11-22 00:27:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 217 states have (on average 2.2857142857142856) internal successors, (496), 218 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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:27:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 496 transitions. [2022-11-22 00:27:35,304 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 496 transitions. Word has length 22 [2022-11-22 00:27:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:35,304 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 496 transitions. [2022-11-22 00:27:35,304 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:27:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 496 transitions. [2022-11-22 00:27:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:27:35,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:35,306 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:27:35,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (14)] Forceful destruction successful, exit code 0 [2022-11-22 00:27:35,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:35,519 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:35,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:35,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1004343103, now seen corresponding path program 6 times [2022-11-22 00:27:35,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:35,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679167848] [2022-11-22 00:27:35,520 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-22 00:27:35,520 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:27:35,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:35,521 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:35,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (15)] Waiting until timeout for monitored process [2022-11-22 00:27:35,919 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-22 00:27:35,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:27:35,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-22 00:27:35,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:36,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 00:27:36,089 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 00:27:36,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-22 00:27:36,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 00:27:36,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 77 [2022-11-22 00:27:36,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2022-11-22 00:27:36,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:27:37,033 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:27:37,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:37,033 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:37,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679167848] [2022-11-22 00:27:37,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679167848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:37,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:37,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 00:27:37,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186079353] [2022-11-22 00:27:37,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:37,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 00:27:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:37,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 00:27:37,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:27:37,035 INFO L87 Difference]: Start difference. First operand 219 states and 496 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:38,359 INFO L93 Difference]: Finished difference Result 376 states and 855 transitions. [2022-11-22 00:27:38,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 00:27:38,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:27:38,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:38,361 INFO L225 Difference]: With dead ends: 376 [2022-11-22 00:27:38,361 INFO L226 Difference]: Without dead ends: 376 [2022-11-22 00:27:38,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-22 00:27:38,362 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:38,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 18 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 00:27:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-22 00:27:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 226. [2022-11-22 00:27:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 224 states have (on average 2.3035714285714284) internal successors, (516), 225 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:27:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 516 transitions. [2022-11-22 00:27:38,370 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 516 transitions. Word has length 22 [2022-11-22 00:27:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:38,370 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 516 transitions. [2022-11-22 00:27:38,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 516 transitions. [2022-11-22 00:27:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:27:38,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:38,372 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:27:38,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (15)] Forceful destruction successful, exit code 0 [2022-11-22 00:27:38,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:38,585 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:38,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:38,586 INFO L85 PathProgramCache]: Analyzing trace with hash -842337873, now seen corresponding path program 7 times [2022-11-22 00:27:38,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:38,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063844826] [2022-11-22 00:27:38,586 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 00:27:38,587 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:27:38,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:38,587 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:38,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (16)] Waiting until timeout for monitored process [2022-11-22 00:27:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:38,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-22 00:27:38,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:39,040 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 00:27:39,040 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:27:39,162 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-22 00:27:39,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-22 00:27:39,293 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-22 00:27:39,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 00:27:39,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 00:27:39,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 00:27:39,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 77 [2022-11-22 00:27:39,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2022-11-22 00:27:40,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:27:40,528 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:27:40,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:40,528 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:40,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063844826] [2022-11-22 00:27:40,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063844826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:40,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:40,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 00:27:40,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739177022] [2022-11-22 00:27:40,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:40,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 00:27:40,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:40,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 00:27:40,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:27:40,531 INFO L87 Difference]: Start difference. First operand 226 states and 516 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:41,921 INFO L93 Difference]: Finished difference Result 305 states and 680 transitions. [2022-11-22 00:27:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 00:27:41,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:27:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:41,923 INFO L225 Difference]: With dead ends: 305 [2022-11-22 00:27:41,923 INFO L226 Difference]: Without dead ends: 305 [2022-11-22 00:27:41,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-11-22 00:27:41,924 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:41,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 10 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 00:27:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-11-22 00:27:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 223. [2022-11-22 00:27:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 221 states have (on average 2.2941176470588234) internal successors, (507), 222 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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:27:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 507 transitions. [2022-11-22 00:27:41,931 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 507 transitions. Word has length 22 [2022-11-22 00:27:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:41,932 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 507 transitions. [2022-11-22 00:27:41,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 507 transitions. [2022-11-22 00:27:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:27:41,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:41,933 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:27:41,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (16)] Ended with exit code 0 [2022-11-22 00:27:42,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:42,147 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:42,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2108551663, now seen corresponding path program 8 times [2022-11-22 00:27:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:42,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406581022] [2022-11-22 00:27:42,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 00:27:42,148 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:27:42,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:42,149 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:42,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (17)] Waiting until timeout for monitored process [2022-11-22 00:27:42,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-22 00:27:42,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:27:42,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-22 00:27:42,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:42,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 00:27:42,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:27:42,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:27:43,181 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:27:43,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:27:43,181 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:27:43,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406581022] [2022-11-22 00:27:43,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406581022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:27:43,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:27:43,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:27:43,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449197025] [2022-11-22 00:27:43,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:27:43,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:27:43,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:27:43,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:27:43,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:27:43,185 INFO L87 Difference]: Start difference. First operand 223 states and 507 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:27:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:43,808 INFO L93 Difference]: Finished difference Result 296 states and 653 transitions. [2022-11-22 00:27:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:27:43,809 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:27:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:43,810 INFO L225 Difference]: With dead ends: 296 [2022-11-22 00:27:43,810 INFO L226 Difference]: Without dead ends: 296 [2022-11-22 00:27:43,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:27:43,811 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:43,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 12 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:27:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-22 00:27:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 216. [2022-11-22 00:27:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 214 states have (on average 2.2803738317757007) internal successors, (488), 215 states have internal predecessors, (488), 0 states have call successors, (0), 0 states 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:27:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 488 transitions. [2022-11-22 00:27:43,817 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 488 transitions. Word has length 22 [2022-11-22 00:27:43,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:43,818 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 488 transitions. [2022-11-22 00:27:43,818 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:27:43,818 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 488 transitions. [2022-11-22 00:27:43,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:27:43,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:43,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:27:43,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (17)] Ended with exit code 0 [2022-11-22 00:27:44,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:44,032 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-22 00:27:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1763983763, now seen corresponding path program 9 times [2022-11-22 00:27:44,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:27:44,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383568207] [2022-11-22 00:27:44,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:27:44,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:27:44,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:27:44,035 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:44,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (18)] Waiting until timeout for monitored process [2022-11-22 00:27:44,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 00:27:44,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-22 00:27:44,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 00:27:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:27:44,694 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-22 00:27:44,694 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 00:27:44,695 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2022-11-22 00:27:44,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2022-11-22 00:27:44,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2022-11-22 00:27:44,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2022-11-22 00:27:44,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2022-11-22 00:27:44,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2022-11-22 00:27:44,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2022-11-22 00:27:44,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2022-11-22 00:27:44,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2022-11-22 00:27:44,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2022-11-22 00:27:44,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2022-11-22 00:27:44,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2022-11-22 00:27:44,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2022-11-22 00:27:44,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2022-11-22 00:27:44,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2022-11-22 00:27:44,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2022-11-22 00:27:44,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2022-11-22 00:27:44,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2022-11-22 00:27:44,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2022-11-22 00:27:44,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2022-11-22 00:27:44,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2022-11-22 00:27:44,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2022-11-22 00:27:44,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2022-11-22 00:27:44,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2022-11-22 00:27:44,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2022-11-22 00:27:44,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2022-11-22 00:27:44,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2022-11-22 00:27:44,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2022-11-22 00:27:44,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2022-11-22 00:27:44,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2022-11-22 00:27:44,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2022-11-22 00:27:44,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2022-11-22 00:27:44,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2022-11-22 00:27:44,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2022-11-22 00:27:44,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2022-11-22 00:27:44,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2022-11-22 00:27:44,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2022-11-22 00:27:44,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2022-11-22 00:27:44,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2022-11-22 00:27:44,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2022-11-22 00:27:44,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2022-11-22 00:27:44,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2022-11-22 00:27:44,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2022-11-22 00:27:44,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2022-11-22 00:27:44,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2022-11-22 00:27:44,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2022-11-22 00:27:44,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2022-11-22 00:27:44,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2022-11-22 00:27:44,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2022-11-22 00:27:44,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2022-11-22 00:27:44,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2022-11-22 00:27:44,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2022-11-22 00:27:44,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2022-11-22 00:27:44,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2022-11-22 00:27:44,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2022-11-22 00:27:44,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2022-11-22 00:27:44,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2022-11-22 00:27:44,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2022-11-22 00:27:44,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2022-11-22 00:27:44,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2022-11-22 00:27:44,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2022-11-22 00:27:44,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2022-11-22 00:27:44,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2022-11-22 00:27:44,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2022-11-22 00:27:44,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2022-11-22 00:27:44,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2022-11-22 00:27:44,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2022-11-22 00:27:44,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2022-11-22 00:27:44,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2022-11-22 00:27:44,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2022-11-22 00:27:44,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2022-11-22 00:27:44,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2022-11-22 00:27:44,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2022-11-22 00:27:44,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2022-11-22 00:27:44,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2022-11-22 00:27:44,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2022-11-22 00:27:44,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2022-11-22 00:27:44,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2022-11-22 00:27:44,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2022-11-22 00:27:44,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2022-11-22 00:27:44,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2022-11-22 00:27:44,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2022-11-22 00:27:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2022-11-22 00:27:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2022-11-22 00:27:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2022-11-22 00:27:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2022-11-22 00:27:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2022-11-22 00:27:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2022-11-22 00:27:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2022-11-22 00:27:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2022-11-22 00:27:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2022-11-22 00:27:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2022-11-22 00:27:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2022-11-22 00:27:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2022-11-22 00:27:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2022-11-22 00:27:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2022-11-22 00:27:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2022-11-22 00:27:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2022-11-22 00:27:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2022-11-22 00:27:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2022-11-22 00:27:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2022-11-22 00:27:44,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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 (18)] Ended with exit code 0 [2022-11-22 00:27:44,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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:27:44,965 INFO L444 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:27:44,971 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 00:27:44,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:27:45,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:27:45 BasicIcfg [2022-11-22 00:27:45,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:27:45,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:27:45,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:27:45,126 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:27:45,126 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:25:50" (3/4) ... [2022-11-22 00:27:45,129 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 00:27:45,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:27:45,131 INFO L158 Benchmark]: Toolchain (without parser) took 117082.22ms. Allocated memory was 71.3MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 48.4MB in the beginning and 970.0MB in the end (delta: -921.6MB). Peak memory consumption was 716.4MB. Max. memory is 16.1GB. [2022-11-22 00:27:45,131 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 71.3MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:27:45,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 746.87ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 42.2MB in the end (delta: 6.0MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2022-11-22 00:27:45,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.76ms. Allocated memory is still 71.3MB. Free memory was 42.2MB in the beginning and 39.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:27:45,132 INFO L158 Benchmark]: Boogie Preprocessor took 39.48ms. Allocated memory is still 71.3MB. Free memory was 39.6MB in the beginning and 36.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:27:45,134 INFO L158 Benchmark]: RCFGBuilder took 1915.56ms. Allocated memory was 71.3MB in the beginning and 111.1MB in the end (delta: 39.8MB). Free memory was 36.7MB in the beginning and 51.8MB in the end (delta: -15.1MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2022-11-22 00:27:45,135 INFO L158 Benchmark]: TraceAbstraction took 114303.27ms. Allocated memory was 111.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 50.9MB in the beginning and 971.0MB in the end (delta: -920.1MB). Peak memory consumption was 677.6MB. Max. memory is 16.1GB. [2022-11-22 00:27:45,135 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 1.7GB. Free memory is still 970.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:27:45,137 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 71.3MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 746.87ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 42.2MB in the end (delta: 6.0MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.76ms. Allocated memory is still 71.3MB. Free memory was 42.2MB in the beginning and 39.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.48ms. Allocated memory is still 71.3MB. Free memory was 39.6MB in the beginning and 36.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1915.56ms. Allocated memory was 71.3MB in the beginning and 111.1MB in the end (delta: 39.8MB). Free memory was 36.7MB in the beginning and 51.8MB in the end (delta: -15.1MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. * TraceAbstraction took 114303.27ms. Allocated memory was 111.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 50.9MB in the beginning and 971.0MB in the end (delta: -920.1MB). Peak memory consumption was 677.6MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 1.7GB. Free memory is still 970.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: 80.0s, 205 PlacesBefore, 100 PlacesAfterwards, 197 TransitionsBefore, 91 TransitionsAfterwards, 9024 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 121 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 199 TotalNumberOfCompositions, 44861 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16505, independent: 15889, independent conditional: 0, independent unconditional: 15889, dependent: 510, dependent conditional: 0, dependent unconditional: 510, unknown: 106, unknown conditional: 0, unknown unconditional: 106] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6491, independent: 6393, independent conditional: 0, independent unconditional: 6393, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6491, independent: 4961, independent conditional: 0, independent unconditional: 4961, dependent: 1530, dependent conditional: 0, dependent unconditional: 1530, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1530, independent: 1432, independent conditional: 0, independent unconditional: 1432, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7780, independent: 6412, independent conditional: 0, independent unconditional: 6412, dependent: 1085, dependent conditional: 0, dependent unconditional: 1085, unknown: 283, unknown conditional: 0, unknown unconditional: 283] ], Cache Queries: [ total: 16505, independent: 9496, independent conditional: 0, independent unconditional: 9496, dependent: 419, dependent conditional: 0, dependent unconditional: 419, unknown: 6590, unknown conditional: 0, unknown unconditional: 6590] , Statistics on independence cache: Total cache size (in pairs): 883, Positive cache size: 841, Positive conditional cache size: 0, Positive unconditional cache size: 841, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2112; [L853] FCALL, FORK 0 pthread_create(&t2112, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2112, ((void *)0), P0, ((void *)0))=-2, t2112={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] 0 pthread_t t2113; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2112={15:0}, t2113={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] FCALL, FORK 0 pthread_create(&t2113, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2113, ((void *)0), P1, ((void *)0))=-1, t2112={15:0}, t2113={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] 0 pthread_t t2114; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2112={15:0}, t2113={5:0}, t2114={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] FCALL, FORK 0 pthread_create(&t2114, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2114, ((void *)0), P2, ((void *)0))=0, t2112={15:0}, t2113={5:0}, t2114={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] EXPR 3 \read(x) [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L814] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L815] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L816] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L817] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L819] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L821] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L822] EXPR 3 \read(x) [L822] 3 __unbuffered_p2_EAX = x [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] EXPR 3 \read(x) [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] 3 x = x$flush_delayed ? x$mem_tmp : x [L824] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=7, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L827] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=7, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L833] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=7, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L761] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=6, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=6, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=6, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 \read(x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=1, main$tmp_guard1=0, t2112={15:0}, t2113={5:0}, t2114={7:0}, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 x$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(x) [L873] 0 x$mem_tmp = x [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] EXPR 0 \read(x) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 \read(x) [L883] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] 0 x = x$flush_delayed ? x$mem_tmp : x [L885] 0 x$flush_delayed = (_Bool)0 [L887] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=128, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 857]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 258 locations, 101 error locations. Started 1 CEGAR loops. OverallTime: 113.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.5s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 83.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 478 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1971 IncrementalHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 55 mSDtfsCounter, 1971 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119052occurred in iteration=0, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 698 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 256 ConstructedInterpolants, 5 QuantifiedInterpolants, 4887 SizeOfPredicates, 72 NumberOfNonLiveVariables, 2967 ConjunctsInSsa, 263 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:27:45,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda874c-f76a-4cf6-a07b-dbd63d259680/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