./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4bb6c46a4de77c33ebd5db0d25fe513601ef52929336922ed8d1cb2e429dd77c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:46:00,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:46:00,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:46:00,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:46:00,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:46:00,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:46:00,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:46:00,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:46:00,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:46:00,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:46:00,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:46:00,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:46:00,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:46:00,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:46:00,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:46:00,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:46:00,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:46:00,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:46:00,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:46:00,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:46:00,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:46:00,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:46:00,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:46:00,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:46:00,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:46:00,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:46:00,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:46:00,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:46:00,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:46:00,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:46:00,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:46:00,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:46:00,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:46:00,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:46:00,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:46:00,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:46:00,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:46:00,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:46:00,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:46:00,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:46:00,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:46:00,968 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-07 01:46:01,014 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:46:01,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:46:01,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:46:01,016 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:46:01,016 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:46:01,022 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:46:01,023 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:46:01,023 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:46:01,023 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:46:01,023 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:46:01,025 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:46:01,025 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:46:01,025 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:46:01,025 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:46:01,026 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:46:01,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 01:46:01,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 01:46:01,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:46:01,027 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:46:01,027 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 01:46:01,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:46:01,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:46:01,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:46:01,028 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 01:46:01,028 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 01:46:01,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:46:01,030 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:46:01,031 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:46:01,031 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:46:01,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:46:01,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:46:01,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:46:01,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:46:01,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:46:01,033 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:46:01,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:46:01,033 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:46:01,033 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:46:01,033 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/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_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8 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-memcleanup) ) 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 -> 4bb6c46a4de77c33ebd5db0d25fe513601ef52929336922ed8d1cb2e429dd77c [2021-11-07 01:46:01,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:46:01,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:46:01,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:46:01,367 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:46:01,373 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:46:01,374 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2021-11-07 01:46:01,456 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/data/34ce4b331/448b2adebda24434b0914870f830f992/FLAG01077d95e [2021-11-07 01:46:02,054 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:46:02,054 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2021-11-07 01:46:02,070 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/data/34ce4b331/448b2adebda24434b0914870f830f992/FLAG01077d95e [2021-11-07 01:46:02,339 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/data/34ce4b331/448b2adebda24434b0914870f830f992 [2021-11-07 01:46:02,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:46:02,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:46:02,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:46:02,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:46:02,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:46:02,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:02,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e02f918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02, skipping insertion in model container [2021-11-07 01:46:02,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:02,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:46:02,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:46:02,802 WARN L228 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_ee89655b-ef5e-45cb-8c5a-14daacc5b419/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i[22793,22806] [2021-11-07 01:46:02,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:46:02,830 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:46:02,883 WARN L228 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_ee89655b-ef5e-45cb-8c5a-14daacc5b419/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i[22793,22806] [2021-11-07 01:46:02,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:46:02,932 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:46:02,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02 WrapperNode [2021-11-07 01:46:02,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:46:02,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:46:02,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:46:02,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:46:02,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:02,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:03,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:46:03,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:46:03,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:46:03,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:46:03,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:03,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:03,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:03,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:03,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:03,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:03,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:03,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:46:03,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:46:03,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:46:03,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:46:03,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02" (1/1) ... [2021-11-07 01:46:03,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:46:03,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:46:03,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:46:03,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:46:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 01:46:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 01:46:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 01:46:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 01:46:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:46:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 01:46:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:46:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:46:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:46:03,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:46:04,085 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:46:04,085 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-11-07 01:46:04,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:46:04 BoogieIcfgContainer [2021-11-07 01:46:04,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:46:04,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:46:04,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:46:04,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:46:04,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:46:02" (1/3) ... [2021-11-07 01:46:04,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd1b710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:46:04, skipping insertion in model container [2021-11-07 01:46:04,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:46:02" (2/3) ... [2021-11-07 01:46:04,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd1b710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:46:04, skipping insertion in model container [2021-11-07 01:46:04,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:46:04" (3/3) ... [2021-11-07 01:46:04,100 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-1.i [2021-11-07 01:46:04,113 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:46:04,113 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2021-11-07 01:46:04,157 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:46:04,164 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:46:04,164 INFO L340 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2021-11-07 01:46:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 47 states have (on average 2.595744680851064) internal successors, (122), 108 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-07 01:46:04,187 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:04,188 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-07 01:46:04,188 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash 7754, now seen corresponding path program 1 times [2021-11-07 01:46:04,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:04,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218553993] [2021-11-07 01:46:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:04,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:04,355 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:04,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218553993] [2021-11-07 01:46:04,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218553993] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:04,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:04,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 01:46:04,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39827557] [2021-11-07 01:46:04,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:46:04,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:04,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:46:04,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:46:04,380 INFO L87 Difference]: Start difference. First operand has 109 states, 47 states have (on average 2.595744680851064) internal successors, (122), 108 states have internal predecessors, (122), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:04,526 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2021-11-07 01:46:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:46:04,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-11-07 01:46:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:04,537 INFO L225 Difference]: With dead ends: 109 [2021-11-07 01:46:04,538 INFO L226 Difference]: Without dead ends: 107 [2021-11-07 01:46:04,539 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:46:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-11-07 01:46:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2021-11-07 01:46:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 103 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2021-11-07 01:46:04,576 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 2 [2021-11-07 01:46:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:04,576 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2021-11-07 01:46:04,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2021-11-07 01:46:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-07 01:46:04,577 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:04,578 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-07 01:46:04,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:46:04,578 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:04,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash 7755, now seen corresponding path program 1 times [2021-11-07 01:46:04,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:04,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649333912] [2021-11-07 01:46:04,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:04,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:04,625 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:04,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649333912] [2021-11-07 01:46:04,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649333912] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:04,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:04,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 01:46:04,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773481701] [2021-11-07 01:46:04,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:46:04,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:04,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:46:04,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:46:04,630 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:04,748 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2021-11-07 01:46:04,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:46:04,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-11-07 01:46:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:04,750 INFO L225 Difference]: With dead ends: 125 [2021-11-07 01:46:04,751 INFO L226 Difference]: Without dead ends: 125 [2021-11-07 01:46:04,751 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:46:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-07 01:46:04,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2021-11-07 01:46:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 46 states have (on average 2.347826086956522) internal successors, (108), 100 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2021-11-07 01:46:04,761 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 2 [2021-11-07 01:46:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:04,761 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2021-11-07 01:46:04,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2021-11-07 01:46:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 01:46:04,762 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:04,763 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:04,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:46:04,763 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:04,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1364528455, now seen corresponding path program 1 times [2021-11-07 01:46:04,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:04,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496442428] [2021-11-07 01:46:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:04,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:04,872 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:04,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496442428] [2021-11-07 01:46:04,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496442428] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:04,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:04,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:46:04,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471728064] [2021-11-07 01:46:04,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:46:04,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:04,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:46:04,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:46:04,875 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2021-11-07 01:46:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:05,058 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-11-07 01:46:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:46:05,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 [2021-11-07 01:46:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:05,063 INFO L225 Difference]: With dead ends: 99 [2021-11-07 01:46:05,063 INFO L226 Difference]: Without dead ends: 99 [2021-11-07 01:46:05,064 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:46:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-07 01:46:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2021-11-07 01:46:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-11-07 01:46:05,080 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 7 [2021-11-07 01:46:05,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:05,081 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-11-07 01:46:05,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2021-11-07 01:46:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-11-07 01:46:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 01:46:05,081 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:05,082 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:05,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:46:05,082 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:05,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1364528454, now seen corresponding path program 1 times [2021-11-07 01:46:05,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:05,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036285971] [2021-11-07 01:46:05,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:05,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:05,226 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:05,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036285971] [2021-11-07 01:46:05,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036285971] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:05,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:05,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:46:05,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722027725] [2021-11-07 01:46:05,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:46:05,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:05,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:46:05,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:46:05,229 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2021-11-07 01:46:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:05,431 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2021-11-07 01:46:05,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:46:05,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 [2021-11-07 01:46:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:05,432 INFO L225 Difference]: With dead ends: 115 [2021-11-07 01:46:05,432 INFO L226 Difference]: Without dead ends: 115 [2021-11-07 01:46:05,433 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:46:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-07 01:46:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2021-11-07 01:46:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.75) internal successors, (119), 103 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2021-11-07 01:46:05,439 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 7 [2021-11-07 01:46:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:05,439 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2021-11-07 01:46:05,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2021-11-07 01:46:05,439 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2021-11-07 01:46:05,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:46:05,440 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:05,440 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:05,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:46:05,440 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1346627867, now seen corresponding path program 1 times [2021-11-07 01:46:05,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:05,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344381790] [2021-11-07 01:46:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:05,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:05,587 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:05,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344381790] [2021-11-07 01:46:05,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344381790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:05,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:05,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:46:05,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352256793] [2021-11-07 01:46:05,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:46:05,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:05,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:46:05,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:46:05,592 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2021-11-07 01:46:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:05,759 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2021-11-07 01:46:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:46:05,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 [2021-11-07 01:46:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:05,760 INFO L225 Difference]: With dead ends: 103 [2021-11-07 01:46:05,760 INFO L226 Difference]: Without dead ends: 103 [2021-11-07 01:46:05,761 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:46:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-07 01:46:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-11-07 01:46:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 102 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2021-11-07 01:46:05,766 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 9 [2021-11-07 01:46:05,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:05,767 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2021-11-07 01:46:05,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2021-11-07 01:46:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2021-11-07 01:46:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:46:05,768 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:05,768 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:05,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:46:05,768 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:05,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1346627868, now seen corresponding path program 1 times [2021-11-07 01:46:05,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:05,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172560933] [2021-11-07 01:46:05,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:05,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:05,858 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:05,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172560933] [2021-11-07 01:46:05,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172560933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:05,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:05,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:46:05,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654452286] [2021-11-07 01:46:05,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:46:05,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:46:05,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:46:05,860 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2021-11-07 01:46:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:06,040 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2021-11-07 01:46:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:46:06,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 [2021-11-07 01:46:06,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:06,041 INFO L225 Difference]: With dead ends: 102 [2021-11-07 01:46:06,041 INFO L226 Difference]: Without dead ends: 102 [2021-11-07 01:46:06,042 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:46:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-07 01:46:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-11-07 01:46:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.6911764705882353) internal successors, (115), 101 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2021-11-07 01:46:06,047 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 9 [2021-11-07 01:46:06,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:06,047 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2021-11-07 01:46:06,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2021-11-07 01:46:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2021-11-07 01:46:06,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:46:06,048 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:06,049 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:06,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:46:06,049 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:06,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:06,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1324031821, now seen corresponding path program 1 times [2021-11-07 01:46:06,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:06,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678496146] [2021-11-07 01:46:06,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:06,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:06,208 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:06,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678496146] [2021-11-07 01:46:06,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678496146] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:06,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:06,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 01:46:06,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994369973] [2021-11-07 01:46:06,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:46:06,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:06,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:46:06,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:46:06,211 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) [2021-11-07 01:46:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:06,554 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2021-11-07 01:46:06,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:46:06,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 [2021-11-07 01:46:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:06,559 INFO L225 Difference]: With dead ends: 105 [2021-11-07 01:46:06,559 INFO L226 Difference]: Without dead ends: 105 [2021-11-07 01:46:06,561 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:46:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-07 01:46:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2021-11-07 01:46:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2021-11-07 01:46:06,581 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 11 [2021-11-07 01:46:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:06,581 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2021-11-07 01:46:06,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) [2021-11-07 01:46:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2021-11-07 01:46:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:46:06,582 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:06,583 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:06,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:46:06,589 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1324031820, now seen corresponding path program 1 times [2021-11-07 01:46:06,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:06,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630447708] [2021-11-07 01:46:06,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:06,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:06,745 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:06,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630447708] [2021-11-07 01:46:06,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630447708] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:06,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:06,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 01:46:06,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726933032] [2021-11-07 01:46:06,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 01:46:06,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:06,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 01:46:06,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:46:06,748 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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) [2021-11-07 01:46:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:07,270 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2021-11-07 01:46:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 01:46:07,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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 [2021-11-07 01:46:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:07,274 INFO L225 Difference]: With dead ends: 102 [2021-11-07 01:46:07,274 INFO L226 Difference]: Without dead ends: 102 [2021-11-07 01:46:07,275 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-11-07 01:46:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-07 01:46:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2021-11-07 01:46:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2021-11-07 01:46:07,277 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 11 [2021-11-07 01:46:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:07,277 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2021-11-07 01:46:07,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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) [2021-11-07 01:46:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2021-11-07 01:46:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:46:07,278 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:07,279 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:07,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:46:07,279 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:07,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1004879300, now seen corresponding path program 1 times [2021-11-07 01:46:07,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:07,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105771300] [2021-11-07 01:46:07,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:07,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:07,391 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:07,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105771300] [2021-11-07 01:46:07,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105771300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:07,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:07,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:46:07,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001637814] [2021-11-07 01:46:07,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:46:07,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:07,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:46:07,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:46:07,398 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:07,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:07,529 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2021-11-07 01:46:07,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:46:07,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 01:46:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:07,530 INFO L225 Difference]: With dead ends: 100 [2021-11-07 01:46:07,530 INFO L226 Difference]: Without dead ends: 100 [2021-11-07 01:46:07,530 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:46:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-07 01:46:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2021-11-07 01:46:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 95 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2021-11-07 01:46:07,534 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 13 [2021-11-07 01:46:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:07,534 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2021-11-07 01:46:07,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2021-11-07 01:46:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:46:07,535 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:07,535 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:07,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:46:07,536 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:07,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1084223849, now seen corresponding path program 1 times [2021-11-07 01:46:07,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:07,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877722422] [2021-11-07 01:46:07,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:07,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:07,575 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:07,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877722422] [2021-11-07 01:46:07,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877722422] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:07,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:07,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:46:07,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586707287] [2021-11-07 01:46:07,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:46:07,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:07,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:46:07,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:46:07,578 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:07,713 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2021-11-07 01:46:07,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:46:07,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-07 01:46:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:07,715 INFO L225 Difference]: With dead ends: 95 [2021-11-07 01:46:07,715 INFO L226 Difference]: Without dead ends: 95 [2021-11-07 01:46:07,715 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:46:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-07 01:46:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-11-07 01:46:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.6029411764705883) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2021-11-07 01:46:07,719 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 14 [2021-11-07 01:46:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:07,719 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2021-11-07 01:46:07,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2021-11-07 01:46:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:46:07,720 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:07,720 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:07,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:46:07,720 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1084223848, now seen corresponding path program 1 times [2021-11-07 01:46:07,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:07,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416791148] [2021-11-07 01:46:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:07,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:07,775 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:07,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416791148] [2021-11-07 01:46:07,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416791148] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:07,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:07,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:46:07,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044779355] [2021-11-07 01:46:07,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:46:07,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:07,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:46:07,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:46:07,777 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:07,900 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2021-11-07 01:46:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:46:07,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-07 01:46:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:07,901 INFO L225 Difference]: With dead ends: 92 [2021-11-07 01:46:07,901 INFO L226 Difference]: Without dead ends: 92 [2021-11-07 01:46:07,902 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:46:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-07 01:46:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-11-07 01:46:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2021-11-07 01:46:07,904 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 14 [2021-11-07 01:46:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:07,904 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2021-11-07 01:46:07,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2021-11-07 01:46:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 01:46:07,905 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:07,905 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:07,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:46:07,906 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1203608841, now seen corresponding path program 1 times [2021-11-07 01:46:07,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:07,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411445528] [2021-11-07 01:46:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:07,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:08,019 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:08,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411445528] [2021-11-07 01:46:08,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411445528] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:46:08,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740255923] [2021-11-07 01:46:08,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:08,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:46:08,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:46:08,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:46:08,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:46:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:08,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 01:46:08,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:46:08,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-07 01:46:08,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 01:46:08,386 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-07 01:46:08,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2021-11-07 01:46:08,442 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_main_~x~0.offset] [2021-11-07 01:46:08,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1532673703] [2021-11-07 01:46:08,475 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 01:46:08,475 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:46:08,479 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-07 01:46:08,485 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-07 01:46:08,485 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-07 01:46:08,556 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,558 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:08,558 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,559 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-11-07 01:46:08,560 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:08,579 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,580 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-11-07 01:46:08,583 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-11-07 01:46:08,595 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_104|], 10=[|v_#valid_112|]} [2021-11-07 01:46:08,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-11-07 01:46:08,611 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,613 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:46:08,613 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,614 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:46:08,614 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:08,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:08,637 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-07 01:46:08,663 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,665 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:46:08,666 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,667 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:46:08,668 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:08,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:08,680 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,683 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,688 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 97 [2021-11-07 01:46:08,688 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:46:08,689 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:97 [2021-11-07 01:46:08,695 INFO L180 QuantifierPusher]: treesize reduction 3, result has 98.0 percent of original size [2021-11-07 01:46:08,701 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:08,702 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,702 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-11-07 01:46:08,703 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:08,704 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,704 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-11-07 01:46:08,708 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:08,709 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,710 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-11-07 01:46:08,713 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 150 [2021-11-07 01:46:08,735 INFO L446 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_82|, |v_#memory_$Pointer$.offset_82|], 6=[|v_#memory_int_63|]} [2021-11-07 01:46:08,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 01:46:08,745 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,746 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:46:08,746 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,746 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:46:08,747 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:08,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:08,754 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 01:46:08,762 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,762 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:46:08,763 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,763 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:46:08,763 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:08,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:08,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 01:46:08,792 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,797 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:08,799 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,799 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:08,799 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:08,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:08,809 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,812 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,814 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 123 [2021-11-07 01:46:08,815 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:46:08,815 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:146, output treesize:123 [2021-11-07 01:46:08,824 INFO L180 QuantifierPusher]: treesize reduction 12, result has 93.4 percent of original size [2021-11-07 01:46:08,826 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:08,827 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,828 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:46:08,829 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:08,830 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,832 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-11-07 01:46:08,833 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:08,834 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,834 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:46:08,838 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 174 [2021-11-07 01:46:08,844 INFO L446 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_83|, |v_#memory_$Pointer$.base_83|], 6=[|v_#memory_int_64|]} [2021-11-07 01:46:08,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-07 01:46:08,856 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,858 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:08,858 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,859 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:08,859 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:08,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:08,877 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-07 01:46:08,887 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,888 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:08,889 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,889 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:08,889 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:08,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:08,905 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:08,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-07 01:46:08,921 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,923 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:08,924 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,924 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:08,925 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:08,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:08,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,954 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,956 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 141 [2021-11-07 01:46:08,957 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:46:08,957 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:168, output treesize:141 [2021-11-07 01:46:08,972 INFO L180 QuantifierPusher]: treesize reduction 12, result has 94.3 percent of original size [2021-11-07 01:46:08,974 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:08,975 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,975 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-11-07 01:46:08,976 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:08,977 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,979 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-11-07 01:46:08,979 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:08,981 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:08,982 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-11-07 01:46:08,985 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 204 [2021-11-07 01:46:09,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-07 01:46:09,008 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,010 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:09,012 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,012 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:09,013 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-07 01:46:09,037 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,039 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-07 01:46:09,040 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,040 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-07 01:46:09,040 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,053 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-07 01:46:09,073 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,075 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:09,076 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,076 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:09,076 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,093 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,097 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2021-11-07 01:46:09,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,098 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:198, output treesize:156 [2021-11-07 01:46:09,113 INFO L180 QuantifierPusher]: treesize reduction 8, result has 95.2 percent of original size [2021-11-07 01:46:09,120 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2021-11-07 01:46:09,135 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,144 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,145 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,145 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-11-07 01:46:09,152 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 174 [2021-11-07 01:46:09,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,180 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 01:46:09,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2021-11-07 01:46:09,181 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,184 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-11-07 01:46:09,184 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,185 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-11-07 01:46:09,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,198 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,205 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 171 [2021-11-07 01:46:09,206 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,207 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:172, output treesize:171 [2021-11-07 01:46:09,217 INFO L180 QuantifierPusher]: treesize reduction 5, result has 97.9 percent of original size [2021-11-07 01:46:09,219 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,220 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,221 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-11-07 01:46:09,223 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,223 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,224 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-11-07 01:46:09,225 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,226 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,227 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-11-07 01:46:09,232 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 240 [2021-11-07 01:46:09,239 INFO L446 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_85|, |v_#memory_$Pointer$.offset_85|], 12=[|v_#memory_int_66|]} [2021-11-07 01:46:09,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-07 01:46:09,252 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,254 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:09,255 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,255 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:09,255 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,269 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-07 01:46:09,288 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,291 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:09,292 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,292 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:46:09,293 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,304 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-07 01:46:09,330 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,332 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-11-07 01:46:09,333 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,333 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-11-07 01:46:09,334 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,342 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,347 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,353 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 192 [2021-11-07 01:46:09,353 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,354 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:234, output treesize:192 [2021-11-07 01:46:09,364 INFO L180 QuantifierPusher]: treesize reduction 10, result has 95.8 percent of original size [2021-11-07 01:46:09,366 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,366 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,367 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-11-07 01:46:09,368 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,368 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,369 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-11-07 01:46:09,370 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,370 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,371 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-11-07 01:46:09,377 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 235 [2021-11-07 01:46:09,381 INFO L446 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_86|, |v_#memory_$Pointer$.offset_86|], 20=[|v_#memory_int_67|]} [2021-11-07 01:46:09,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-11-07 01:46:09,394 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,395 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-11-07 01:46:09,396 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,397 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-11-07 01:46:09,397 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-11-07 01:46:09,419 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,420 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-11-07 01:46:09,421 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,421 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-11-07 01:46:09,421 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,430 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2021-11-07 01:46:09,446 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,449 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-11-07 01:46:09,449 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,450 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-11-07 01:46:09,450 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,465 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,470 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 206 [2021-11-07 01:46:09,471 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,471 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:229, output treesize:206 [2021-11-07 01:46:09,480 INFO L180 QuantifierPusher]: treesize reduction 12, result has 95.6 percent of original size [2021-11-07 01:46:09,490 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,491 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,492 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,493 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,493 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-11-07 01:46:09,494 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-11-07 01:46:09,495 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,495 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,496 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,497 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,497 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-11-07 01:46:09,498 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-11-07 01:46:09,499 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,499 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,501 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,502 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,503 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 127 [2021-11-07 01:46:09,503 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 128 [2021-11-07 01:46:09,504 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:46:09,505 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,507 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 191 [2021-11-07 01:46:09,510 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 280 [2021-11-07 01:46:09,514 INFO L446 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.base_87|, |v_#memory_$Pointer$.offset_87|], 20=[|v_#memory_int_68|]} [2021-11-07 01:46:09,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 01:46:09,539 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-07 01:46:09,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 95 [2021-11-07 01:46:09,541 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,543 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 123 [2021-11-07 01:46:09,544 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,545 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 123 [2021-11-07 01:46:09,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2021-11-07 01:46:09,571 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,573 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-11-07 01:46:09,578 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,578 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-11-07 01:46:09,579 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,588 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:46:09,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2021-11-07 01:46:09,607 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,609 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-11-07 01:46:09,609 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,610 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-11-07 01:46:09,610 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:46:09,619 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,622 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,625 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 251 [2021-11-07 01:46:09,625 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:46:09,626 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:278, output treesize:251 [2021-11-07 01:46:09,632 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,639 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 238 [2021-11-07 01:46:09,648 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,652 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 265 [2021-11-07 01:46:09,658 INFO L180 QuantifierPusher]: treesize reduction 12, result has 95.9 percent of original size [2021-11-07 01:46:09,664 INFO L185 QuantifierPusher]: treesize reduction 3, result has 98.9 percent of original size 263 [2021-11-07 01:46:09,674 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:46:09,678 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 265 [2021-11-07 01:46:09,682 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-07 01:46:12,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1532673703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:12,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:46:12,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 18 [2021-11-07 01:46:12,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040338795] [2021-11-07 01:46:12,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:46:12,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:12,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:46:12,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:46:12,325 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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) [2021-11-07 01:46:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:13,303 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2021-11-07 01:46:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:46:13,304 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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 [2021-11-07 01:46:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:13,306 INFO L225 Difference]: With dead ends: 100 [2021-11-07 01:46:13,306 INFO L226 Difference]: Without dead ends: 100 [2021-11-07 01:46:13,306 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:46:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-07 01:46:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2021-11-07 01:46:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 97 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2021-11-07 01:46:13,310 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 16 [2021-11-07 01:46:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:13,310 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2021-11-07 01:46:13,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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) [2021-11-07 01:46:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2021-11-07 01:46:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 01:46:13,312 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:13,312 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:13,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:46:13,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:46:13,521 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:13,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1342877752, now seen corresponding path program 1 times [2021-11-07 01:46:13,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:13,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847804638] [2021-11-07 01:46:13,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:13,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:13,610 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:13,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847804638] [2021-11-07 01:46:13,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847804638] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:13,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:13,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:46:13,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766213638] [2021-11-07 01:46:13,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:46:13,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:46:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:46:13,614 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:13,848 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2021-11-07 01:46:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:46:13,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 01:46:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:13,850 INFO L225 Difference]: With dead ends: 134 [2021-11-07 01:46:13,850 INFO L226 Difference]: Without dead ends: 134 [2021-11-07 01:46:13,850 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:46:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-07 01:46:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 103. [2021-11-07 01:46:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.5) internal successors, (120), 102 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2021-11-07 01:46:13,854 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 17 [2021-11-07 01:46:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:13,855 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2021-11-07 01:46:13,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2021-11-07 01:46:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 01:46:13,856 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:13,856 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:13,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 01:46:13,856 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:13,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:13,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1342877751, now seen corresponding path program 1 times [2021-11-07 01:46:13,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:13,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502778849] [2021-11-07 01:46:13,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:13,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:13,971 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:13,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502778849] [2021-11-07 01:46:13,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502778849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:13,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:13,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:46:13,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653808439] [2021-11-07 01:46:13,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:46:13,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:13,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:46:13,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:46:13,973 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:14,439 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2021-11-07 01:46:14,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:46:14,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 01:46:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:14,441 INFO L225 Difference]: With dead ends: 153 [2021-11-07 01:46:14,441 INFO L226 Difference]: Without dead ends: 153 [2021-11-07 01:46:14,441 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-11-07 01:46:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-07 01:46:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2021-11-07 01:46:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 100 states have (on average 1.54) internal successors, (154), 122 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2021-11-07 01:46:14,446 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 17 [2021-11-07 01:46:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:14,446 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2021-11-07 01:46:14,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2021-11-07 01:46:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 01:46:14,447 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:14,447 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:14,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 01:46:14,448 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:14,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1958547982, now seen corresponding path program 1 times [2021-11-07 01:46:14,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:14,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276676036] [2021-11-07 01:46:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:14,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:14,503 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:14,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276676036] [2021-11-07 01:46:14,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276676036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:14,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:14,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:46:14,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974145163] [2021-11-07 01:46:14,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:46:14,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:14,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:46:14,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:46:14,506 INFO L87 Difference]: Start difference. First operand 123 states and 154 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:14,667 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2021-11-07 01:46:14,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:46:14,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 01:46:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:14,669 INFO L225 Difference]: With dead ends: 173 [2021-11-07 01:46:14,669 INFO L226 Difference]: Without dead ends: 173 [2021-11-07 01:46:14,669 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:46:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-07 01:46:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 132. [2021-11-07 01:46:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.5229357798165137) internal successors, (166), 131 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2021-11-07 01:46:14,673 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 17 [2021-11-07 01:46:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:14,673 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2021-11-07 01:46:14,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2021-11-07 01:46:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:46:14,674 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:14,674 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:14,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 01:46:14,675 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:14,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:14,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1320542220, now seen corresponding path program 1 times [2021-11-07 01:46:14,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:14,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869959068] [2021-11-07 01:46:14,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:14,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:46:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:46:14,707 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:46:14,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869959068] [2021-11-07 01:46:14,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869959068] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:46:14,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:46:14,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:46:14,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080101032] [2021-11-07 01:46:14,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:46:14,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:46:14,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:46:14,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:46:14,709 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:46:14,805 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions. [2021-11-07 01:46:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:46:14,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 01:46:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:46:14,807 INFO L225 Difference]: With dead ends: 143 [2021-11-07 01:46:14,807 INFO L226 Difference]: Without dead ends: 143 [2021-11-07 01:46:14,808 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:46:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-07 01:46:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 132. [2021-11-07 01:46:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.5045871559633028) internal successors, (164), 131 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2021-11-07 01:46:14,812 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 18 [2021-11-07 01:46:14,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:46:14,812 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2021-11-07 01:46:14,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:46:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2021-11-07 01:46:14,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 01:46:14,813 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:46:14,813 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:14,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-07 01:46:14,814 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2021-11-07 01:46:14,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:46:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2015326739, now seen corresponding path program 1 times [2021-11-07 01:46:14,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:46:14,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129615538] [2021-11-07 01:46:14,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:46:14,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:46:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:46:14,831 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:46:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:46:14,904 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:46:14,906 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:46:14,907 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:46:14,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-07 01:46:14,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-07 01:46:14,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-07 01:46:14,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-07 01:46:14,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-07 01:46:14,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-07 01:46:14,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-07 01:46:14,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-07 01:46:14,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-07 01:46:14,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-07 01:46:14,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-07 01:46:14,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-07 01:46:14,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-07 01:46:14,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-07 01:46:14,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-07 01:46:14,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-07 01:46:14,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-07 01:46:14,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-07 01:46:14,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-07 01:46:14,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-07 01:46:14,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-07 01:46:14,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-07 01:46:14,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-11-07 01:46:14,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-07 01:46:14,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-07 01:46:14,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-11-07 01:46:14,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-07 01:46:14,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-07 01:46:14,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-11-07 01:46:14,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-07 01:46:14,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-07 01:46:14,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-11-07 01:46:14,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-11-07 01:46:14,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-07 01:46:14,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-07 01:46:14,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-11-07 01:46:14,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-07 01:46:14,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-07 01:46:14,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-07 01:46:14,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-07 01:46:14,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-07 01:46:14,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-07 01:46:14,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-07 01:46:14,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-07 01:46:14,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-11-07 01:46:14,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-11-07 01:46:14,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-11-07 01:46:14,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-11-07 01:46:14,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-11-07 01:46:14,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-07 01:46:14,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-11-07 01:46:14,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-11-07 01:46:14,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-11-07 01:46:14,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-11-07 01:46:14,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-11-07 01:46:14,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-11-07 01:46:14,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:46:14,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:46:14,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:46:14,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:46:14,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-07 01:46:14,925 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:46:14,929 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:46:14,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:46:14 BoogieIcfgContainer [2021-11-07 01:46:14,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:46:14,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:46:14,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:46:14,970 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:46:14,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:46:04" (3/4) ... [2021-11-07 01:46:14,973 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 01:46:15,032 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:46:15,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:46:15,033 INFO L168 Benchmark]: Toolchain (without parser) took 12687.18 ms. Allocated memory was 83.9 MB in the beginning and 140.5 MB in the end (delta: 56.6 MB). Free memory was 44.2 MB in the beginning and 67.3 MB in the end (delta: -23.1 MB). Peak memory consumption was 34.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:46:15,033 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 83.9 MB. Free memory was 62.3 MB in the beginning and 62.2 MB in the end (delta: 62.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:46:15,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.51 ms. Allocated memory was 83.9 MB in the beginning and 111.1 MB in the end (delta: 27.3 MB). Free memory was 44.1 MB in the beginning and 80.9 MB in the end (delta: -36.9 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:46:15,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.60 ms. Allocated memory is still 111.1 MB. Free memory was 80.9 MB in the beginning and 78.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:46:15,035 INFO L168 Benchmark]: Boogie Preprocessor took 77.03 ms. Allocated memory is still 111.1 MB. Free memory was 78.8 MB in the beginning and 77.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:46:15,035 INFO L168 Benchmark]: RCFGBuilder took 994.17 ms. Allocated memory is still 111.1 MB. Free memory was 77.0 MB in the beginning and 50.7 MB in the end (delta: 26.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:46:15,036 INFO L168 Benchmark]: TraceAbstraction took 10878.14 ms. Allocated memory was 111.1 MB in the beginning and 140.5 MB in the end (delta: 29.4 MB). Free memory was 50.3 MB in the beginning and 69.4 MB in the end (delta: -19.2 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:46:15,044 INFO L168 Benchmark]: Witness Printer took 62.94 ms. Allocated memory is still 140.5 MB. Free memory was 69.4 MB in the beginning and 67.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:46:15,049 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.28 ms. Allocated memory is still 83.9 MB. Free memory was 62.3 MB in the beginning and 62.2 MB in the end (delta: 62.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 585.51 ms. Allocated memory was 83.9 MB in the beginning and 111.1 MB in the end (delta: 27.3 MB). Free memory was 44.1 MB in the beginning and 80.9 MB in the end (delta: -36.9 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.60 ms. Allocated memory is still 111.1 MB. Free memory was 80.9 MB in the beginning and 78.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 77.03 ms. Allocated memory is still 111.1 MB. Free memory was 78.8 MB in the beginning and 77.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 994.17 ms. Allocated memory is still 111.1 MB. Free memory was 77.0 MB in the beginning and 50.7 MB in the end (delta: 26.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10878.14 ms. Allocated memory was 111.1 MB in the beginning and 140.5 MB in the end (delta: 29.4 MB). Free memory was 50.3 MB in the beginning and 69.4 MB in the end (delta: -19.2 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. * Witness Printer took 62.94 ms. Allocated memory is still 140.5 MB. Free memory was 69.4 MB in the beginning and 67.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - CounterExampleResult [Line: 1063]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1000] SLL* head = malloc(sizeof(SLL)); [L1001] head->next = ((void*)0) [L1002] head->prev = ((void*)0) [L1003] head->data = 0 [L1005] SLL* x = head; [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1019] COND TRUE __VERIFIER_nondet_int() [L1020] x = malloc(sizeof(SLL)) [L1021] x->data = 1 [L1022] x->next = head [L1023] x->prev = ((void*)0) [L1024] head = x [L1050] x = head [L1053] EXPR x->data [L1053] COND FALSE !(x->data != 1) [L1059] EXPR x->next [L1059] x = x->next [L1060] COND TRUE \read(*x) [L1062] EXPR x->data [L1062] COND TRUE x->data != 1 [L1063] reach_error() - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1073]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1073]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1073]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 61 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 834 SDtfs, 1305 SDslu, 1067 SDs, 0 SdLazy, 3222 SolverSat, 365 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=15, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 180 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 1382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 1/2 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: OVERALL_TIME[ms]: 1208, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 15, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 18, TOOLS_POST_TIME[ms]: 1093, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 18, TOOLS_QUANTIFIERELIM_TIME[ms]: 1083, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 151, FLUID_QUERY_TIME[ms]: 4, FLUID_QUERIES: 37, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME[ms]: 0, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME[ms]: 2, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME[ms]: 30, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 25, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 24, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 18, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 31, DAG_COMPRESSION_PROCESSED_NODES: 170, DAG_COMPRESSION_RETAINED_NODES: 41, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 01:46:15,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee89655b-ef5e-45cb-8c5a-14daacc5b419/bin/utaipan-UUZaoUuFF8/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)