./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:10:24,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:10:24,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:10:24,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:10:24,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:10:24,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:10:24,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:10:24,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:10:24,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:10:24,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:10:24,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:10:24,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:10:24,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:10:24,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:10:24,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:10:24,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:10:24,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:10:24,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:10:24,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:10:24,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:10:24,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:10:24,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:10:24,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:10:24,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:10:24,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:10:24,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:10:24,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:10:24,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:10:24,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:10:24,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:10:24,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:10:24,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:10:24,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:10:24,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:10:24,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:10:24,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:10:24,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:10:24,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:10:24,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:10:24,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:10:24,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:10:24,206 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-21 01:10:24,235 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:10:24,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:10:24,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:10:24,241 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:10:24,241 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:10:24,242 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:10:24,242 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:10:24,242 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:10:24,242 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:10:24,246 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:10:24,246 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:10:24,246 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:10:24,247 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:10:24,247 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:10:24,247 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:10:24,247 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:10:24,248 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:10:24,248 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:10:24,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 01:10:24,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 01:10:24,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:10:24,249 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:10:24,251 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 01:10:24,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:10:24,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:10:24,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:10:24,252 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 01:10:24,253 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 01:10:24,253 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 01:10:24,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:10:24,254 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 01:10:24,254 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:10:24,254 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:10:24,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:10:24,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:10:24,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:10:24,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:10:24,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:10:24,256 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:10:24,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:10:24,256 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:10:24,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:10:24,257 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_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/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_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2021-11-21 01:10:24,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:10:24,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:10:24,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:10:24,598 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:10:24,599 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:10:24,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2021-11-21 01:10:24,675 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/data/afa90cb09/884b9204a9e04aa6b23f27f44ebbe883/FLAG2c543b0a6 [2021-11-21 01:10:25,247 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:10:25,247 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2021-11-21 01:10:25,263 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/data/afa90cb09/884b9204a9e04aa6b23f27f44ebbe883/FLAG2c543b0a6 [2021-11-21 01:10:25,535 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/data/afa90cb09/884b9204a9e04aa6b23f27f44ebbe883 [2021-11-21 01:10:25,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:10:25,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:10:25,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:10:25,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:10:25,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:10:25,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:10:25" (1/1) ... [2021-11-21 01:10:25,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4597c50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:25, skipping insertion in model container [2021-11-21 01:10:25,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:10:25" (1/1) ... [2021-11-21 01:10:25,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:10:25,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:10:25,977 WARN L230 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_7364aafc-b125-4a40-8095-5764d077f1aa/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2021-11-21 01:10:25,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:10:25,996 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:10:26,065 WARN L230 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_7364aafc-b125-4a40-8095-5764d077f1aa/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2021-11-21 01:10:26,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:10:26,100 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:10:26,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26 WrapperNode [2021-11-21 01:10:26,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:10:26,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:10:26,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:10:26,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:10:26,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26" (1/1) ... [2021-11-21 01:10:26,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26" (1/1) ... [2021-11-21 01:10:26,174 INFO L137 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 106 [2021-11-21 01:10:26,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:10:26,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:10:26,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:10:26,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:10:26,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26" (1/1) ... [2021-11-21 01:10:26,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26" (1/1) ... [2021-11-21 01:10:26,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26" (1/1) ... [2021-11-21 01:10:26,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26" (1/1) ... [2021-11-21 01:10:26,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26" (1/1) ... [2021-11-21 01:10:26,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26" (1/1) ... [2021-11-21 01:10:26,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26" (1/1) ... [2021-11-21 01:10:26,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:10:26,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:10:26,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:10:26,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:10:26,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26" (1/1) ... [2021-11-21 01:10:26,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:10:26,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:10:26,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:10:26,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:10:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 01:10:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 01:10:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 01:10:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 01:10:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 01:10:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:10:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:10:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 01:10:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 01:10:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:10:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 01:10:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:10:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:10:26,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:10:26,475 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:10:26,483 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:10:26,805 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:10:26,851 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:10:26,851 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-21 01:10:26,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:10:26 BoogieIcfgContainer [2021-11-21 01:10:26,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:10:26,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:10:26,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:10:26,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:10:26,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:10:25" (1/3) ... [2021-11-21 01:10:26,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764b8948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:10:26, skipping insertion in model container [2021-11-21 01:10:26,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:26" (2/3) ... [2021-11-21 01:10:26,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764b8948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:10:26, skipping insertion in model container [2021-11-21 01:10:26,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:10:26" (3/3) ... [2021-11-21 01:10:26,864 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2021-11-21 01:10:26,869 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:10:26,869 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2021-11-21 01:10:26,921 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:10:26,930 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-21 01:10:26,930 INFO L340 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2021-11-21 01:10:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:10:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 01:10:26,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:26,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 01:10:26,960 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:26,967 INFO L85 PathProgramCache]: Analyzing trace with hash 537029820, now seen corresponding path program 1 times [2021-11-21 01:10:26,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:10:26,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836623586] [2021-11-21 01:10:26,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:26,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:10:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:27,189 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-21 01:10:27,190 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:10:27,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836623586] [2021-11-21 01:10:27,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836623586] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:10:27,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:10:27,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:10:27,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089625237] [2021-11-21 01:10:27,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:10:27,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:10:27,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:10:27,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:10:27,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:10:27,250 INFO L87 Difference]: Start difference. First operand has 58 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:10:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:27,358 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-11-21 01:10:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:10:27,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 01:10:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:27,370 INFO L225 Difference]: With dead ends: 64 [2021-11-21 01:10:27,371 INFO L226 Difference]: Without dead ends: 62 [2021-11-21 01:10:27,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:10:27,379 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:27,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:10:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-21 01:10:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2021-11-21 01:10:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 27 states have (on average 2.111111111111111) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:10:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-11-21 01:10:27,444 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 6 [2021-11-21 01:10:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:27,444 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-11-21 01:10:27,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:10:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-11-21 01:10:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 01:10:27,446 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:27,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 01:10:27,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:10:27,447 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash 413218424, now seen corresponding path program 1 times [2021-11-21 01:10:27,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:10:27,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971911131] [2021-11-21 01:10:27,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:27,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:10:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:27,560 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-21 01:10:27,561 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:10:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971911131] [2021-11-21 01:10:27,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971911131] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:10:27,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:10:27,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:10:27,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559230191] [2021-11-21 01:10:27,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:10:27,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:10:27,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:10:27,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:10:27,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:10:27,564 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:10:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:27,632 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2021-11-21 01:10:27,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:10:27,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 01:10:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:27,635 INFO L225 Difference]: With dead ends: 55 [2021-11-21 01:10:27,635 INFO L226 Difference]: Without dead ends: 55 [2021-11-21 01:10:27,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:10:27,638 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:27,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:10:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-11-21 01:10:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-11-21 01:10:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 27 states have (on average 2.037037037037037) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:10:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-11-21 01:10:27,648 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 6 [2021-11-21 01:10:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:27,648 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-11-21 01:10:27,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:10:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-11-21 01:10:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 01:10:27,649 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:27,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 01:10:27,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:10:27,650 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:27,651 INFO L85 PathProgramCache]: Analyzing trace with hash 413218425, now seen corresponding path program 1 times [2021-11-21 01:10:27,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:10:27,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618103078] [2021-11-21 01:10:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:27,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:10:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:27,744 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-21 01:10:27,746 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:10:27,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618103078] [2021-11-21 01:10:27,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618103078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:10:27,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:10:27,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:10:27,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854380260] [2021-11-21 01:10:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:10:27,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:10:27,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:10:27,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:10:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:10:27,755 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:10:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:27,857 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-11-21 01:10:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:10:27,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 01:10:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:27,860 INFO L225 Difference]: With dead ends: 53 [2021-11-21 01:10:27,860 INFO L226 Difference]: Without dead ends: 53 [2021-11-21 01:10:27,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:10:27,862 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:27,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:10:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-21 01:10:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-21 01:10:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 27 states have (on average 1.962962962962963) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:10:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-11-21 01:10:27,877 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 6 [2021-11-21 01:10:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:27,877 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-11-21 01:10:27,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:10:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-11-21 01:10:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:10:27,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:27,879 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:27,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 01:10:27,880 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:27,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:27,883 INFO L85 PathProgramCache]: Analyzing trace with hash -538994220, now seen corresponding path program 1 times [2021-11-21 01:10:27,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:10:27,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776655353] [2021-11-21 01:10:27,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:27,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:10:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:27,999 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-21 01:10:28,000 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:10:28,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776655353] [2021-11-21 01:10:28,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776655353] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:10:28,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:10:28,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:10:28,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508639750] [2021-11-21 01:10:28,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:10:28,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:10:28,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:10:28,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:10:28,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:10:28,006 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:10:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:28,157 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2021-11-21 01:10:28,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:10:28,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-21 01:10:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:28,166 INFO L225 Difference]: With dead ends: 53 [2021-11-21 01:10:28,167 INFO L226 Difference]: Without dead ends: 53 [2021-11-21 01:10:28,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:10:28,169 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:28,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:10:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-21 01:10:28,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-11-21 01:10:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:10:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-11-21 01:10:28,188 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2021-11-21 01:10:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:28,189 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-11-21 01:10:28,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:10:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-11-21 01:10:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:10:28,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:28,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:28,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 01:10:28,192 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:28,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:28,193 INFO L85 PathProgramCache]: Analyzing trace with hash -538994219, now seen corresponding path program 1 times [2021-11-21 01:10:28,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:10:28,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259426773] [2021-11-21 01:10:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:28,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:10:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:28,317 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-21 01:10:28,319 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:10:28,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259426773] [2021-11-21 01:10:28,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259426773] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:10:28,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:10:28,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:10:28,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853199381] [2021-11-21 01:10:28,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:10:28,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:10:28,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:10:28,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:10:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:10:28,325 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:10:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:28,504 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2021-11-21 01:10:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:10:28,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-21 01:10:28,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:28,509 INFO L225 Difference]: With dead ends: 52 [2021-11-21 01:10:28,509 INFO L226 Difference]: Without dead ends: 52 [2021-11-21 01:10:28,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:10:28,515 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:28,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 145 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:10:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-21 01:10:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-11-21 01:10:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:10:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-11-21 01:10:28,535 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 10 [2021-11-21 01:10:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:28,535 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-11-21 01:10:28,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:10:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2021-11-21 01:10:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-21 01:10:28,538 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:28,538 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:28,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-21 01:10:28,538 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:28,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 188930738, now seen corresponding path program 1 times [2021-11-21 01:10:28,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:10:28,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842293596] [2021-11-21 01:10:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:28,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:10:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 01:10:28,655 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:10:28,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842293596] [2021-11-21 01:10:28,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842293596] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:10:28,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144571995] [2021-11-21 01:10:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:28,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:10:28,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:10:28,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:10:28,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 01:10:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:28,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:10:28,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:10:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:10:28,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:10:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 01:10:29,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144571995] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:10:29,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1599826769] [2021-11-21 01:10:29,089 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-21 01:10:29,089 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:10:29,093 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:10:29,099 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:10:29,099 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:10:29,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:10:29,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:10:29,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-21 01:10:29,530 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 01:10:29,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 01:10:29,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:10:29,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-21 01:10:29,650 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 13 treesize of output 9 [2021-11-21 01:10:29,664 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 19 treesize of output 1 [2021-11-21 01:10:29,676 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 13 treesize of output 9 [2021-11-21 01:10:29,695 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-21 01:10:29,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:10:29,726 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 25 treesize of output 13 [2021-11-21 01:10:29,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:10:29,737 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 25 treesize of output 13 [2021-11-21 01:10:29,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:10:29,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:10:29,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 01:10:29,941 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 01:10:29,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 01:10:30,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:10:30,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:10:30,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 01:10:30,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:10:30,401 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 27 treesize of output 11 [2021-11-21 01:10:30,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:10:30,481 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 21 treesize of output 13 [2021-11-21 01:10:30,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:10:30,515 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 21 treesize of output 13 [2021-11-21 01:10:30,760 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:10:30,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:10:30,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 01:10:30,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 01:10:30,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 01:10:30,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 01:10:30,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 01:10:31,032 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:10:31,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:10:31,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 01:10:31,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 01:10:31,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 01:10:31,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 01:10:31,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 01:10:31,811 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-21 01:10:31,811 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 229 treesize of output 209 [2021-11-21 01:10:31,827 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 01:10:31,828 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 210 treesize of output 198 [2021-11-21 01:10:31,843 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 01:10:31,844 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 201 treesize of output 189 [2021-11-21 01:10:32,419 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:10:32,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:10:32,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 01:10:32,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 01:10:32,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 01:10:32,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 01:10:32,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 01:10:32,805 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:10:32,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:10:32,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 01:10:32,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 01:10:32,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 01:10:33,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 01:10:33,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 01:10:33,645 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-21 01:10:33,645 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 229 treesize of output 209 [2021-11-21 01:10:33,662 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 01:10:33,663 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 210 treesize of output 198 [2021-11-21 01:10:33,679 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 01:10:33,680 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 207 treesize of output 195 [2021-11-21 01:10:34,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:10:34,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:10:34,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:10:34,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:10:35,774 INFO L354 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2021-11-21 01:10:35,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 360 treesize of output 365 [2021-11-21 01:10:36,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:10:36,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:10:36,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 01:10:37,739 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 101 for LOIs [2021-11-21 01:10:43,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:10:44,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-21 01:10:44,007 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Some non-self update cases but no top-level DER relation at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:340) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:278) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-21 01:10:44,018 INFO L158 Benchmark]: Toolchain (without parser) took 18478.93ms. Allocated memory was 111.1MB in the beginning and 157.3MB in the end (delta: 46.1MB). Free memory was 72.9MB in the beginning and 78.6MB in the end (delta: -5.7MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2021-11-21 01:10:44,018 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 111.1MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:10:44,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.54ms. Allocated memory is still 111.1MB. Free memory was 72.7MB in the beginning and 80.6MB in the end (delta: -7.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 01:10:44,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.68ms. Allocated memory is still 111.1MB. Free memory was 80.6MB in the beginning and 78.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:10:44,020 INFO L158 Benchmark]: Boogie Preprocessor took 66.94ms. Allocated memory is still 111.1MB. Free memory was 78.4MB in the beginning and 76.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:10:44,020 INFO L158 Benchmark]: RCFGBuilder took 611.05ms. Allocated memory is still 111.1MB. Free memory was 76.8MB in the beginning and 58.8MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-21 01:10:44,021 INFO L158 Benchmark]: TraceAbstraction took 17160.90ms. Allocated memory was 111.1MB in the beginning and 157.3MB in the end (delta: 46.1MB). Free memory was 58.4MB in the beginning and 78.6MB in the end (delta: -20.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2021-11-21 01:10:44,023 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.24ms. Allocated memory is still 111.1MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.54ms. Allocated memory is still 111.1MB. Free memory was 72.7MB in the beginning and 80.6MB in the end (delta: -7.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.68ms. Allocated memory is still 111.1MB. Free memory was 80.6MB in the beginning and 78.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.94ms. Allocated memory is still 111.1MB. Free memory was 78.4MB in the beginning and 76.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.05ms. Allocated memory is still 111.1MB. Free memory was 76.8MB in the beginning and 58.8MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17160.90ms. Allocated memory was 111.1MB in the beginning and 157.3MB in the end (delta: 46.1MB). Free memory was 58.4MB in the beginning and 78.6MB in the end (delta: -20.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Some non-self update cases but no top-level DER relation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Some non-self update cases but no top-level DER relation: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-21 01:10:44,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:10:46,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:10:46,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:10:46,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:10:46,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:10:46,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:10:46,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:10:46,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:10:46,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:10:46,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:10:46,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:10:46,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:10:46,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:10:46,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:10:46,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:10:46,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:10:46,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:10:46,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:10:46,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:10:46,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:10:46,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:10:46,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:10:46,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:10:46,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:10:46,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:10:46,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:10:46,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:10:46,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:10:46,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:10:46,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:10:46,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:10:46,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:10:46,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:10:46,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:10:46,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:10:46,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:10:46,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:10:46,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:10:46,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:10:46,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:10:46,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:10:46,886 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-21 01:10:46,936 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:10:46,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:10:46,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:10:46,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:10:46,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:10:46,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:10:46,939 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:10:46,939 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:10:46,939 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:10:46,939 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:10:46,940 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:10:46,941 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:10:46,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 01:10:46,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 01:10:46,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:10:46,943 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:10:46,943 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 01:10:46,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:10:46,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:10:46,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:10:46,944 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 01:10:46,944 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 01:10:46,945 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 01:10:46,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:10:46,945 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 01:10:46,945 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 01:10:46,945 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 01:10:46,946 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:10:46,946 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:10:46,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:10:46,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 01:10:46,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:10:46,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:10:46,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:10:46,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:10:46,948 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 01:10:46,949 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 01:10:46,949 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:10:46,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:10:46,949 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/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_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2021-11-21 01:10:47,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:10:47,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:10:47,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:10:47,361 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:10:47,361 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:10:47,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2021-11-21 01:10:47,428 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/data/ce3fc5621/4a1abdb3233d4cd2ab9a94e94fa61324/FLAGdf6c68cb4 [2021-11-21 01:10:48,084 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:10:48,085 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2021-11-21 01:10:48,112 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/data/ce3fc5621/4a1abdb3233d4cd2ab9a94e94fa61324/FLAGdf6c68cb4 [2021-11-21 01:10:48,331 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/data/ce3fc5621/4a1abdb3233d4cd2ab9a94e94fa61324 [2021-11-21 01:10:48,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:10:48,335 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:10:48,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:10:48,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:10:48,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:10:48,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:48,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ebea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48, skipping insertion in model container [2021-11-21 01:10:48,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:48,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:10:48,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:10:48,833 WARN L230 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_7364aafc-b125-4a40-8095-5764d077f1aa/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2021-11-21 01:10:48,837 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:10:48,861 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:10:48,941 WARN L230 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_7364aafc-b125-4a40-8095-5764d077f1aa/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2021-11-21 01:10:48,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:10:48,997 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:10:48,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48 WrapperNode [2021-11-21 01:10:48,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:10:49,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:10:49,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:10:49,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:10:49,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:49,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:49,094 INFO L137 Inliner]: procedures = 130, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 107 [2021-11-21 01:10:49,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:10:49,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:10:49,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:10:49,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:10:49,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:49,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:49,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:49,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:49,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:49,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:49,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:49,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:10:49,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:10:49,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:10:49,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:10:49,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48" (1/1) ... [2021-11-21 01:10:49,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:10:49,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:10:49,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:10:49,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:10:49,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-21 01:10:49,248 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 01:10:49,248 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 01:10:49,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 01:10:49,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:10:49,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:10:49,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 01:10:49,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 01:10:49,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:10:49,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-21 01:10:49,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 01:10:49,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 01:10:49,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:10:49,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:10:49,460 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:10:49,461 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:10:49,945 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:10:49,953 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:10:49,955 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-21 01:10:49,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:10:49 BoogieIcfgContainer [2021-11-21 01:10:49,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:10:49,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:10:49,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:10:49,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:10:49,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:10:48" (1/3) ... [2021-11-21 01:10:49,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0e6fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:10:49, skipping insertion in model container [2021-11-21 01:10:49,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:48" (2/3) ... [2021-11-21 01:10:49,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0e6fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:10:49, skipping insertion in model container [2021-11-21 01:10:49,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:10:49" (3/3) ... [2021-11-21 01:10:49,966 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2021-11-21 01:10:49,973 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:10:49,973 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2021-11-21 01:10:50,044 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:10:50,056 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-21 01:10:50,057 INFO L340 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2021-11-21 01:10:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:10:50,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 01:10:50,091 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:50,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:50,092 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:50,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073593, now seen corresponding path program 1 times [2021-11-21 01:10:50,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:10:50,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652746409] [2021-11-21 01:10:50,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:50,112 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:10:50,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:10:50,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:10:50,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 01:10:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:50,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 01:10:50,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:10:50,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:10:50,386 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-21 01:10:50,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:10:50,437 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-21 01:10:50,438 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:10:50,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652746409] [2021-11-21 01:10:50,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652746409] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:10:50,440 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:10:50,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 01:10:50,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397602374] [2021-11-21 01:10:50,447 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:10:50,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:10:50,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:10:50,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:10:50,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:10:50,500 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:10:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:50,653 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2021-11-21 01:10:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:10:50,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-21 01:10:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:50,676 INFO L225 Difference]: With dead ends: 71 [2021-11-21 01:10:50,676 INFO L226 Difference]: Without dead ends: 68 [2021-11-21 01:10:50,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-21 01:10:50,681 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:50,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:10:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-21 01:10:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-21 01:10:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.7) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:10:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2021-11-21 01:10:50,725 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 7 [2021-11-21 01:10:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:50,726 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2021-11-21 01:10:50,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:10:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2021-11-21 01:10:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 01:10:50,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:50,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:50,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:10:50,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:10:50,952 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073594, now seen corresponding path program 1 times [2021-11-21 01:10:50,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:10:50,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386536268] [2021-11-21 01:10:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:50,954 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:10:50,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:10:50,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:10:50,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 01:10:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:51,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 01:10:51,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:10:51,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:10:51,076 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-21 01:10:51,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:10:51,152 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-21 01:10:51,153 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:10:51,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386536268] [2021-11-21 01:10:51,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386536268] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:10:51,153 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:10:51,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-21 01:10:51,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785109877] [2021-11-21 01:10:51,154 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:10:51,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:10:51,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:10:51,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:10:51,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:10:51,157 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:10:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:51,361 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-11-21 01:10:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:10:51,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-21 01:10:51,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:51,364 INFO L225 Difference]: With dead ends: 66 [2021-11-21 01:10:51,364 INFO L226 Difference]: Without dead ends: 66 [2021-11-21 01:10:51,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:10:51,366 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:51,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:10:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-21 01:10:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-11-21 01:10:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.65) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:10:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-11-21 01:10:51,376 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2021-11-21 01:10:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:51,376 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-11-21 01:10:51,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:10:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-11-21 01:10:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:10:51,378 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:51,378 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:51,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:10:51,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:10:51,595 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:51,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:51,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584192, now seen corresponding path program 1 times [2021-11-21 01:10:51,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:10:51,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212255489] [2021-11-21 01:10:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:51,602 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:10:51,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:10:51,603 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:10:51,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 01:10:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:51,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:10:51,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:10:51,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:10:51,802 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-21 01:10:51,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:10:51,933 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-21 01:10:51,934 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:10:51,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212255489] [2021-11-21 01:10:51,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212255489] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:10:51,935 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:10:51,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-21 01:10:51,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145496087] [2021-11-21 01:10:51,936 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:10:51,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:10:51,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:10:51,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:10:51,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:10:51,938 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:10:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:52,287 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2021-11-21 01:10:52,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:10:52,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-11-21 01:10:52,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:52,291 INFO L225 Difference]: With dead ends: 70 [2021-11-21 01:10:52,291 INFO L226 Difference]: Without dead ends: 70 [2021-11-21 01:10:52,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:10:52,293 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:52,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 222 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 01:10:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-21 01:10:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2021-11-21 01:10:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.625) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:10:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-11-21 01:10:52,314 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 13 [2021-11-21 01:10:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:52,315 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-11-21 01:10:52,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:10:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-11-21 01:10:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:10:52,316 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:52,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:52,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:10:52,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:10:52,529 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584193, now seen corresponding path program 1 times [2021-11-21 01:10:52,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:10:52,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080682958] [2021-11-21 01:10:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:52,531 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:10:52,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:10:52,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:10:52,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 01:10:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:52,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 01:10:52,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:10:52,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:10:52,814 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-21 01:10:52,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:10:53,272 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-21 01:10:53,272 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:10:53,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080682958] [2021-11-21 01:10:53,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080682958] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:10:53,273 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:10:53,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-21 01:10:53,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627244956] [2021-11-21 01:10:53,273 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:10:53,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 01:10:53,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:10:53,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 01:10:53,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:10:53,275 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:10:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:54,165 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2021-11-21 01:10:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:10:54,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-11-21 01:10:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:54,167 INFO L225 Difference]: With dead ends: 69 [2021-11-21 01:10:54,167 INFO L226 Difference]: Without dead ends: 69 [2021-11-21 01:10:54,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-21 01:10:54,169 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:54,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 407 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-21 01:10:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-11-21 01:10:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2021-11-21 01:10:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.6) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:10:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-11-21 01:10:54,177 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2021-11-21 01:10:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:54,177 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-11-21 01:10:54,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:10:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-11-21 01:10:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 01:10:54,179 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:54,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:54,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 01:10:54,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:10:54,390 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash 869381824, now seen corresponding path program 1 times [2021-11-21 01:10:54,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:10:54,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93195301] [2021-11-21 01:10:54,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:54,392 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:10:54,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:10:54,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:10:54,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-21 01:10:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:54,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:10:54,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:10:54,493 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-21 01:10:54,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:10:54,533 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-21 01:10:54,533 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:10:54,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93195301] [2021-11-21 01:10:54,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93195301] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:10:54,534 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:10:54,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 01:10:54,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089754611] [2021-11-21 01:10:54,535 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:10:54,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:10:54,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:10:54,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:10:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:10:54,536 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:10:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:54,561 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2021-11-21 01:10:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 01:10:54,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-11-21 01:10:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:54,564 INFO L225 Difference]: With dead ends: 71 [2021-11-21 01:10:54,564 INFO L226 Difference]: Without dead ends: 71 [2021-11-21 01:10:54,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:10:54,567 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 8 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:54,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 190 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:10:54,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-21 01:10:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-21 01:10:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:10:54,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2021-11-21 01:10:54,583 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 15 [2021-11-21 01:10:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:54,584 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2021-11-21 01:10:54,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:10:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2021-11-21 01:10:54,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-21 01:10:54,587 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:54,587 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:54,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-21 01:10:54,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:10:54,791 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:10:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash 400923136, now seen corresponding path program 1 times [2021-11-21 01:10:54,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:10:54,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192600686] [2021-11-21 01:10:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:54,793 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:10:54,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:10:54,794 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:10:54,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-21 01:10:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:54,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-21 01:10:54,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:10:54,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:10:55,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-11-21 01:10:55,240 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 01:10:55,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2021-11-21 01:10:55,567 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:10:55,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2021-11-21 01:10:55,850 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:10:55,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 67 [2021-11-21 01:10:56,898 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:10:56,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 68 [2021-11-21 01:10:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:10:57,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:11:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:11:46,784 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:11:46,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192600686] [2021-11-21 01:11:46,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192600686] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:11:46,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [881626114] [2021-11-21 01:11:46,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:11:46,785 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:11:46,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:11:46,796 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:11:46,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-21 01:11:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:11:47,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-21 01:11:47,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:11:47,223 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-21 01:11:47,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-11-21 01:11:47,506 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:11:47,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2021-11-21 01:11:51,932 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:11:51,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 47 [2021-11-21 01:11:52,765 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 01:11:52,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 49 [2021-11-21 01:12:05,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:12:05,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:12:05,452 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-21 01:12:05,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 75 [2021-11-21 01:12:07,255 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 01:12:07,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 54 [2021-11-21 01:12:11,737 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-21 01:12:11,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 91 [2021-11-21 01:12:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-21 01:12:12,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:12:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-21 01:12:56,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [881626114] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 01:12:56,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:12:56,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 10, 11] total 33 [2021-11-21 01:12:56,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53238940] [2021-11-21 01:12:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:12:56,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 01:12:56,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:12:56,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 01:12:56,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=915, Unknown=34, NotChecked=0, Total=1122 [2021-11-21 01:12:56,651 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:12:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:12:56,777 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2021-11-21 01:12:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 01:12:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2021-11-21 01:12:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:12:56,780 INFO L225 Difference]: With dead ends: 81 [2021-11-21 01:12:56,781 INFO L226 Difference]: Without dead ends: 81 [2021-11-21 01:12:56,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 115 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 109.4s TimeCoverageRelationStatistics Valid=173, Invalid=915, Unknown=34, NotChecked=0, Total=1122 [2021-11-21 01:12:56,783 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 43 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:12:56,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 157 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 121 Unchecked, 0.1s Time] [2021-11-21 01:12:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-21 01:12:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2021-11-21 01:12:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:12:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2021-11-21 01:12:56,792 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 41 [2021-11-21 01:12:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:12:56,792 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2021-11-21 01:12:56,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:12:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2021-11-21 01:12:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-21 01:12:56,801 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:12:56,802 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:12:56,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-21 01:12:57,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2021-11-21 01:12:57,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt [2021-11-21 01:12:57,207 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:12:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:12:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash 400923137, now seen corresponding path program 1 times [2021-11-21 01:12:57,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:12:57,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035858162] [2021-11-21 01:12:57,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:12:57,208 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:12:57,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:12:57,210 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:12:57,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-21 01:12:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:12:57,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 01:12:57,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:12:57,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:12:57,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:12:57,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-11-21 01:12:57,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-21 01:12:57,862 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:12:57,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2021-11-21 01:12:57,874 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:12:57,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2021-11-21 01:12:58,167 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 01:12:58,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-11-21 01:12:58,612 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 01:12:58,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2021-11-21 01:12:59,839 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-21 01:12:59,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 36 [2021-11-21 01:13:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:13:00,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:13:13,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (not (bvule |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_55| (_ bv8 32)) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|))))) is different from false [2021-11-21 01:13:17,494 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) is different from false [2021-11-21 01:13:41,802 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) is different from true [2021-11-21 01:14:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 20 not checked. [2021-11-21 01:14:40,534 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:14:40,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035858162] [2021-11-21 01:14:40,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035858162] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:14:40,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [396884666] [2021-11-21 01:14:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:14:40,534 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:14:40,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:14:40,536 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:14:40,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-21 01:14:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:14:40,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 01:14:40,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:14:40,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:14:41,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-21 01:14:43,558 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:14:43,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 17 [2021-11-21 01:14:44,057 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:14:44,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2021-11-21 01:14:50,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:14:50,788 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-21 01:14:50,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 25 [2021-11-21 01:14:55,209 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:14:55,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2021-11-21 01:14:58,141 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 01:14:58,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2021-11-21 01:15:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-21 01:15:00,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:17:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 21 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-21 01:17:31,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [396884666] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:17:31,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744221572] [2021-11-21 01:17:31,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:17:31,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:17:31,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:17:31,751 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:17:31,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-21 01:17:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:17:31,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-21 01:17:31,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:17:31,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:17:31,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:17:37,876 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-21 01:17:37,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-11-21 01:17:37,960 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 01:17:37,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2021-11-21 01:17:39,861 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 01:17:39,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 72 [2021-11-21 01:17:39,955 INFO L354 Elim1Store]: treesize reduction 42, result has 33.3 percent of original size [2021-11-21 01:17:39,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 79 [2021-11-21 01:17:45,677 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 01:17:45,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 108 [2021-11-21 01:17:45,757 INFO L354 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2021-11-21 01:17:45,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 99 [2021-11-21 01:17:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-21 01:17:46,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:17:58,319 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10|)) (bvule |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| .cse0))) (exists ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_79|))))))) (let ((.cse1 (bvadd |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10|))) (not (bvule |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| .cse1)))))))) is different from true [2021-11-21 01:18:03,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_80| (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (and (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_80| (_ bv8 32)) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10|)) (bvule |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| .cse0))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_80|)))) (exists ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_79|))))))) (let ((.cse1 (bvadd |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10|))) (not (bvule |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| .cse1)))))))) is different from false [2021-11-21 01:18:24,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_79|)))))) (exists ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse1)) (not (bvule .cse1 (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv8 32)) |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv1 1)) |v_node_create_~temp~0#1.base_79|))))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49|)))))))) is different from false [2021-11-21 01:22:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 20 not checked. [2021-11-21 01:22:00,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744221572] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:22:00,911 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 01:22:00,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11, 10, 12, 13] total 62 [2021-11-21 01:22:00,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514250580] [2021-11-21 01:22:00,911 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 01:22:00,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-11-21 01:22:00,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:22:00,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-11-21 01:22:00,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2708, Unknown=138, NotChecked=690, Total=3906 [2021-11-21 01:22:00,917 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 63 states, 56 states have (on average 3.25) internal successors, (182), 46 states have internal predecessors, (182), 17 states have call successors, (18), 14 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 17 states have call successors, (18) [2021-11-21 01:22:13,797 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_79|)))))) (exists ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse1)) (not (bvule .cse1 (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv8 32)) |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv1 1)) |v_node_create_~temp~0#1.base_79|))))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49|)))))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|)) is different from false [2021-11-21 01:22:15,856 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_#res#1.base|)))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_79|)))))) (exists ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse1)) (not (bvule .cse1 (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv8 32)) |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv1 1)) |v_node_create_~temp~0#1.base_79|))))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49|)))))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= (store |c_old(#valid)| |c_node_create_#res#1.base| (_ bv1 1)) |c_#valid|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-21 01:22:45,605 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_79|)))))) (exists ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse1)) (not (bvule .cse1 (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv8 32)) |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv1 1)) |v_node_create_~temp~0#1.base_79|))))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49|)))))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|)) is different from false [2021-11-21 01:22:47,648 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_#res#1.base|)))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_79|)))))) (exists ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse1)) (not (bvule .cse1 (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv8 32)) |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv1 1)) |v_node_create_~temp~0#1.base_79|))))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49|)))))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= (store |c_old(#valid)| |c_node_create_#res#1.base| (_ bv1 1)) |c_#valid|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-21 01:23:54,794 WARN L227 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 66 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:23:56,806 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10|)) (bvule |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| .cse0))) (exists ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_79|))))))) (let ((.cse1 (bvadd |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10|))) (not (bvule |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| .cse1)))))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_79|)))))) (exists ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse3)) (not (bvule .cse3 (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv8 32)) |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv1 1)) |v_node_create_~temp~0#1.base_79|))))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49|)))))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|)) is different from false [2021-11-21 01:23:58,861 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10|)) (bvule |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| .cse0))) (exists ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_79|))))))) (let ((.cse1 (bvadd |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_10|))) (not (bvule |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| .cse1)))))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_#res#1.base|)))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_79|)))))) (exists ((|v_node_create_~temp~0#1.base_79| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse3)) (not (bvule .cse3 (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv8 32)) |v_node_create_~temp~0#1.base_79| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49| (_ bv1 1)) |v_node_create_~temp~0#1.base_79|))))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_49|)))))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= (store |c_old(#valid)| |c_node_create_#res#1.base| (_ bv1 1)) |c_#valid|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-21 01:24:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:24:03,953 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-11-21 01:24:03,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-21 01:24:03,954 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 56 states have (on average 3.25) internal successors, (182), 46 states have internal predecessors, (182), 17 states have call successors, (18), 14 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 17 states have call successors, (18) Word has length 41 [2021-11-21 01:24:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:24:03,956 INFO L225 Difference]: With dead ends: 83 [2021-11-21 01:24:03,956 INFO L226 Difference]: Without dead ends: 83 [2021-11-21 01:24:03,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 178 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 502.2s TimeCoverageRelationStatistics Valid=529, Invalid=3629, Unknown=180, NotChecked=1668, Total=6006 [2021-11-21 01:24:03,960 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 18 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 610 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:24:03,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1042 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 610 Unchecked, 0.3s Time] [2021-11-21 01:24:03,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-11-21 01:24:03,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2021-11-21 01:24:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 75 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:24:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2021-11-21 01:24:03,969 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 41 [2021-11-21 01:24:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:24:03,970 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2021-11-21 01:24:03,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 56 states have (on average 3.25) internal successors, (182), 46 states have internal predecessors, (182), 17 states have call successors, (18), 14 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 17 states have call successors, (18) [2021-11-21 01:24:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2021-11-21 01:24:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-21 01:24:03,972 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:24:03,973 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:24:03,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-21 01:24:04,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-21 01:24:04,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-11-21 01:24:04,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:24:04,577 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:24:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:24:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash -456284671, now seen corresponding path program 1 times [2021-11-21 01:24:04,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:24:04,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721062151] [2021-11-21 01:24:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:24:04,578 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:24:04,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:24:04,579 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:24:04,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-21 01:24:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:24:04,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 01:24:04,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:24:04,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:24:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-21 01:24:05,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:24:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-21 01:24:05,769 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:24:05,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721062151] [2021-11-21 01:24:05,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721062151] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:24:05,770 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:24:05,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-21 01:24:05,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604746369] [2021-11-21 01:24:05,770 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:24:05,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 01:24:05,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:24:05,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 01:24:05,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:24:05,772 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 01:24:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:24:06,853 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2021-11-21 01:24:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:24:06,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2021-11-21 01:24:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:24:06,856 INFO L225 Difference]: With dead ends: 81 [2021-11-21 01:24:06,856 INFO L226 Difference]: Without dead ends: 81 [2021-11-21 01:24:06,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-21 01:24:06,857 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:24:06,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 284 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-21 01:24:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-21 01:24:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-11-21 01:24:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:24:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2021-11-21 01:24:06,866 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 42 [2021-11-21 01:24:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:24:06,867 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2021-11-21 01:24:06,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 01:24:06,867 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2021-11-21 01:24:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-21 01:24:06,869 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:24:06,869 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:24:06,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-21 01:24:07,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:24:07,085 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:24:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:24:07,085 INFO L85 PathProgramCache]: Analyzing trace with hash -456284672, now seen corresponding path program 1 times [2021-11-21 01:24:07,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:24:07,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167719507] [2021-11-21 01:24:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:24:07,086 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:24:07,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:24:07,089 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:24:07,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-21 01:24:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:24:07,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:24:07,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:24:07,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:24:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-21 01:24:07,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:24:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-21 01:24:07,647 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:24:07,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167719507] [2021-11-21 01:24:07,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167719507] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:24:07,649 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:24:07,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-21 01:24:07,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792486292] [2021-11-21 01:24:07,650 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:24:07,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:24:07,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:24:07,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:24:07,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:24:07,651 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:24:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:24:08,172 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2021-11-21 01:24:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:24:08,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2021-11-21 01:24:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:24:08,174 INFO L225 Difference]: With dead ends: 92 [2021-11-21 01:24:08,174 INFO L226 Difference]: Without dead ends: 92 [2021-11-21 01:24:08,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:24:08,175 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 01:24:08,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 161 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-21 01:24:08,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-21 01:24:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2021-11-21 01:24:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:24:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-11-21 01:24:08,183 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 42 [2021-11-21 01:24:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:24:08,184 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-11-21 01:24:08,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:24:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-11-21 01:24:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-21 01:24:08,185 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:24:08,186 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:24:08,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-11-21 01:24:08,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:24:08,399 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:24:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:24:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash -402905502, now seen corresponding path program 1 times [2021-11-21 01:24:08,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:24:08,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754528690] [2021-11-21 01:24:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:24:08,401 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:24:08,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:24:08,402 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:24:08,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-21 01:24:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:24:08,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:24:08,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:24:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:24:08,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:24:08,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-11-21 01:24:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:24:09,268 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:24:09,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754528690] [2021-11-21 01:24:09,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754528690] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:24:09,268 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:24:09,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-21 01:24:09,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425065171] [2021-11-21 01:24:09,269 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:24:09,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 01:24:09,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:24:09,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 01:24:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:24:09,270 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 01:24:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:24:09,538 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2021-11-21 01:24:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:24:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2021-11-21 01:24:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:24:09,540 INFO L225 Difference]: With dead ends: 79 [2021-11-21 01:24:09,541 INFO L226 Difference]: Without dead ends: 79 [2021-11-21 01:24:09,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:24:09,542 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 161 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:24:09,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 107 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:24:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-21 01:24:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-11-21 01:24:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:24:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2021-11-21 01:24:09,548 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 44 [2021-11-21 01:24:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:24:09,549 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2021-11-21 01:24:09,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 01:24:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2021-11-21 01:24:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-21 01:24:09,551 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:24:09,551 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:24:09,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-11-21 01:24:09,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:24:09,759 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:24:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:24:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash -645131486, now seen corresponding path program 1 times [2021-11-21 01:24:09,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:24:09,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17936145] [2021-11-21 01:24:09,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:24:09,760 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:24:09,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:24:09,762 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:24:09,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-21 01:24:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:24:09,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:24:09,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:24:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:24:10,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:24:10,091 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-21 01:24:10,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-11-21 01:24:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:24:10,177 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:24:10,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17936145] [2021-11-21 01:24:10,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17936145] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:24:10,177 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:24:10,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-21 01:24:10,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822960898] [2021-11-21 01:24:10,177 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:24:10,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:24:10,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:24:10,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:24:10,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:24:10,179 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:24:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:24:10,375 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2021-11-21 01:24:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 01:24:10,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-11-21 01:24:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:24:10,377 INFO L225 Difference]: With dead ends: 89 [2021-11-21 01:24:10,377 INFO L226 Difference]: Without dead ends: 89 [2021-11-21 01:24:10,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 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-21 01:24:10,379 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 80 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:24:10,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 83 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:24:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-21 01:24:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2021-11-21 01:24:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:24:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2021-11-21 01:24:10,386 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 46 [2021-11-21 01:24:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:24:10,386 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2021-11-21 01:24:10,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:24:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2021-11-21 01:24:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-21 01:24:10,388 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:24:10,388 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:24:10,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-21 01:24:10,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:24:10,603 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:24:10,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:24:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -645131485, now seen corresponding path program 1 times [2021-11-21 01:24:10,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:24:10,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386716527] [2021-11-21 01:24:10,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:24:10,604 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:24:10,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:24:10,605 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:24:10,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-21 01:24:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:24:10,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-21 01:24:10,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:24:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:24:11,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:24:11,352 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 01:24:11,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2021-11-21 01:24:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:24:11,810 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:24:11,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386716527] [2021-11-21 01:24:11,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386716527] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:24:11,811 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:24:11,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-21 01:24:11,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782346805] [2021-11-21 01:24:11,811 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:24:11,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 01:24:11,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:24:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 01:24:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:24:11,813 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 01:24:11,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:24:11,997 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2021-11-21 01:24:11,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:24:11,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2021-11-21 01:24:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:24:11,999 INFO L225 Difference]: With dead ends: 75 [2021-11-21 01:24:11,999 INFO L226 Difference]: Without dead ends: 75 [2021-11-21 01:24:12,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-11-21 01:24:12,000 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 206 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:24:12,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 70 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:24:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-21 01:24:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-11-21 01:24:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:24:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-11-21 01:24:12,006 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 46 [2021-11-21 01:24:12,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:24:12,007 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-11-21 01:24:12,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 01:24:12,007 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-11-21 01:24:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-21 01:24:12,008 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:24:12,009 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:24:12,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-21 01:24:12,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:24:12,215 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:24:12,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:24:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash 866562379, now seen corresponding path program 1 times [2021-11-21 01:24:12,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:24:12,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743989943] [2021-11-21 01:24:12,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:24:12,216 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:24:12,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:24:12,217 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:24:12,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-21 01:24:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:24:12,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-21 01:24:12,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:24:12,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:24:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-11-21 01:24:12,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-11-21 01:24:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-21 01:24:12,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:24:12,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-11-21 01:24:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-21 01:24:13,707 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:24:13,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743989943] [2021-11-21 01:24:13,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743989943] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:24:13,707 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:24:13,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2021-11-21 01:24:13,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559817872] [2021-11-21 01:24:13,708 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:24:13,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-21 01:24:13,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:24:13,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-21 01:24:13,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-21 01:24:13,709 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 12 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-21 01:24:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:24:14,731 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2021-11-21 01:24:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-21 01:24:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2021-11-21 01:24:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:24:14,733 INFO L225 Difference]: With dead ends: 106 [2021-11-21 01:24:14,733 INFO L226 Difference]: Without dead ends: 106 [2021-11-21 01:24:14,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-11-21 01:24:14,734 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 234 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-21 01:24:14,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 215 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 57 Unchecked, 0.8s Time] [2021-11-21 01:24:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-11-21 01:24:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2021-11-21 01:24:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.25) internal successors, (75), 69 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:24:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2021-11-21 01:24:14,741 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 49 [2021-11-21 01:24:14,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:24:14,741 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2021-11-21 01:24:14,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-21 01:24:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2021-11-21 01:24:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-21 01:24:14,743 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:24:14,744 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:24:14,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-11-21 01:24:14,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:24:14,959 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 23 more)] === [2021-11-21 01:24:14,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:24:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash 866562380, now seen corresponding path program 1 times [2021-11-21 01:24:14,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:24:14,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117348392] [2021-11-21 01:24:14,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:24:14,960 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:24:14,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:24:14,961 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:24:14,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7364aafc-b125-4a40-8095-5764d077f1aa/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-21 01:24:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:24:15,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-21 01:24:15,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:24:15,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-21 01:24:15,636 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 17 treesize of output 13 [2021-11-21 01:24:15,650 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 11 treesize of output 7 [2021-11-21 01:24:15,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-11-21 01:24:15,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-11-21 01:24:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-21 01:24:15,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:24:16,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2021-11-21 01:24:16,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2021-11-21 01:24:16,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32