./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0 --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 eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 20:02:11,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 20:02:11,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 20:02:11,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 20:02:11,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 20:02:11,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 20:02:11,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 20:02:11,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 20:02:11,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 20:02:11,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 20:02:11,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 20:02:11,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 20:02:11,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 20:02:11,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 20:02:11,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 20:02:11,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 20:02:11,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 20:02:11,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 20:02:11,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 20:02:11,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 20:02:11,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 20:02:11,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 20:02:11,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 20:02:11,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 20:02:11,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 20:02:11,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 20:02:11,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 20:02:11,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 20:02:11,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 20:02:11,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 20:02:11,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 20:02:11,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 20:02:11,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 20:02:11,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 20:02:11,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 20:02:11,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 20:02:11,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 20:02:11,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 20:02:11,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 20:02:11,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 20:02:11,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 20:02:11,673 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-16 20:02:11,718 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 20:02:11,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 20:02:11,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 20:02:11,719 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 20:02:11,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 20:02:11,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 20:02:11,720 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 20:02:11,720 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 20:02:11,721 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 20:02:11,721 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 20:02:11,722 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 20:02:11,722 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 20:02:11,722 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 20:02:11,722 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 20:02:11,722 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 20:02:11,723 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 20:02:11,723 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 20:02:11,723 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 20:02:11,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 20:02:11,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 20:02:11,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 20:02:11,726 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 20:02:11,726 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 20:02:11,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 20:02:11,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 20:02:11,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 20:02:11,727 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 20:02:11,727 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 20:02:11,727 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 20:02:11,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 20:02:11,728 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 20:02:11,728 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 20:02:11,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 20:02:11,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 20:02:11,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 20:02:11,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:02:11,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 20:02:11,729 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 20:02:11,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 20:02:11,729 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 20:02:11,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 20:02:11,729 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 20:02:11,730 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_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/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_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0 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 -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2022-11-16 20:02:12,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 20:02:12,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 20:02:12,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 20:02:12,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 20:02:12,114 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 20:02:12,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-11-16 20:02:12,205 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/data/f3676c019/4c631c7cc4184ef2acf30f977b96f478/FLAG40d8131ea [2022-11-16 20:02:12,818 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 20:02:12,826 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-11-16 20:02:12,850 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/data/f3676c019/4c631c7cc4184ef2acf30f977b96f478/FLAG40d8131ea [2022-11-16 20:02:13,079 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/data/f3676c019/4c631c7cc4184ef2acf30f977b96f478 [2022-11-16 20:02:13,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 20:02:13,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 20:02:13,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 20:02:13,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 20:02:13,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 20:02:13,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:13,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c4c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13, skipping insertion in model container [2022-11-16 20:02:13,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:13,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 20:02:13,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 20:02:13,462 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2022-11-16 20:02:13,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:02:13,774 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 20:02:13,794 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2022-11-16 20:02:13,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:02:13,877 INFO L208 MainTranslator]: Completed translation [2022-11-16 20:02:13,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13 WrapperNode [2022-11-16 20:02:13,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 20:02:13,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 20:02:13,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 20:02:13,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 20:02:13,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:13,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:13,979 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-11-16 20:02:13,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 20:02:13,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 20:02:13,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 20:02:13,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 20:02:13,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:13,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:13,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:13,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:14,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:14,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:14,013 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:14,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:14,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 20:02:14,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 20:02:14,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 20:02:14,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 20:02:14,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (1/1) ... [2022-11-16 20:02:14,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:02:14,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:02:14,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 20:02:14,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 20:02:14,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 20:02:14,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 20:02:14,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 20:02:14,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 20:02:14,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 20:02:14,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 20:02:14,148 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 20:02:14,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 20:02:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 20:02:14,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 20:02:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 20:02:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 20:02:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 20:02:14,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 20:02:14,153 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 20:02:14,400 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 20:02:14,403 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 20:02:15,069 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 20:02:15,837 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 20:02:15,837 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 20:02:15,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:02:15 BoogieIcfgContainer [2022-11-16 20:02:15,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 20:02:15,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 20:02:15,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 20:02:15,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 20:02:15,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:02:13" (1/3) ... [2022-11-16 20:02:15,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545a9707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:02:15, skipping insertion in model container [2022-11-16 20:02:15,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:13" (2/3) ... [2022-11-16 20:02:15,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545a9707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:02:15, skipping insertion in model container [2022-11-16 20:02:15,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:02:15" (3/3) ... [2022-11-16 20:02:15,855 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2022-11-16 20:02:15,878 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 20:02:15,878 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-11-16 20:02:15,880 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 20:02:16,060 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 20:02:16,108 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 20:02:16,126 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 150 transitions, 310 flow [2022-11-16 20:02:16,132 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 150 transitions, 310 flow [2022-11-16 20:02:16,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 150 transitions, 310 flow [2022-11-16 20:02:16,267 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-11-16 20:02:16,267 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 20:02:16,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 198 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-16 20:02:16,277 INFO L119 LiptonReduction]: Number of co-enabled transitions 3984 [2022-11-16 20:02:37,980 INFO L134 LiptonReduction]: Checked pairs total: 16834 [2022-11-16 20:02:37,980 INFO L136 LiptonReduction]: Total number of compositions: 137 [2022-11-16 20:02:37,990 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 57 transitions, 124 flow [2022-11-16 20:02:38,111 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:38,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 20:02:38,136 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;@df73743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 20:02:38,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-16 20:02:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 20:02:38,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:38,152 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 20:02:38,153 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:38,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1007, now seen corresponding path program 1 times [2022-11-16 20:02:38,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:38,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478607918] [2022-11-16 20:02:38,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:38,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:38,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:38,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478607918] [2022-11-16 20:02:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478607918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:38,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:38,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 20:02:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625271762] [2022-11-16 20:02:38,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:38,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 20:02:38,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:38,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 20:02:38,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 20:02:38,357 INFO L87 Difference]: Start difference. First operand has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:38,511 INFO L93 Difference]: Finished difference Result 1568 states and 4263 transitions. [2022-11-16 20:02:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 20:02:38,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-16 20:02:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:38,543 INFO L225 Difference]: With dead ends: 1568 [2022-11-16 20:02:38,543 INFO L226 Difference]: Without dead ends: 1568 [2022-11-16 20:02:38,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 20:02:38,548 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 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-16 20:02:38,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:02:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2022-11-16 20:02:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2022-11-16 20:02:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1191 states have (on average 3.579345088161209) internal successors, (4263), 1567 states have internal predecessors, (4263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 4263 transitions. [2022-11-16 20:02:38,691 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 4263 transitions. Word has length 1 [2022-11-16 20:02:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:38,692 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 4263 transitions. [2022-11-16 20:02:38,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 4263 transitions. [2022-11-16 20:02:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-16 20:02:38,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:38,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-16 20:02:38,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 20:02:38,693 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash 30774871, now seen corresponding path program 1 times [2022-11-16 20:02:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:38,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842270822] [2022-11-16 20:02:38,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:39,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:39,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842270822] [2022-11-16 20:02:39,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842270822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:39,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:39,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 20:02:39,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885864131] [2022-11-16 20:02:39,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:39,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:02:39,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:39,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:02:39,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:02:39,048 INFO L87 Difference]: Start difference. First operand 1568 states and 4263 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-16 20:02:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:39,217 INFO L93 Difference]: Finished difference Result 1411 states and 3820 transitions. [2022-11-16 20:02:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:02:39,217 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-16 20:02:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:39,268 INFO L225 Difference]: With dead ends: 1411 [2022-11-16 20:02:39,274 INFO L226 Difference]: Without dead ends: 1411 [2022-11-16 20:02:39,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:02:39,276 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:39,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:02:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-11-16 20:02:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411. [2022-11-16 20:02:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1097 states have (on average 3.4822242479489516) internal successors, (3820), 1410 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 3820 transitions. [2022-11-16 20:02:39,331 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 3820 transitions. Word has length 4 [2022-11-16 20:02:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:39,331 INFO L495 AbstractCegarLoop]: Abstraction has 1411 states and 3820 transitions. [2022-11-16 20:02:39,331 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-16 20:02:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 3820 transitions. [2022-11-16 20:02:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 20:02:39,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:39,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 20:02:39,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 20:02:39,334 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:39,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash 954021833, now seen corresponding path program 1 times [2022-11-16 20:02:39,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:39,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111424996] [2022-11-16 20:02:39,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:39,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:39,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:39,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111424996] [2022-11-16 20:02:39,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111424996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:39,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:39,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:02:39,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373157753] [2022-11-16 20:02:39,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:39,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:02:39,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:39,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:02:39,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:02:39,476 INFO L87 Difference]: Start difference. First operand 1411 states and 3820 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:39,712 INFO L93 Difference]: Finished difference Result 1777 states and 4817 transitions. [2022-11-16 20:02:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:02:39,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 20:02:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:39,725 INFO L225 Difference]: With dead ends: 1777 [2022-11-16 20:02:39,725 INFO L226 Difference]: Without dead ends: 1777 [2022-11-16 20:02:39,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:02:39,726 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:39,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:02:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2022-11-16 20:02:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1505. [2022-11-16 20:02:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1207 states have (on average 3.591549295774648) internal successors, (4335), 1504 states have internal predecessors, (4335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 4335 transitions. [2022-11-16 20:02:39,779 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 4335 transitions. Word has length 5 [2022-11-16 20:02:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:39,780 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 4335 transitions. [2022-11-16 20:02:39,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 4335 transitions. [2022-11-16 20:02:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 20:02:39,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:39,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 20:02:39,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 20:02:39,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash 954021835, now seen corresponding path program 1 times [2022-11-16 20:02:39,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:39,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933467216] [2022-11-16 20:02:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:39,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:40,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:40,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933467216] [2022-11-16 20:02:40,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933467216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:40,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:40,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:02:40,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71420084] [2022-11-16 20:02:40,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:40,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:02:40,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:40,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:02:40,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:02:40,062 INFO L87 Difference]: Start difference. First operand 1505 states and 4335 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:40,266 INFO L93 Difference]: Finished difference Result 906 states and 2496 transitions. [2022-11-16 20:02:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:02:40,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 20:02:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:40,272 INFO L225 Difference]: With dead ends: 906 [2022-11-16 20:02:40,272 INFO L226 Difference]: Without dead ends: 906 [2022-11-16 20:02:40,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:02:40,274 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:40,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:02:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-11-16 20:02:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2022-11-16 20:02:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 779 states have (on average 3.20410783055199) internal successors, (2496), 905 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 2496 transitions. [2022-11-16 20:02:40,302 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 2496 transitions. Word has length 5 [2022-11-16 20:02:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:40,303 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 2496 transitions. [2022-11-16 20:02:40,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 2496 transitions. [2022-11-16 20:02:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 20:02:40,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:40,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 20:02:40,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 20:02:40,304 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:40,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:40,305 INFO L85 PathProgramCache]: Analyzing trace with hash 954021836, now seen corresponding path program 1 times [2022-11-16 20:02:40,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:40,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804921259] [2022-11-16 20:02:40,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:40,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:40,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:40,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804921259] [2022-11-16 20:02:40,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804921259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:40,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:40,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:02:40,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756957428] [2022-11-16 20:02:40,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:40,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:02:40,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:40,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:02:40,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:02:40,600 INFO L87 Difference]: Start difference. First operand 906 states and 2496 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:40,754 INFO L93 Difference]: Finished difference Result 413 states and 1048 transitions. [2022-11-16 20:02:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:02:40,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 20:02:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:40,757 INFO L225 Difference]: With dead ends: 413 [2022-11-16 20:02:40,757 INFO L226 Difference]: Without dead ends: 413 [2022-11-16 20:02:40,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:02:40,759 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 59 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:40,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 2 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:02:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-16 20:02:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 390. [2022-11-16 20:02:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 364 states have (on average 2.7225274725274726) internal successors, (991), 389 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 991 transitions. [2022-11-16 20:02:40,786 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 991 transitions. Word has length 5 [2022-11-16 20:02:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:40,786 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 991 transitions. [2022-11-16 20:02:40,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 991 transitions. [2022-11-16 20:02:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 20:02:40,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:40,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:40,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 20:02:40,788 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2026098042, now seen corresponding path program 1 times [2022-11-16 20:02:40,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:40,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386716451] [2022-11-16 20:02:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:40,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:40,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:40,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386716451] [2022-11-16 20:02:40,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386716451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:40,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:40,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 20:02:40,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001191424] [2022-11-16 20:02:40,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:40,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:02:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:40,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:02:40,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:02:40,863 INFO L87 Difference]: Start difference. First operand 390 states and 991 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:40,955 INFO L93 Difference]: Finished difference Result 380 states and 963 transitions. [2022-11-16 20:02:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:02:40,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-16 20:02:40,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:40,958 INFO L225 Difference]: With dead ends: 380 [2022-11-16 20:02:40,958 INFO L226 Difference]: Without dead ends: 380 [2022-11-16 20:02:40,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:02:40,960 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:40,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:02:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-16 20:02:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-16 20:02:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 354 states have (on average 2.7203389830508473) internal successors, (963), 379 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 963 transitions. [2022-11-16 20:02:40,979 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 963 transitions. Word has length 7 [2022-11-16 20:02:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:40,979 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 963 transitions. [2022-11-16 20:02:40,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 963 transitions. [2022-11-16 20:02:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 20:02:40,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:40,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:40,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 20:02:40,981 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:40,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:40,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1615516674, now seen corresponding path program 1 times [2022-11-16 20:02:40,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:40,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892139418] [2022-11-16 20:02:40,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:40,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:41,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:41,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892139418] [2022-11-16 20:02:41,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892139418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:41,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:41,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:02:41,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745923217] [2022-11-16 20:02:41,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:41,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:02:41,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:41,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:02:41,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:02:41,875 INFO L87 Difference]: Start difference. First operand 380 states and 963 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:42,085 INFO L93 Difference]: Finished difference Result 524 states and 1294 transitions. [2022-11-16 20:02:42,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:02:42,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 20:02:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:42,089 INFO L225 Difference]: With dead ends: 524 [2022-11-16 20:02:42,089 INFO L226 Difference]: Without dead ends: 524 [2022-11-16 20:02:42,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:02:42,090 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:42,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 6 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:02:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-11-16 20:02:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 390. [2022-11-16 20:02:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 364 states have (on average 2.7335164835164836) internal successors, (995), 389 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 995 transitions. [2022-11-16 20:02:42,105 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 995 transitions. Word has length 8 [2022-11-16 20:02:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:42,106 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 995 transitions. [2022-11-16 20:02:42,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 995 transitions. [2022-11-16 20:02:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 20:02:42,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:42,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:42,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 20:02:42,111 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1615516673, now seen corresponding path program 1 times [2022-11-16 20:02:42,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:42,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81246963] [2022-11-16 20:02:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:42,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-16 20:02:42,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:42,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81246963] [2022-11-16 20:02:42,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81246963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:42,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:42,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:02:42,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699308211] [2022-11-16 20:02:42,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:42,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:02:42,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:42,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:02:42,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:02:42,283 INFO L87 Difference]: Start difference. First operand 390 states and 995 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:42,380 INFO L93 Difference]: Finished difference Result 504 states and 1262 transitions. [2022-11-16 20:02:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:02:42,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 20:02:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:42,383 INFO L225 Difference]: With dead ends: 504 [2022-11-16 20:02:42,383 INFO L226 Difference]: Without dead ends: 504 [2022-11-16 20:02:42,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:02:42,384 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:42,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:02:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-11-16 20:02:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 370. [2022-11-16 20:02:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 345 states have (on average 2.701449275362319) internal successors, (932), 369 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 932 transitions. [2022-11-16 20:02:42,397 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 932 transitions. Word has length 8 [2022-11-16 20:02:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:42,397 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 932 transitions. [2022-11-16 20:02:42,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 932 transitions. [2022-11-16 20:02:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 20:02:42,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:42,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:42,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 20:02:42,399 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1615469208, now seen corresponding path program 1 times [2022-11-16 20:02:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:42,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885723423] [2022-11-16 20:02:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:42,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:42,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885723423] [2022-11-16 20:02:42,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885723423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:42,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:42,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 20:02:42,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006313015] [2022-11-16 20:02:42,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:42,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:02:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:42,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:02:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:02:42,569 INFO L87 Difference]: Start difference. First operand 370 states and 932 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:42,658 INFO L93 Difference]: Finished difference Result 365 states and 918 transitions. [2022-11-16 20:02:42,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:02:42,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 20:02:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:42,660 INFO L225 Difference]: With dead ends: 365 [2022-11-16 20:02:42,661 INFO L226 Difference]: Without dead ends: 365 [2022-11-16 20:02:42,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:02:42,661 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:42,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:02:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-16 20:02:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-11-16 20:02:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 340 states have (on average 2.7) internal successors, (918), 364 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 918 transitions. [2022-11-16 20:02:42,673 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 918 transitions. Word has length 8 [2022-11-16 20:02:42,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:42,673 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 918 transitions. [2022-11-16 20:02:42,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:42,674 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 918 transitions. [2022-11-16 20:02:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 20:02:42,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:42,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 20:02:42,675 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:42,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1203112750, now seen corresponding path program 1 times [2022-11-16 20:02:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:42,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462249410] [2022-11-16 20:02:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:42,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:42,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462249410] [2022-11-16 20:02:42,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462249410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:42,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:42,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:02:42,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158626577] [2022-11-16 20:02:42,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:42,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:02:42,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:42,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:02:42,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:02:42,895 INFO L87 Difference]: Start difference. First operand 365 states and 918 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:43,035 INFO L93 Difference]: Finished difference Result 361 states and 906 transitions. [2022-11-16 20:02:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:02:43,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-16 20:02:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:43,038 INFO L225 Difference]: With dead ends: 361 [2022-11-16 20:02:43,038 INFO L226 Difference]: Without dead ends: 361 [2022-11-16 20:02:43,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:02:43,039 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:43,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:02:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-16 20:02:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2022-11-16 20:02:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 336 states have (on average 2.6964285714285716) internal successors, (906), 360 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 906 transitions. [2022-11-16 20:02:43,050 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 906 transitions. Word has length 9 [2022-11-16 20:02:43,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:43,050 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 906 transitions. [2022-11-16 20:02:43,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 906 transitions. [2022-11-16 20:02:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 20:02:43,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:43,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:43,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 20:02:43,052 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:43,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:43,053 INFO L85 PathProgramCache]: Analyzing trace with hash 184298592, now seen corresponding path program 1 times [2022-11-16 20:02:43,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:43,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926005770] [2022-11-16 20:02:43,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:43,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:43,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926005770] [2022-11-16 20:02:43,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926005770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:43,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:43,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:02:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390173018] [2022-11-16 20:02:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:43,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:02:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:02:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:02:43,374 INFO L87 Difference]: Start difference. First operand 361 states and 906 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:43,459 INFO L93 Difference]: Finished difference Result 349 states and 877 transitions. [2022-11-16 20:02:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:02:43,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 20:02:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:43,462 INFO L225 Difference]: With dead ends: 349 [2022-11-16 20:02:43,462 INFO L226 Difference]: Without dead ends: 349 [2022-11-16 20:02:43,462 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-16 20:02:43,463 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:43,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:02:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-16 20:02:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 325. [2022-11-16 20:02:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 301 states have (on average 2.7209302325581395) internal successors, (819), 324 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 819 transitions. [2022-11-16 20:02:43,473 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 819 transitions. Word has length 10 [2022-11-16 20:02:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:43,474 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 819 transitions. [2022-11-16 20:02:43,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 819 transitions. [2022-11-16 20:02:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 20:02:43,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:43,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:43,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 20:02:43,475 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:43,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1356739898, now seen corresponding path program 1 times [2022-11-16 20:02:43,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:43,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453358126] [2022-11-16 20:02:43,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:43,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:43,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453358126] [2022-11-16 20:02:43,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453358126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:43,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:43,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:02:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910742431] [2022-11-16 20:02:43,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:43,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:02:43,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:43,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:02:43,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:02:43,678 INFO L87 Difference]: Start difference. First operand 325 states and 819 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:43,782 INFO L93 Difference]: Finished difference Result 473 states and 1176 transitions. [2022-11-16 20:02:43,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:02:43,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 20:02:43,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:43,789 INFO L225 Difference]: With dead ends: 473 [2022-11-16 20:02:43,789 INFO L226 Difference]: Without dead ends: 473 [2022-11-16 20:02:43,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:02:43,790 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:43,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:02:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-11-16 20:02:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 360. [2022-11-16 20:02:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 336 states have (on average 2.6845238095238093) internal successors, (902), 359 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 902 transitions. [2022-11-16 20:02:43,801 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 902 transitions. Word has length 10 [2022-11-16 20:02:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:43,802 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 902 transitions. [2022-11-16 20:02:43,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 902 transitions. [2022-11-16 20:02:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 20:02:43,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:43,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:43,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 20:02:43,803 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:43,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1982708441, now seen corresponding path program 1 times [2022-11-16 20:02:43,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:43,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515975422] [2022-11-16 20:02:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:43,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:43,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:43,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515975422] [2022-11-16 20:02:43,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515975422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:43,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:43,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:02:43,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908893622] [2022-11-16 20:02:43,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:43,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:02:43,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:43,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:02:43,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:02:43,987 INFO L87 Difference]: Start difference. First operand 360 states and 902 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:44,156 INFO L93 Difference]: Finished difference Result 506 states and 1282 transitions. [2022-11-16 20:02:44,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:02:44,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 20:02:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:44,159 INFO L225 Difference]: With dead ends: 506 [2022-11-16 20:02:44,159 INFO L226 Difference]: Without dead ends: 486 [2022-11-16 20:02:44,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:02:44,160 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6 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-16 20:02:44,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:02:44,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-11-16 20:02:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-11-16 20:02:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 462 states have (on average 2.632034632034632) internal successors, (1216), 485 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1216 transitions. [2022-11-16 20:02:44,174 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1216 transitions. Word has length 10 [2022-11-16 20:02:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:44,174 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 1216 transitions. [2022-11-16 20:02:44,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1216 transitions. [2022-11-16 20:02:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 20:02:44,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:44,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:44,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 20:02:44,176 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:44,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1982708481, now seen corresponding path program 1 times [2022-11-16 20:02:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:44,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218125937] [2022-11-16 20:02:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:44,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:44,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:44,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218125937] [2022-11-16 20:02:44,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218125937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:44,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:44,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:02:44,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174178395] [2022-11-16 20:02:44,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:44,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:02:44,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:44,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:02:44,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:02:44,323 INFO L87 Difference]: Start difference. First operand 486 states and 1216 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:44,453 INFO L93 Difference]: Finished difference Result 248 states and 455 transitions. [2022-11-16 20:02:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:02:44,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 20:02:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:44,455 INFO L225 Difference]: With dead ends: 248 [2022-11-16 20:02:44,455 INFO L226 Difference]: Without dead ends: 195 [2022-11-16 20:02:44,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:02:44,456 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:44,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:02:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-16 20:02:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-11-16 20:02:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.8688524590163935) internal successors, (342), 194 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 342 transitions. [2022-11-16 20:02:44,461 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 342 transitions. Word has length 10 [2022-11-16 20:02:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:44,461 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 342 transitions. [2022-11-16 20:02:44,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 342 transitions. [2022-11-16 20:02:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 20:02:44,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:44,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:44,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 20:02:44,463 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:44,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1665615727, now seen corresponding path program 1 times [2022-11-16 20:02:44,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:44,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392541418] [2022-11-16 20:02:44,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:44,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:02:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:02:44,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:02:44,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392541418] [2022-11-16 20:02:44,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392541418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:02:44,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:02:44,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:02:44,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101303050] [2022-11-16 20:02:44,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:02:44,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:02:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:02:44,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:02:44,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:02:44,744 INFO L87 Difference]: Start difference. First operand 195 states and 342 transitions. Second operand has 5 states, 5 states have (on average 2.6) 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-16 20:02:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:02:44,850 INFO L93 Difference]: Finished difference Result 106 states and 165 transitions. [2022-11-16 20:02:44,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:02:44,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) 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-16 20:02:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:02:44,852 INFO L225 Difference]: With dead ends: 106 [2022-11-16 20:02:44,852 INFO L226 Difference]: Without dead ends: 62 [2022-11-16 20:02:44,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:02:44,852 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:02:44,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 8 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:02:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-16 20:02:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-16 20:02:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:02:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2022-11-16 20:02:44,855 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 13 [2022-11-16 20:02:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:02:44,855 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2022-11-16 20:02:44,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) 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-16 20:02:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2022-11-16 20:02:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 20:02:44,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:02:44,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:44,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 20:02:44,856 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:02:44,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:02:44,857 INFO L85 PathProgramCache]: Analyzing trace with hash 663346817, now seen corresponding path program 1 times [2022-11-16 20:02:44,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:02:44,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606779306] [2022-11-16 20:02:44,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:02:44,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:02:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:02:44,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 20:02:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:02:45,084 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 20:02:45,084 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 20:02:45,085 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2022-11-16 20:02:45,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (62 of 64 remaining) [2022-11-16 20:02:45,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 64 remaining) [2022-11-16 20:02:45,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 64 remaining) [2022-11-16 20:02:45,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 64 remaining) [2022-11-16 20:02:45,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 64 remaining) [2022-11-16 20:02:45,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 64 remaining) [2022-11-16 20:02:45,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 64 remaining) [2022-11-16 20:02:45,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 64 remaining) [2022-11-16 20:02:45,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 64 remaining) [2022-11-16 20:02:45,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 64 remaining) [2022-11-16 20:02:45,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 64 remaining) [2022-11-16 20:02:45,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 64 remaining) [2022-11-16 20:02:45,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 64 remaining) [2022-11-16 20:02:45,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 64 remaining) [2022-11-16 20:02:45,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 64 remaining) [2022-11-16 20:02:45,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 64 remaining) [2022-11-16 20:02:45,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 64 remaining) [2022-11-16 20:02:45,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 64 remaining) [2022-11-16 20:02:45,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 64 remaining) [2022-11-16 20:02:45,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 64 remaining) [2022-11-16 20:02:45,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 64 remaining) [2022-11-16 20:02:45,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 64 remaining) [2022-11-16 20:02:45,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 64 remaining) [2022-11-16 20:02:45,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 64 remaining) [2022-11-16 20:02:45,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 64 remaining) [2022-11-16 20:02:45,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 64 remaining) [2022-11-16 20:02:45,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 64 remaining) [2022-11-16 20:02:45,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 64 remaining) [2022-11-16 20:02:45,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 64 remaining) [2022-11-16 20:02:45,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 64 remaining) [2022-11-16 20:02:45,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 64 remaining) [2022-11-16 20:02:45,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 64 remaining) [2022-11-16 20:02:45,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 64 remaining) [2022-11-16 20:02:45,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 64 remaining) [2022-11-16 20:02:45,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 64 remaining) [2022-11-16 20:02:45,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (27 of 64 remaining) [2022-11-16 20:02:45,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 64 remaining) [2022-11-16 20:02:45,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 64 remaining) [2022-11-16 20:02:45,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 64 remaining) [2022-11-16 20:02:45,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 64 remaining) [2022-11-16 20:02:45,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 64 remaining) [2022-11-16 20:02:45,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 64 remaining) [2022-11-16 20:02:45,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 64 remaining) [2022-11-16 20:02:45,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 64 remaining) [2022-11-16 20:02:45,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 64 remaining) [2022-11-16 20:02:45,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 64 remaining) [2022-11-16 20:02:45,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 64 remaining) [2022-11-16 20:02:45,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 64 remaining) [2022-11-16 20:02:45,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 64 remaining) [2022-11-16 20:02:45,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 64 remaining) [2022-11-16 20:02:45,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 64 remaining) [2022-11-16 20:02:45,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 64 remaining) [2022-11-16 20:02:45,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 64 remaining) [2022-11-16 20:02:45,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 64 remaining) [2022-11-16 20:02:45,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 64 remaining) [2022-11-16 20:02:45,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 64 remaining) [2022-11-16 20:02:45,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 64 remaining) [2022-11-16 20:02:45,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 64 remaining) [2022-11-16 20:02:45,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 64 remaining) [2022-11-16 20:02:45,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 64 remaining) [2022-11-16 20:02:45,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 64 remaining) [2022-11-16 20:02:45,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 64 remaining) [2022-11-16 20:02:45,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 64 remaining) [2022-11-16 20:02:45,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 20:02:45,102 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:02:45,107 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 20:02:45,107 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 20:02:45,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:02:45 BasicIcfg [2022-11-16 20:02:45,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 20:02:45,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 20:02:45,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 20:02:45,185 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 20:02:45,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:02:15" (3/4) ... [2022-11-16 20:02:45,188 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 20:02:45,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 20:02:45,188 INFO L158 Benchmark]: Toolchain (without parser) took 32102.72ms. Allocated memory was 119.5MB in the beginning and 314.6MB in the end (delta: 195.0MB). Free memory was 84.5MB in the beginning and 261.5MB in the end (delta: -177.1MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2022-11-16 20:02:45,189 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 56.7MB in the beginning and 56.7MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:02:45,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 784.99ms. Allocated memory is still 119.5MB. Free memory was 84.3MB in the beginning and 83.0MB in the end (delta: 1.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 20:02:45,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.82ms. Allocated memory is still 119.5MB. Free memory was 83.0MB in the beginning and 80.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 20:02:45,190 INFO L158 Benchmark]: Boogie Preprocessor took 40.24ms. Allocated memory is still 119.5MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:02:45,190 INFO L158 Benchmark]: RCFGBuilder took 1805.98ms. Allocated memory is still 119.5MB. Free memory was 78.2MB in the beginning and 43.4MB in the end (delta: 34.8MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2022-11-16 20:02:45,190 INFO L158 Benchmark]: TraceAbstraction took 29338.99ms. Allocated memory was 119.5MB in the beginning and 314.6MB in the end (delta: 195.0MB). Free memory was 42.9MB in the beginning and 261.5MB in the end (delta: -218.6MB). Peak memory consumption was 161.0MB. Max. memory is 16.1GB. [2022-11-16 20:02:45,191 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 314.6MB. Free memory is still 261.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:02:45,192 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.20ms. Allocated memory is still 83.9MB. Free memory was 56.7MB in the beginning and 56.7MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 784.99ms. Allocated memory is still 119.5MB. Free memory was 84.3MB in the beginning and 83.0MB in the end (delta: 1.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.82ms. Allocated memory is still 119.5MB. Free memory was 83.0MB in the beginning and 80.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.24ms. Allocated memory is still 119.5MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1805.98ms. Allocated memory is still 119.5MB. Free memory was 78.2MB in the beginning and 43.4MB in the end (delta: 34.8MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * TraceAbstraction took 29338.99ms. Allocated memory was 119.5MB in the beginning and 314.6MB in the end (delta: 195.0MB). Free memory was 42.9MB in the beginning and 261.5MB in the end (delta: -218.6MB). Peak memory consumption was 161.0MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 314.6MB. Free memory is still 261.5MB. 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: 21.8s, 155 PlacesBefore, 64 PlacesAfterwards, 150 TransitionsBefore, 57 TransitionsAfterwards, 3984 CoEnabledTransitionPairs, 7 FixpointIterations, 66 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 137 TotalNumberOfCompositions, 16834 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5248, independent: 4850, independent conditional: 0, independent unconditional: 4850, dependent: 382, dependent conditional: 0, dependent unconditional: 382, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2103, independent: 2026, independent conditional: 0, independent unconditional: 2026, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2103, independent: 1899, independent conditional: 0, independent unconditional: 1899, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 204, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1421, independent: 751, independent conditional: 0, independent unconditional: 751, dependent: 613, dependent conditional: 0, dependent unconditional: 613, unknown: 57, unknown conditional: 0, unknown unconditional: 57] ], Cache Queries: [ total: 5248, independent: 2824, independent conditional: 0, independent unconditional: 2824, dependent: 308, dependent conditional: 0, dependent unconditional: 308, unknown: 2116, unknown conditional: 0, unknown unconditional: 2116] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 289, Positive conditional cache size: 0, Positive unconditional cache size: 289, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 3, Unknown conditional cache size: 0, Unknown unconditional cache size: 3 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L731] 0 _Bool x$flush_delayed; [L740] 0 int *x$read_delayed_var; [L747] 0 _Bool weak$$choice0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L748] 0 _Bool weak$$choice1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L749] 0 _Bool weak$$choice2; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L732] 0 int x$mem_tmp; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L710] 0 int __unbuffered_p0_EAX = 0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L734] 0 _Bool x$r_buff0_thd1; [L712] 0 int __unbuffered_p1_EAX = 0; [L735] 0 _Bool x$r_buff0_thd2; [L733] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L739] 0 _Bool x$read_delayed; [L708] 0 int __unbuffered_cnt = 0; [L728] 0 _Bool main$tmp_guard1; [L744] 0 _Bool x$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L742] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff0; [L743] 0 int x$w_buff1; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L730] 0 int x = 0; [L737] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd0; [L746] 0 int y = 0; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L738] 0 _Bool x$r_buff1_thd2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1923, ((void *)0), P0, ((void *)0))=0, t1923={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1924, ((void *)0), P1, ((void *)0))=1, t1923={7:0}, t1924={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L803] 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) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] 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) [L803] 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) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 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 [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L753] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 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) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] 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) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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 5 procedures, 192 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 29.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 22.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1050 IncrementalHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 31 mSDtfsCounter, 1050 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3550occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 700 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 687 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 20:02:45,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/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_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0 --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 eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 20:02:47,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 20:02:47,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 20:02:47,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 20:02:47,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 20:02:47,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 20:02:47,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 20:02:47,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 20:02:47,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 20:02:47,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 20:02:47,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 20:02:47,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 20:02:47,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 20:02:47,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 20:02:47,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 20:02:47,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 20:02:47,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 20:02:47,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 20:02:47,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 20:02:47,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 20:02:47,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 20:02:47,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 20:02:47,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 20:02:47,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 20:02:47,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 20:02:47,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 20:02:47,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 20:02:47,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 20:02:47,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 20:02:47,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 20:02:47,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 20:02:47,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 20:02:47,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 20:02:47,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 20:02:47,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 20:02:47,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 20:02:47,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 20:02:47,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 20:02:47,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 20:02:47,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 20:02:47,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 20:02:47,534 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-16 20:02:47,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 20:02:47,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 20:02:47,579 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 20:02:47,580 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 20:02:47,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 20:02:47,581 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 20:02:47,581 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 20:02:47,581 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 20:02:47,581 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 20:02:47,582 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 20:02:47,582 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 20:02:47,583 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 20:02:47,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 20:02:47,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 20:02:47,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 20:02:47,585 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 20:02:47,585 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 20:02:47,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 20:02:47,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 20:02:47,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 20:02:47,586 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 20:02:47,586 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 20:02:47,586 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 20:02:47,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 20:02:47,587 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 20:02:47,587 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 20:02:47,587 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 20:02:47,587 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 20:02:47,588 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 20:02:47,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 20:02:47,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 20:02:47,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 20:02:47,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:02:47,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 20:02:47,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 20:02:47,590 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-16 20:02:47,590 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 20:02:47,590 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 20:02:47,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 20:02:47,591 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_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/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_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0 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 -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2022-11-16 20:02:47,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 20:02:47,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 20:02:47,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 20:02:47,993 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 20:02:47,994 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 20:02:47,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-11-16 20:02:48,069 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/data/4c9d9225a/3dec5e855fe449bcb93c17d5a741fe89/FLAG6f92cf442 [2022-11-16 20:02:48,606 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 20:02:48,607 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-11-16 20:02:48,622 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/data/4c9d9225a/3dec5e855fe449bcb93c17d5a741fe89/FLAG6f92cf442 [2022-11-16 20:02:48,907 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/data/4c9d9225a/3dec5e855fe449bcb93c17d5a741fe89 [2022-11-16 20:02:48,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 20:02:48,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 20:02:48,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 20:02:48,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 20:02:48,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 20:02:48,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:02:48" (1/1) ... [2022-11-16 20:02:48,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@712bacdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:48, skipping insertion in model container [2022-11-16 20:02:48,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:02:48" (1/1) ... [2022-11-16 20:02:48,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 20:02:48,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 20:02:49,137 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2022-11-16 20:02:49,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:02:49,463 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 20:02:49,477 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2022-11-16 20:02:49,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:02:49,591 INFO L208 MainTranslator]: Completed translation [2022-11-16 20:02:49,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49 WrapperNode [2022-11-16 20:02:49,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 20:02:49,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 20:02:49,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 20:02:49,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 20:02:49,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (1/1) ... [2022-11-16 20:02:49,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (1/1) ... [2022-11-16 20:02:49,673 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-11-16 20:02:49,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 20:02:49,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 20:02:49,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 20:02:49,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 20:02:49,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (1/1) ... [2022-11-16 20:02:49,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (1/1) ... [2022-11-16 20:02:49,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (1/1) ... [2022-11-16 20:02:49,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (1/1) ... [2022-11-16 20:02:49,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (1/1) ... [2022-11-16 20:02:49,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (1/1) ... [2022-11-16 20:02:49,732 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (1/1) ... [2022-11-16 20:02:49,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (1/1) ... [2022-11-16 20:02:49,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 20:02:49,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 20:02:49,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 20:02:49,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 20:02:49,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (1/1) ... [2022-11-16 20:02:49,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:02:49,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:02:49,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 20:02:49,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 20:02:49,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 20:02:49,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 20:02:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 20:02:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 20:02:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 20:02:49,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 20:02:49,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 20:02:49,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-16 20:02:49,814 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 20:02:49,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 20:02:49,815 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 20:02:49,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 20:02:49,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 20:02:49,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 20:02:49,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 20:02:49,817 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 20:02:50,029 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 20:02:50,031 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 20:02:50,863 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 20:02:51,646 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 20:02:51,647 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 20:02:51,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:02:51 BoogieIcfgContainer [2022-11-16 20:02:51,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 20:02:51,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 20:02:51,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 20:02:51,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 20:02:51,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:02:48" (1/3) ... [2022-11-16 20:02:51,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71096869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:02:51, skipping insertion in model container [2022-11-16 20:02:51,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:02:49" (2/3) ... [2022-11-16 20:02:51,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71096869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:02:51, skipping insertion in model container [2022-11-16 20:02:51,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:02:51" (3/3) ... [2022-11-16 20:02:51,663 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2022-11-16 20:02:51,683 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 20:02:51,683 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-11-16 20:02:51,683 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 20:02:51,878 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 20:02:51,924 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 20:02:51,941 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 151 transitions, 312 flow [2022-11-16 20:02:51,945 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 151 transitions, 312 flow [2022-11-16 20:02:51,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 151 transitions, 312 flow [2022-11-16 20:02:52,061 INFO L130 PetriNetUnfolder]: 2/149 cut-off events. [2022-11-16 20:02:52,062 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 20:02:52,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 149 events. 2/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 198 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-16 20:02:52,072 INFO L119 LiptonReduction]: Number of co-enabled transitions 3984 [2022-11-16 20:03:14,528 WARN L233 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 234 DAG size of output: 232 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 20:03:36,409 INFO L134 LiptonReduction]: Checked pairs total: 16900 [2022-11-16 20:03:36,410 INFO L136 LiptonReduction]: Total number of compositions: 136 [2022-11-16 20:03:36,417 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 57 transitions, 124 flow [2022-11-16 20:03:36,565 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:36,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 20:03:36,587 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;@6b1a05fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 20:03:36,587 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-16 20:03:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 20:03:36,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:03:36,603 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 20:03:36,604 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:03:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:03:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1008, now seen corresponding path program 1 times [2022-11-16 20:03:36,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:03:36,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725750347] [2022-11-16 20:03:36,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:03:36,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:36,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:03:36,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:03:36,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 20:03:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:03:36,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 20:03:36,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:03:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:03:36,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:03:36,790 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:03:36,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725750347] [2022-11-16 20:03:36,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725750347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:03:36,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:03:36,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 20:03:36,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669220878] [2022-11-16 20:03:36,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:03:36,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 20:03:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:03:36,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 20:03:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 20:03:36,841 INFO L87 Difference]: Start difference. First operand has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:03:37,059 INFO L93 Difference]: Finished difference Result 1568 states and 4263 transitions. [2022-11-16 20:03:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 20:03:37,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-16 20:03:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:03:37,089 INFO L225 Difference]: With dead ends: 1568 [2022-11-16 20:03:37,089 INFO L226 Difference]: Without dead ends: 1568 [2022-11-16 20:03:37,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 20:03:37,093 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:03:37,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:03:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2022-11-16 20:03:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2022-11-16 20:03:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1191 states have (on average 3.579345088161209) internal successors, (4263), 1567 states have internal predecessors, (4263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 4263 transitions. [2022-11-16 20:03:37,262 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 4263 transitions. Word has length 1 [2022-11-16 20:03:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:03:37,262 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 4263 transitions. [2022-11-16 20:03:37,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 4263 transitions. [2022-11-16 20:03:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-16 20:03:37,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:03:37,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-16 20:03:37,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 20:03:37,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:37,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:03:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:03:37,476 INFO L85 PathProgramCache]: Analyzing trace with hash 30836408, now seen corresponding path program 1 times [2022-11-16 20:03:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:03:37,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658561404] [2022-11-16 20:03:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:03:37,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:37,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:03:37,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:03:37,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 20:03:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:03:37,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 20:03:37,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:03:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:03:37,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:03:37,701 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:03:37,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658561404] [2022-11-16 20:03:37,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658561404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:03:37,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:03:37,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 20:03:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622254013] [2022-11-16 20:03:37,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:03:37,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:03:37,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:03:37,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:03:37,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:03:37,707 INFO L87 Difference]: Start difference. First operand 1568 states and 4263 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-16 20:03:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:03:37,971 INFO L93 Difference]: Finished difference Result 1411 states and 3820 transitions. [2022-11-16 20:03:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:03:37,972 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-16 20:03:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:03:37,980 INFO L225 Difference]: With dead ends: 1411 [2022-11-16 20:03:37,980 INFO L226 Difference]: Without dead ends: 1411 [2022-11-16 20:03:37,981 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-16 20:03:37,982 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:03:37,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:03:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-11-16 20:03:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411. [2022-11-16 20:03:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1097 states have (on average 3.4822242479489516) internal successors, (3820), 1410 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 3820 transitions. [2022-11-16 20:03:38,029 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 3820 transitions. Word has length 4 [2022-11-16 20:03:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:03:38,029 INFO L495 AbstractCegarLoop]: Abstraction has 1411 states and 3820 transitions. [2022-11-16 20:03:38,030 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-16 20:03:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 3820 transitions. [2022-11-16 20:03:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 20:03:38,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:03:38,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 20:03:38,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 20:03:38,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:38,242 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:03:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:03:38,242 INFO L85 PathProgramCache]: Analyzing trace with hash 955929482, now seen corresponding path program 1 times [2022-11-16 20:03:38,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:03:38,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795206042] [2022-11-16 20:03:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:03:38,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:38,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:03:38,246 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:03:38,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 20:03:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:03:38,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 20:03:38,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:03:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:03:38,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:03:38,408 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:03:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795206042] [2022-11-16 20:03:38,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795206042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:03:38,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:03:38,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:03:38,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22429473] [2022-11-16 20:03:38,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:03:38,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:03:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:03:38,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:03:38,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:03:38,411 INFO L87 Difference]: Start difference. First operand 1411 states and 3820 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:03:38,730 INFO L93 Difference]: Finished difference Result 1777 states and 4817 transitions. [2022-11-16 20:03:38,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:03:38,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 20:03:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:03:38,744 INFO L225 Difference]: With dead ends: 1777 [2022-11-16 20:03:38,744 INFO L226 Difference]: Without dead ends: 1777 [2022-11-16 20:03:38,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:03:38,745 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:03:38,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:03:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2022-11-16 20:03:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1505. [2022-11-16 20:03:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1207 states have (on average 3.591549295774648) internal successors, (4335), 1504 states have internal predecessors, (4335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 4335 transitions. [2022-11-16 20:03:38,833 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 4335 transitions. Word has length 5 [2022-11-16 20:03:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:03:38,834 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 4335 transitions. [2022-11-16 20:03:38,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 4335 transitions. [2022-11-16 20:03:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 20:03:38,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:03:38,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 20:03:38,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 20:03:39,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:39,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:03:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:03:39,036 INFO L85 PathProgramCache]: Analyzing trace with hash 955929484, now seen corresponding path program 1 times [2022-11-16 20:03:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:03:39,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626629994] [2022-11-16 20:03:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:03:39,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:39,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:03:39,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:03:39,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 20:03:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:03:39,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 20:03:39,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:03:39,248 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 20:03:39,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 20:03:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:03:39,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:03:39,294 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:03:39,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626629994] [2022-11-16 20:03:39,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626629994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:03:39,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:03:39,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 20:03:39,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929516646] [2022-11-16 20:03:39,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:03:39,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:03:39,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:03:39,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:03:39,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:03:39,297 INFO L87 Difference]: Start difference. First operand 1505 states and 4335 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:39,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:03:39,510 INFO L93 Difference]: Finished difference Result 906 states and 2496 transitions. [2022-11-16 20:03:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:03:39,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 20:03:39,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:03:39,516 INFO L225 Difference]: With dead ends: 906 [2022-11-16 20:03:39,517 INFO L226 Difference]: Without dead ends: 906 [2022-11-16 20:03:39,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:03:39,518 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:03:39,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:03:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-11-16 20:03:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2022-11-16 20:03:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 779 states have (on average 3.20410783055199) internal successors, (2496), 905 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 2496 transitions. [2022-11-16 20:03:39,547 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 2496 transitions. Word has length 5 [2022-11-16 20:03:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:03:39,547 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 2496 transitions. [2022-11-16 20:03:39,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 2496 transitions. [2022-11-16 20:03:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 20:03:39,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:03:39,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 20:03:39,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 20:03:39,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:39,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:03:39,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:03:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash 955929485, now seen corresponding path program 1 times [2022-11-16 20:03:39,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:03:39,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573308965] [2022-11-16 20:03:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:03:39,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:39,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:03:39,762 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:03:39,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 20:03:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:03:39,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 20:03:39,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:03:39,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:03:39,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 20:03:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:03:40,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:03:40,001 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:03:40,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573308965] [2022-11-16 20:03:40,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573308965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:03:40,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:03:40,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 20:03:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655087248] [2022-11-16 20:03:40,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:03:40,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:03:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:03:40,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:03:40,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:03:40,003 INFO L87 Difference]: Start difference. First operand 906 states and 2496 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:03:40,130 INFO L93 Difference]: Finished difference Result 413 states and 1048 transitions. [2022-11-16 20:03:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:03:40,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 20:03:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:03:40,133 INFO L225 Difference]: With dead ends: 413 [2022-11-16 20:03:40,133 INFO L226 Difference]: Without dead ends: 413 [2022-11-16 20:03:40,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:03:40,135 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:03:40,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:03:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-16 20:03:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 390. [2022-11-16 20:03:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 364 states have (on average 2.7225274725274726) internal successors, (991), 389 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 991 transitions. [2022-11-16 20:03:40,167 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 991 transitions. Word has length 5 [2022-11-16 20:03:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:03:40,168 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 991 transitions. [2022-11-16 20:03:40,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 991 transitions. [2022-11-16 20:03:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 20:03:40,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:03:40,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:03:40,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -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-16 20:03:40,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:40,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:03:40,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:03:40,381 INFO L85 PathProgramCache]: Analyzing trace with hash -442113129, now seen corresponding path program 1 times [2022-11-16 20:03:40,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:03:40,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726272548] [2022-11-16 20:03:40,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:03:40,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:40,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:03:40,383 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:03:40,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 20:03:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:03:40,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 20:03:40,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:03:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:03:40,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:03:40,566 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:03:40,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726272548] [2022-11-16 20:03:40,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726272548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:03:40,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:03:40,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 20:03:40,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966220099] [2022-11-16 20:03:40,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:03:40,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:03:40,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:03:40,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:03:40,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:03:40,569 INFO L87 Difference]: Start difference. First operand 390 states and 991 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:03:40,731 INFO L93 Difference]: Finished difference Result 380 states and 963 transitions. [2022-11-16 20:03:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:03:40,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-16 20:03:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:03:40,734 INFO L225 Difference]: With dead ends: 380 [2022-11-16 20:03:40,734 INFO L226 Difference]: Without dead ends: 380 [2022-11-16 20:03:40,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:03:40,735 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:03:40,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:03:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-16 20:03:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-16 20:03:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 354 states have (on average 2.7203389830508473) internal successors, (963), 379 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 963 transitions. [2022-11-16 20:03:40,753 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 963 transitions. Word has length 7 [2022-11-16 20:03:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:03:40,753 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 963 transitions. [2022-11-16 20:03:40,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 963 transitions. [2022-11-16 20:03:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 20:03:40,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:03:40,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:03:40,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 20:03:40,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:40,966 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:03:40,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:03:40,967 INFO L85 PathProgramCache]: Analyzing trace with hash -820604182, now seen corresponding path program 1 times [2022-11-16 20:03:40,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:03:40,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521887230] [2022-11-16 20:03:40,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:03:40,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:40,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:03:40,969 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:03:40,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 20:03:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:03:41,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 20:03:41,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:03:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:03:41,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:03:41,157 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:03:41,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521887230] [2022-11-16 20:03:41,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521887230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:03:41,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:03:41,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:03:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769751290] [2022-11-16 20:03:41,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:03:41,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:03:41,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:03:41,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:03:41,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:03:41,159 INFO L87 Difference]: Start difference. First operand 380 states and 963 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:03:41,432 INFO L93 Difference]: Finished difference Result 163 states and 304 transitions. [2022-11-16 20:03:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:03:41,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 20:03:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:03:41,434 INFO L225 Difference]: With dead ends: 163 [2022-11-16 20:03:41,434 INFO L226 Difference]: Without dead ends: 138 [2022-11-16 20:03:41,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:03:41,435 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:03:41,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:03:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-16 20:03:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-16 20:03:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 2.0) internal successors, (248), 137 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 248 transitions. [2022-11-16 20:03:41,439 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 248 transitions. Word has length 8 [2022-11-16 20:03:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:03:41,440 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 248 transitions. [2022-11-16 20:03:41,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 248 transitions. [2022-11-16 20:03:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 20:03:41,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:03:41,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:03:41,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 20:03:41,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:41,650 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:03:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:03:41,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1042377783, now seen corresponding path program 1 times [2022-11-16 20:03:41,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:03:41,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606222432] [2022-11-16 20:03:41,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:03:41,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:41,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:03:41,651 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:03:41,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 20:03:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:03:41,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 20:03:41,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:03:43,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-16 20:03:43,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-16 20:03:43,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:03:43,292 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:03:43,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606222432] [2022-11-16 20:03:43,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606222432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:03:43,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:03:43,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:03:43,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659281079] [2022-11-16 20:03:43,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:03:43,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:03:43,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:03:43,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:03:43,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:03:43,294 INFO L87 Difference]: Start difference. First operand 138 states and 248 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-16 20:03:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:03:43,552 INFO L93 Difference]: Finished difference Result 146 states and 256 transitions. [2022-11-16 20:03:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:03:43,552 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-16 20:03:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:03:43,553 INFO L225 Difference]: With dead ends: 146 [2022-11-16 20:03:43,553 INFO L226 Difference]: Without dead ends: 146 [2022-11-16 20:03:43,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:03:43,554 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:03:43,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 5 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:03:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-16 20:03:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2022-11-16 20:03:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.9914529914529915) internal successors, (233), 129 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 233 transitions. [2022-11-16 20:03:43,558 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 233 transitions. Word has length 11 [2022-11-16 20:03:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:03:43,558 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 233 transitions. [2022-11-16 20:03:43,559 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-16 20:03:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 233 transitions. [2022-11-16 20:03:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 20:03:43,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:03:43,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:03:43,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -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-16 20:03:43,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:43,762 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:03:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:03:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1042377782, now seen corresponding path program 1 times [2022-11-16 20:03:43,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:03:43,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954639926] [2022-11-16 20:03:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:03:43,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:43,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:03:43,765 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:03:43,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 20:03:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:03:43,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 20:03:43,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:03:46,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-16 20:03:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:03:46,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:03:46,331 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:03:46,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954639926] [2022-11-16 20:03:46,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954639926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:03:46,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:03:46,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:03:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460912105] [2022-11-16 20:03:46,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:03:46,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:03:46,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:03:46,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:03:46,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:03:46,333 INFO L87 Difference]: Start difference. First operand 130 states and 233 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-16 20:03:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:03:46,604 INFO L93 Difference]: Finished difference Result 191 states and 336 transitions. [2022-11-16 20:03:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:03:46,605 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-16 20:03:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:03:46,606 INFO L225 Difference]: With dead ends: 191 [2022-11-16 20:03:46,606 INFO L226 Difference]: Without dead ends: 191 [2022-11-16 20:03:46,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:03:46,607 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:03:46,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 6 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:03:46,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-16 20:03:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 146. [2022-11-16 20:03:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 133 states have (on average 1.9774436090225564) internal successors, (263), 145 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 263 transitions. [2022-11-16 20:03:46,612 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 263 transitions. Word has length 11 [2022-11-16 20:03:46,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:03:46,612 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 263 transitions. [2022-11-16 20:03:46,612 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-16 20:03:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 263 transitions. [2022-11-16 20:03:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 20:03:46,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:03:46,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:03:46,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 20:03:46,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:46,824 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:03:46,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:03:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1632800408, now seen corresponding path program 1 times [2022-11-16 20:03:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:03:46,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921916691] [2022-11-16 20:03:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:03:46,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:46,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:03:46,826 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:03:46,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 20:03:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:03:46,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 20:03:46,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:03:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:03:47,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:03:47,027 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:03:47,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921916691] [2022-11-16 20:03:47,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921916691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:03:47,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:03:47,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:03:47,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626238469] [2022-11-16 20:03:47,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:03:47,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:03:47,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:03:47,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:03:47,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:03:47,029 INFO L87 Difference]: Start difference. First operand 146 states and 263 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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-16 20:03:47,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:03:47,289 INFO L93 Difference]: Finished difference Result 77 states and 121 transitions. [2022-11-16 20:03:47,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:03:47,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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-16 20:03:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:03:47,291 INFO L225 Difference]: With dead ends: 77 [2022-11-16 20:03:47,291 INFO L226 Difference]: Without dead ends: 62 [2022-11-16 20:03:47,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:03:47,291 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:03:47,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 14 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:03:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-16 20:03:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-16 20:03:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.6101694915254237) internal successors, (95), 61 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:03:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2022-11-16 20:03:47,294 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 12 [2022-11-16 20:03:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:03:47,295 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2022-11-16 20:03:47,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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-16 20:03:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2022-11-16 20:03:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 20:03:47,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:03:47,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:03:47,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 20:03:47,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:47,508 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:03:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:03:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 875286876, now seen corresponding path program 1 times [2022-11-16 20:03:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:03:47,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113527047] [2022-11-16 20:03:47,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:03:47,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:03:47,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:03:47,510 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:03:47,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 20:03:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:03:47,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 20:03:47,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:03:47,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-16 20:03:47,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-16 20:04:55,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-16 20:04:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:04:55,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:04:55,557 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:04:55,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113527047] [2022-11-16 20:04:55,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113527047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:04:55,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:04:55,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:04:55,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914945748] [2022-11-16 20:04:55,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:04:55,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 20:04:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:04:55,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 20:04:55,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:04:55,558 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:04:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:04:55,827 INFO L93 Difference]: Finished difference Result 82 states and 119 transitions. [2022-11-16 20:04:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 20:04:55,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 20:04:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:04:55,828 INFO L225 Difference]: With dead ends: 82 [2022-11-16 20:04:55,828 INFO L226 Difference]: Without dead ends: 82 [2022-11-16 20:04:55,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 20:04:55,829 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 60 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:04:55,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 9 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:04:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-16 20:04:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 48. [2022-11-16 20:04:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 47 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:04:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 75 transitions. [2022-11-16 20:04:55,832 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 75 transitions. Word has length 15 [2022-11-16 20:04:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:04:55,832 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 75 transitions. [2022-11-16 20:04:55,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:04:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 75 transitions. [2022-11-16 20:04:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 20:04:55,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:04:55,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:04:55,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 20:04:56,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:04:56,038 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:04:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:04:56,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1364090278, now seen corresponding path program 1 times [2022-11-16 20:04:56,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:04:56,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182780250] [2022-11-16 20:04:56,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:04:56,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:04:56,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:04:56,040 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:04:56,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 20:04:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:04:56,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 20:04:56,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:04:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:04:56,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:04:56,277 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 20:04:56,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182780250] [2022-11-16 20:04:56,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182780250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:04:56,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:04:56,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:04:56,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364263952] [2022-11-16 20:04:56,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:04:56,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:04:56,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 20:04:56,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:04:56,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:04:56,279 INFO L87 Difference]: Start difference. First operand 48 states and 75 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:04:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:04:56,416 INFO L93 Difference]: Finished difference Result 65 states and 97 transitions. [2022-11-16 20:04:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:04:56,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 20:04:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:04:56,417 INFO L225 Difference]: With dead ends: 65 [2022-11-16 20:04:56,417 INFO L226 Difference]: Without dead ends: 65 [2022-11-16 20:04:56,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:04:56,418 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:04:56,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:04:56,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-16 20:04:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-11-16 20:04:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 61 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:04:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2022-11-16 20:04:56,421 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 16 [2022-11-16 20:04:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:04:56,422 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2022-11-16 20:04:56,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:04:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2022-11-16 20:04:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 20:04:56,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:04:56,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:04:56,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -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)] Ended with exit code 0 [2022-11-16 20:04:56,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:04:56,636 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 20:04:56,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:04:56,636 INFO L85 PathProgramCache]: Analyzing trace with hash -737663872, now seen corresponding path program 2 times [2022-11-16 20:04:56,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 20:04:56,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754919870] [2022-11-16 20:04:56,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 20:04:56,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:04:56,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 20:04:56,638 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 20:04:56,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -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-16 20:04:56,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 20:04:56,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 20:04:56,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 20:04:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:04:57,101 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-16 20:04:57,102 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 20:04:57,103 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2022-11-16 20:04:57,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (62 of 64 remaining) [2022-11-16 20:04:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 64 remaining) [2022-11-16 20:04:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 64 remaining) [2022-11-16 20:04:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 64 remaining) [2022-11-16 20:04:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 64 remaining) [2022-11-16 20:04:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 64 remaining) [2022-11-16 20:04:57,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 64 remaining) [2022-11-16 20:04:57,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 64 remaining) [2022-11-16 20:04:57,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 64 remaining) [2022-11-16 20:04:57,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 64 remaining) [2022-11-16 20:04:57,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 64 remaining) [2022-11-16 20:04:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 64 remaining) [2022-11-16 20:04:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 64 remaining) [2022-11-16 20:04:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 64 remaining) [2022-11-16 20:04:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 64 remaining) [2022-11-16 20:04:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 64 remaining) [2022-11-16 20:04:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 64 remaining) [2022-11-16 20:04:57,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 64 remaining) [2022-11-16 20:04:57,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 64 remaining) [2022-11-16 20:04:57,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 64 remaining) [2022-11-16 20:04:57,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 64 remaining) [2022-11-16 20:04:57,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 64 remaining) [2022-11-16 20:04:57,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 64 remaining) [2022-11-16 20:04:57,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 64 remaining) [2022-11-16 20:04:57,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 64 remaining) [2022-11-16 20:04:57,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 64 remaining) [2022-11-16 20:04:57,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 64 remaining) [2022-11-16 20:04:57,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 64 remaining) [2022-11-16 20:04:57,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 64 remaining) [2022-11-16 20:04:57,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 64 remaining) [2022-11-16 20:04:57,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 64 remaining) [2022-11-16 20:04:57,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 64 remaining) [2022-11-16 20:04:57,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 64 remaining) [2022-11-16 20:04:57,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 64 remaining) [2022-11-16 20:04:57,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 64 remaining) [2022-11-16 20:04:57,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (27 of 64 remaining) [2022-11-16 20:04:57,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 64 remaining) [2022-11-16 20:04:57,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 64 remaining) [2022-11-16 20:04:57,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 64 remaining) [2022-11-16 20:04:57,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 64 remaining) [2022-11-16 20:04:57,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 64 remaining) [2022-11-16 20:04:57,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 64 remaining) [2022-11-16 20:04:57,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 64 remaining) [2022-11-16 20:04:57,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 64 remaining) [2022-11-16 20:04:57,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 64 remaining) [2022-11-16 20:04:57,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 64 remaining) [2022-11-16 20:04:57,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 64 remaining) [2022-11-16 20:04:57,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 64 remaining) [2022-11-16 20:04:57,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 64 remaining) [2022-11-16 20:04:57,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 64 remaining) [2022-11-16 20:04:57,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 64 remaining) [2022-11-16 20:04:57,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 64 remaining) [2022-11-16 20:04:57,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 64 remaining) [2022-11-16 20:04:57,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 64 remaining) [2022-11-16 20:04:57,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 64 remaining) [2022-11-16 20:04:57,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 64 remaining) [2022-11-16 20:04:57,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 64 remaining) [2022-11-16 20:04:57,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 64 remaining) [2022-11-16 20:04:57,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 64 remaining) [2022-11-16 20:04:57,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 64 remaining) [2022-11-16 20:04:57,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 64 remaining) [2022-11-16 20:04:57,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 64 remaining) [2022-11-16 20:04:57,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 64 remaining) [2022-11-16 20:04:57,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -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-16 20:04:57,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 20:04:57,335 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:04:57,341 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 20:04:57,341 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 20:04:57,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:04:57 BasicIcfg [2022-11-16 20:04:57,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 20:04:57,435 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 20:04:57,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 20:04:57,436 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 20:04:57,437 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:02:51" (3/4) ... [2022-11-16 20:04:57,440 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 20:04:57,440 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 20:04:57,441 INFO L158 Benchmark]: Toolchain (without parser) took 128529.63ms. Allocated memory was 69.2MB in the beginning and 811.6MB in the end (delta: 742.4MB). Free memory was 48.4MB in the beginning and 714.9MB in the end (delta: -666.5MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2022-11-16 20:04:57,441 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 69.2MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:04:57,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 679.91ms. Allocated memory is still 69.2MB. Free memory was 48.3MB in the beginning and 39.7MB in the end (delta: 8.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 20:04:57,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.42ms. Allocated memory is still 69.2MB. Free memory was 39.7MB in the beginning and 37.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:04:57,448 INFO L158 Benchmark]: Boogie Preprocessor took 60.52ms. Allocated memory is still 69.2MB. Free memory was 37.1MB in the beginning and 34.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 20:04:57,449 INFO L158 Benchmark]: RCFGBuilder took 1913.21ms. Allocated memory was 69.2MB in the beginning and 119.5MB in the end (delta: 50.3MB). Free memory was 34.7MB in the beginning and 71.4MB in the end (delta: -36.7MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2022-11-16 20:04:57,449 INFO L158 Benchmark]: TraceAbstraction took 125779.69ms. Allocated memory was 119.5MB in the beginning and 811.6MB in the end (delta: 692.1MB). Free memory was 70.6MB in the beginning and 716.0MB in the end (delta: -645.4MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2022-11-16 20:04:57,449 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 811.6MB. Free memory is still 714.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:04:57,451 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 69.2MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 679.91ms. Allocated memory is still 69.2MB. Free memory was 48.3MB in the beginning and 39.7MB in the end (delta: 8.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.42ms. Allocated memory is still 69.2MB. Free memory was 39.7MB in the beginning and 37.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.52ms. Allocated memory is still 69.2MB. Free memory was 37.1MB in the beginning and 34.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1913.21ms. Allocated memory was 69.2MB in the beginning and 119.5MB in the end (delta: 50.3MB). Free memory was 34.7MB in the beginning and 71.4MB in the end (delta: -36.7MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 125779.69ms. Allocated memory was 119.5MB in the beginning and 811.6MB in the end (delta: 692.1MB). Free memory was 70.6MB in the beginning and 716.0MB in the end (delta: -645.4MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 811.6MB. Free memory is still 714.9MB. 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: 44.5s, 156 PlacesBefore, 64 PlacesAfterwards, 151 TransitionsBefore, 57 TransitionsAfterwards, 3984 CoEnabledTransitionPairs, 7 FixpointIterations, 65 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 16900 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5484, independent: 5084, independent conditional: 0, independent unconditional: 5084, dependent: 385, dependent conditional: 0, dependent unconditional: 385, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2145, independent: 2067, independent conditional: 0, independent unconditional: 2067, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2145, independent: 1928, independent conditional: 0, independent unconditional: 1928, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 217, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2144, independent: 892, independent conditional: 0, independent unconditional: 892, dependent: 1157, dependent conditional: 0, dependent unconditional: 1157, unknown: 95, unknown conditional: 0, unknown unconditional: 95] ], Cache Queries: [ total: 5484, independent: 3017, independent conditional: 0, independent unconditional: 3017, dependent: 310, dependent conditional: 0, dependent unconditional: 310, unknown: 2157, unknown conditional: 0, unknown unconditional: 2157] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 327, Positive conditional cache size: 0, Positive unconditional cache size: 327, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 3, Unknown conditional cache size: 0, Unknown unconditional cache size: 3 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L731] 0 _Bool x$flush_delayed; [L740] 0 int *x$read_delayed_var; [L747] 0 _Bool weak$$choice0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L748] 0 _Bool weak$$choice1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L749] 0 _Bool weak$$choice2; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L732] 0 int x$mem_tmp; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L710] 0 int __unbuffered_p0_EAX = 0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L734] 0 _Bool x$r_buff0_thd1; [L712] 0 int __unbuffered_p1_EAX = 0; [L735] 0 _Bool x$r_buff0_thd2; [L733] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L739] 0 _Bool x$read_delayed; [L708] 0 int __unbuffered_cnt = 0; [L728] 0 _Bool main$tmp_guard1; [L744] 0 _Bool x$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L742] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff0; [L743] 0 int x$w_buff1; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L730] 0 int x = 0; [L737] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd0; [L746] 0 int y = 0; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L738] 0 _Bool x$r_buff1_thd2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1923, ((void *)0), P0, ((void *)0))=0, t1923={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1924, ((void *)0), P1, ((void *)0))=1, t1923={7:0}, t1924={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L803] 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) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] 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) [L803] 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) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 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 [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 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) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] 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) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=2, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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 5 procedures, 193 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 125.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 44.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 830 IncrementalHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 30 mSDtfsCounter, 830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3550occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 393 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 72.1s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 473 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1293 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 20:04:57,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e7330d-70de-4b3d-adb1-0200530b439a/bin/utaipan-Xvt2sAort0/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