./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS --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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 06:49:08,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:49:08,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:49:08,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:49:08,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:49:08,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:49:08,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:49:08,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:49:08,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:49:08,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:49:08,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:49:08,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:49:08,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:49:08,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:49:08,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:49:08,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:49:08,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:49:08,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:49:08,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:49:08,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:49:08,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:49:08,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:49:08,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:49:08,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:49:08,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:49:08,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:49:08,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:49:08,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:49:08,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:49:08,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:49:08,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:49:08,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:49:08,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:49:08,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:49:08,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:49:08,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:49:08,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:49:08,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:49:08,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:49:08,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:49:08,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:49:08,247 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 06:49:08,270 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:49:08,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:49:08,271 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:49:08,271 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:49:08,272 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:49:08,272 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:49:08,273 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:49:08,273 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:49:08,273 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:49:08,273 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:49:08,274 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:49:08,274 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:49:08,274 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:49:08,274 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:49:08,275 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:49:08,275 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:49:08,275 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:49:08,276 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:49:08,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 06:49:08,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 06:49:08,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:49:08,277 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:49:08,277 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 06:49:08,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:49:08,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:49:08,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:49:08,279 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 06:49:08,279 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 06:49:08,279 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 06:49:08,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:49:08,280 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 06:49:08,280 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:49:08,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:49:08,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:49:08,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:49:08,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:49:08,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:49:08,281 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:49:08,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:49:08,282 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:49:08,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:49:08,282 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:49:08,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/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_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2022-11-19 06:49:08,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:49:08,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:49:08,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:49:08,604 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:49:08,605 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:49:08,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-11-19 06:49:08,680 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/data/8d10b0301/8b6d8f473c88478e94ea6040a598e7e2/FLAGd16359afd [2022-11-19 06:49:09,224 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:49:09,236 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-11-19 06:49:09,251 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/data/8d10b0301/8b6d8f473c88478e94ea6040a598e7e2/FLAGd16359afd [2022-11-19 06:49:09,563 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/data/8d10b0301/8b6d8f473c88478e94ea6040a598e7e2 [2022-11-19 06:49:09,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:49:09,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:49:09,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:49:09,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:49:09,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:49:09,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:09" (1/1) ... [2022-11-19 06:49:09,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4429568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:09, skipping insertion in model container [2022-11-19 06:49:09,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:09" (1/1) ... [2022-11-19 06:49:09,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:49:09,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:49:10,009 WARN L234 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_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-11-19 06:49:10,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:49:10,019 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:49:10,085 WARN L234 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_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-11-19 06:49:10,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:49:10,133 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:49:10,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10 WrapperNode [2022-11-19 06:49:10,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:49:10,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:49:10,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:49:10,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:49:10,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (1/1) ... [2022-11-19 06:49:10,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (1/1) ... [2022-11-19 06:49:10,214 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2022-11-19 06:49:10,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:49:10,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:49:10,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:49:10,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:49:10,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (1/1) ... [2022-11-19 06:49:10,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (1/1) ... [2022-11-19 06:49:10,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (1/1) ... [2022-11-19 06:49:10,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (1/1) ... [2022-11-19 06:49:10,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (1/1) ... [2022-11-19 06:49:10,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (1/1) ... [2022-11-19 06:49:10,280 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (1/1) ... [2022-11-19 06:49:10,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (1/1) ... [2022-11-19 06:49:10,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:49:10,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:49:10,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:49:10,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:49:10,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (1/1) ... [2022-11-19 06:49:10,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:49:10,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:10,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:49:10,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:49:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 06:49:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 06:49:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-19 06:49:10,377 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-19 06:49:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 06:49:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:49:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:49:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 06:49:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 06:49:10,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:49:10,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-19 06:49:10,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:49:10,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:49:10,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:49:10,589 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:49:10,591 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:49:11,005 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:49:11,080 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:49:11,080 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-19 06:49:11,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:49:11 BoogieIcfgContainer [2022-11-19 06:49:11,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:49:11,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:49:11,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:49:11,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:49:11,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:49:09" (1/3) ... [2022-11-19 06:49:11,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7491301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:49:11, skipping insertion in model container [2022-11-19 06:49:11,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:10" (2/3) ... [2022-11-19 06:49:11,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7491301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:49:11, skipping insertion in model container [2022-11-19 06:49:11,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:49:11" (3/3) ... [2022-11-19 06:49:11,098 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-11-19 06:49:11,118 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:49:11,118 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-19 06:49:11,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:49:11,195 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23361773, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:49:11,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-11-19 06:49:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 77 states have internal predecessors, (88), 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) [2022-11-19 06:49:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 06:49:11,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:11,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 06:49:11,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:11,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1977358206, now seen corresponding path program 1 times [2022-11-19 06:49:11,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:11,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666337370] [2022-11-19 06:49:11,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:49:11,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:11,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666337370] [2022-11-19 06:49:11,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666337370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:11,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:11,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:49:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75985920] [2022-11-19 06:49:11,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:11,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:49:11,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:11,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:49:11,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:11,648 INFO L87 Difference]: Start difference. First operand has 81 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 77 states have internal predecessors, (88), 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) [2022-11-19 06:49:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:11,795 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-11-19 06:49:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:49:11,798 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 [2022-11-19 06:49:11,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:11,809 INFO L225 Difference]: With dead ends: 87 [2022-11-19 06:49:11,809 INFO L226 Difference]: Without dead ends: 85 [2022-11-19 06:49:11,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:11,815 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:11,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 143 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-19 06:49:11,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2022-11-19 06:49:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 38 states have (on average 2.236842105263158) internal successors, (85), 76 states have internal predecessors, (85), 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) [2022-11-19 06:49:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-11-19 06:49:11,859 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 6 [2022-11-19 06:49:11,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:11,859 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-11-19 06:49:11,860 INFO L496 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) [2022-11-19 06:49:11,860 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-11-19 06:49:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 06:49:11,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:11,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 06:49:11,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:49:11,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:11,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2132845308, now seen corresponding path program 1 times [2022-11-19 06:49:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:11,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74825644] [2022-11-19 06:49:11,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:49:11,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:11,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74825644] [2022-11-19 06:49:11,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74825644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:11,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:11,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:49:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52111161] [2022-11-19 06:49:11,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:11,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:49:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:11,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:49:11,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:11,944 INFO L87 Difference]: Start difference. First operand 80 states and 89 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) [2022-11-19 06:49:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:12,040 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2022-11-19 06:49:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:49:12,041 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 [2022-11-19 06:49:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:12,042 INFO L225 Difference]: With dead ends: 78 [2022-11-19 06:49:12,042 INFO L226 Difference]: Without dead ends: 78 [2022-11-19 06:49:12,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:12,044 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:12,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 104 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-19 06:49:12,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-19 06:49:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 74 states have internal predecessors, (83), 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) [2022-11-19 06:49:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-11-19 06:49:12,053 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 6 [2022-11-19 06:49:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:12,054 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-11-19 06:49:12,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-11-19 06:49:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-11-19 06:49:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 06:49:12,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:12,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 06:49:12,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:49:12,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:12,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:12,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2132845309, now seen corresponding path program 1 times [2022-11-19 06:49:12,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:12,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594761531] [2022-11-19 06:49:12,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:12,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:49:12,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:12,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594761531] [2022-11-19 06:49:12,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594761531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:12,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:12,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:49:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676033776] [2022-11-19 06:49:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:12,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:49:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:12,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:49:12,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:12,222 INFO L87 Difference]: Start difference. First operand 78 states and 87 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) [2022-11-19 06:49:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:12,310 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-11-19 06:49:12,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:49:12,311 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 [2022-11-19 06:49:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:12,312 INFO L225 Difference]: With dead ends: 76 [2022-11-19 06:49:12,312 INFO L226 Difference]: Without dead ends: 76 [2022-11-19 06:49:12,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:12,314 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:12,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-19 06:49:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-19 06:49:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 72 states have internal predecessors, (81), 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) [2022-11-19 06:49:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-11-19 06:49:12,322 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 6 [2022-11-19 06:49:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:12,323 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-11-19 06:49:12,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-11-19 06:49:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-11-19 06:49:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 06:49:12,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:12,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:12,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:49:12,325 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:12,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash -399588339, now seen corresponding path program 1 times [2022-11-19 06:49:12,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:12,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214092507] [2022-11-19 06:49:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:12,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:49:12,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:12,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214092507] [2022-11-19 06:49:12,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214092507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:12,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:12,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:49:12,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107005022] [2022-11-19 06:49:12,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:12,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:49:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:12,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:49:12,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:49:12,463 INFO L87 Difference]: Start difference. First operand 76 states and 85 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) [2022-11-19 06:49:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:12,675 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-11-19 06:49:12,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:49:12,676 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 [2022-11-19 06:49:12,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:12,678 INFO L225 Difference]: With dead ends: 76 [2022-11-19 06:49:12,678 INFO L226 Difference]: Without dead ends: 76 [2022-11-19 06:49:12,679 INFO L412 NwaCegarLoop]: 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 [2022-11-19 06:49:12,680 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:12,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 212 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:49:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-19 06:49:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-11-19 06:49:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 71 states have internal predecessors, (80), 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) [2022-11-19 06:49:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-11-19 06:49:12,687 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2022-11-19 06:49:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:12,688 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-11-19 06:49:12,688 INFO L496 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) [2022-11-19 06:49:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-11-19 06:49:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 06:49:12,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:12,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:12,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 06:49:12,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash -399588338, now seen corresponding path program 1 times [2022-11-19 06:49:12,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:12,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785826933] [2022-11-19 06:49:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:12,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:49:12,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:12,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785826933] [2022-11-19 06:49:12,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785826933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:12,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:12,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 06:49:12,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968171461] [2022-11-19 06:49:12,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:12,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:49:12,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:49:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:49:12,889 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2022-11-19 06:49:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:13,088 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-11-19 06:49:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:49:13,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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 [2022-11-19 06:49:13,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:13,090 INFO L225 Difference]: With dead ends: 75 [2022-11-19 06:49:13,090 INFO L226 Difference]: Without dead ends: 75 [2022-11-19 06:49:13,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:49:13,091 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:13,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 248 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:49:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-19 06:49:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-11-19 06:49:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 70 states have internal predecessors, (79), 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) [2022-11-19 06:49:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-11-19 06:49:13,098 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10 [2022-11-19 06:49:13,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:13,099 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-11-19 06:49:13,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2022-11-19 06:49:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-11-19 06:49:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 06:49:13,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:13,100 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:13,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 06:49:13,101 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:13,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:13,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1876340112, now seen corresponding path program 1 times [2022-11-19 06:49:13,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:13,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564787271] [2022-11-19 06:49:13,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:13,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 06:49:13,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:13,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564787271] [2022-11-19 06:49:13,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564787271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:13,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655825548] [2022-11-19 06:49:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:13,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:49:13,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:13,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:49:13,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 06:49:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:13,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:49:13,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:49:13,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:49:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 06:49:13,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655825548] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:49:13,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [63350448] [2022-11-19 06:49:13,542 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-19 06:49:13,542 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:49:13,547 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:49:13,552 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:49:13,552 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:49:13,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:49:13,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:49:13,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 06:49:13,734 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:13,751 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:13,757 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:13,764 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:13,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,789 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:13,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,800 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:13,810 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:13,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:13,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:49:13,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:13,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:14,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:14,082 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:14,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:14,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:14,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:14,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:14,339 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:49:14,339 INFO L350 Elim1Store]: Elim1 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 218 treesize of output 224 [2022-11-19 06:49:14,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:14,628 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:14,771 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:14,783 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:49:14,797 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:14,810 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:14,825 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:14,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:14,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:14,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:14,980 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:49:14,981 INFO L350 Elim1Store]: Elim1 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 218 treesize of output 224 [2022-11-19 06:49:15,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:15,261 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:15,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:15,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:15,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:15,380 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:15,392 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:49:15,404 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:15,415 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:15,430 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:15,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:15,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-19 06:49:15,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:15,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-19 06:49:15,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:15,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 221 [2022-11-19 06:49:15,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:15,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:15,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:15,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:15,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:15,939 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:16,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:16,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:16,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:16,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:16,564 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-19 06:49:16,794 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:49:20,053 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '998#(and (= |ULTIMATE.start_main_~mid_index~0#1| (ite (and (not (= (mod |ULTIMATE.start_main_~len~0#1| 2) 0)) (< |ULTIMATE.start_main_~len~0#1| 0)) (+ (div |ULTIMATE.start_main_~len~0#1| 2) 1) (div |ULTIMATE.start_main_~len~0#1| 2))) (= (select (select |#memory_int| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) |ULTIMATE.start_sll_insert_~data#1|) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_main_~mid_index~0#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~len#1| 0) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_sll_insert_~index#1|) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_insert_#in~data#1| |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (= |ULTIMATE.start_sll_insert_~head#1.offset| |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 8) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-19 06:49:20,053 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:49:20,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:49:20,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-19 06:49:20,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088002088] [2022-11-19 06:49:20,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:49:20,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:49:20,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:20,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:49:20,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-11-19 06:49:20,055 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-19 06:49:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:20,126 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-11-19 06:49:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:49:20,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2022-11-19 06:49:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:20,130 INFO L225 Difference]: With dead ends: 78 [2022-11-19 06:49:20,130 INFO L226 Difference]: Without dead ends: 78 [2022-11-19 06:49:20,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-11-19 06:49:20,133 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:20,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 191 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:20,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-19 06:49:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-19 06:49:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 41 states have (on average 2.0) internal successors, (82), 73 states have internal predecessors, (82), 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) [2022-11-19 06:49:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2022-11-19 06:49:20,148 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2022-11-19 06:49:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:20,149 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2022-11-19 06:49:20,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-19 06:49:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-11-19 06:49:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:49:20,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:20,150 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:20,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 06:49:20,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-19 06:49:20,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:20,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1436278219, now seen corresponding path program 2 times [2022-11-19 06:49:20,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:20,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635992796] [2022-11-19 06:49:20,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:20,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 06:49:20,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:20,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635992796] [2022-11-19 06:49:20,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635992796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:20,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160210340] [2022-11-19 06:49:20,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:49:20,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:49:20,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:20,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:49:20,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 06:49:21,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 06:49:21,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:49:21,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-19 06:49:21,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:21,120 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:21,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:49:21,150 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_230 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_230))) is different from true [2022-11-19 06:49:21,158 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_230 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_230))) is different from true [2022-11-19 06:49:21,173 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:49:21,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 06:49:21,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:49:21,243 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_231 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_231))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-19 06:49:21,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:49:21,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:49:21,355 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_232 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_232))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-19 06:49:21,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:49:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2022-11-19 06:49:21,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:49:21,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160210340] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:21,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [299245858] [2022-11-19 06:49:21,465 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-19 06:49:21,465 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:49:21,465 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:49:21,466 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:49:21,466 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:49:21,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:49:21,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:49:21,546 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:21,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 06:49:21,557 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:21,561 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:21,566 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:21,575 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:21,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,581 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:21,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,589 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:21,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:21,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:49:21,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:21,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:21,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-19 06:49:21,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:21,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-19 06:49:21,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:21,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-19 06:49:22,009 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:49:22,009 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:49:22,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,227 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:22,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:22,327 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:22,337 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:22,348 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:22,358 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:22,368 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:49:22,479 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:49:22,479 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:49:22,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,692 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:22,767 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:22,776 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:22,786 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:22,796 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:22,806 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:49:22,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:22,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 212 [2022-11-19 06:49:22,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:22,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-19 06:49:22,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:22,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 218 [2022-11-19 06:49:23,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:49:23,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:49:23,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:49:23,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:23,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:23,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:23,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:23,552 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-19 06:49:23,741 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:49:26,816 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1275#(and (= |ULTIMATE.start_main_~mid_index~0#1| (ite (and (not (= (mod |ULTIMATE.start_main_~len~0#1| 2) 0)) (< |ULTIMATE.start_main_~len~0#1| 0)) (+ (div |ULTIMATE.start_main_~len~0#1| 2) 1) (div |ULTIMATE.start_main_~len~0#1| 2))) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_main_~mid_index~0#1|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_sll_insert_~index#1|) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_sll_insert_#in~data#1| |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4) 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 8) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (= |ULTIMATE.start_sll_insert_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0)) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-19 06:49:26,816 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:49:26,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:49:26,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2022-11-19 06:49:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651405970] [2022-11-19 06:49:26,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:49:26,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-19 06:49:26,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:26,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-19 06:49:26,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=615, Unknown=4, NotChecked=212, Total=930 [2022-11-19 06:49:26,819 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 18 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 06:49:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:27,282 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2022-11-19 06:49:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 06:49:27,283 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2022-11-19 06:49:27,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:27,283 INFO L225 Difference]: With dead ends: 85 [2022-11-19 06:49:27,284 INFO L226 Difference]: Without dead ends: 85 [2022-11-19 06:49:27,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=130, Invalid=812, Unknown=4, NotChecked=244, Total=1190 [2022-11-19 06:49:27,285 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 112 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:27,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 241 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 298 Unchecked, 0.2s Time] [2022-11-19 06:49:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-19 06:49:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2022-11-19 06:49:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 70 states have internal predecessors, (79), 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) [2022-11-19 06:49:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-11-19 06:49:27,290 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 28 [2022-11-19 06:49:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:27,290 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-11-19 06:49:27,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 06:49:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-11-19 06:49:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:49:27,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:27,292 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:27,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:49:27,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-19 06:49:27,498 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1436278218, now seen corresponding path program 1 times [2022-11-19 06:49:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609594527] [2022-11-19 06:49:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:49:28,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:28,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609594527] [2022-11-19 06:49:28,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609594527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:28,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258527092] [2022-11-19 06:49:28,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:28,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:49:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:28,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:49:28,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 06:49:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:28,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-19 06:49:28,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:28,349 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:28,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:49:28,385 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_349 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_349) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-19 06:49:28,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:49:28,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:49:28,456 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_350 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_350) |c_#length|)))) is different from true [2022-11-19 06:49:28,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:49:28,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:49:28,524 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_351 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_351) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-19 06:49:28,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:49:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2022-11-19 06:49:28,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:49:28,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258527092] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:28,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1275990893] [2022-11-19 06:49:28,682 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-19 06:49:28,682 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:49:28,682 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:49:28,682 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:49:28,683 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:49:28,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:49:28,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:49:28,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 06:49:28,782 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:28,789 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:28,793 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:28,798 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:28,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,807 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:28,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,814 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:28,821 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:28,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:28,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:49:28,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:28,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:28,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:28,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:28,944 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:28,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:28,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:29,090 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:49:29,090 INFO L350 Elim1Store]: Elim1 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 218 treesize of output 224 [2022-11-19 06:49:29,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:29,316 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:29,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:29,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:29,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:29,423 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:29,432 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:29,441 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:29,451 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:49:29,464 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:29,563 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:49:29,563 INFO L350 Elim1Store]: Elim1 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 218 treesize of output 224 [2022-11-19 06:49:29,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:29,741 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:29,804 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:29,820 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:49:29,829 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:29,840 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:29,851 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:29,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:29,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:29,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:30,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:30,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-19 06:49:30,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:30,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-19 06:49:30,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:30,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 215 [2022-11-19 06:49:30,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:30,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:30,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:30,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:30,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:30,217 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:30,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:30,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:30,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:30,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:30,584 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-19 06:49:30,744 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:49:32,683 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1566#(and (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (+ |ULTIMATE.start_sll_insert_~head#1.offset| 4)) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-19 06:49:32,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:49:32,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:49:32,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2022-11-19 06:49:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931643996] [2022-11-19 06:49:32,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:49:32,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 06:49:32,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:32,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 06:49:32,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=657, Unknown=3, NotChecked=162, Total=930 [2022-11-19 06:49:32,685 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-19 06:49:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:33,096 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2022-11-19 06:49:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 06:49:33,097 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-11-19 06:49:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:33,098 INFO L225 Difference]: With dead ends: 80 [2022-11-19 06:49:33,098 INFO L226 Difference]: Without dead ends: 80 [2022-11-19 06:49:33,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=135, Invalid=804, Unknown=3, NotChecked=180, Total=1122 [2022-11-19 06:49:33,100 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 281 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:33,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 92 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 223 Invalid, 0 Unknown, 243 Unchecked, 0.3s Time] [2022-11-19 06:49:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-19 06:49:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-11-19 06:49:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 65 states have internal predecessors, (74), 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) [2022-11-19 06:49:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-11-19 06:49:33,104 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 28 [2022-11-19 06:49:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:33,104 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-11-19 06:49:33,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-19 06:49:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-11-19 06:49:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 06:49:33,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:33,105 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:33,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 06:49:33,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:49:33,316 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:33,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1578703745, now seen corresponding path program 1 times [2022-11-19 06:49:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:33,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398502634] [2022-11-19 06:49:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:49:33,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:33,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398502634] [2022-11-19 06:49:33,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398502634] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:33,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537917959] [2022-11-19 06:49:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:33,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:49:33,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:33,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:49:33,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 06:49:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:34,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-19 06:49:34,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:34,137 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:34,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-19 06:49:34,416 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_470 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_470))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_468 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_468))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-19 06:49:34,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:49:34,452 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-19 06:49:34,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-19 06:49:34,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-19 06:49:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-19 06:49:34,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:49:34,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537917959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:34,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1536271635] [2022-11-19 06:49:34,601 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-19 06:49:34,601 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:49:34,601 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:49:34,601 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:49:34,602 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:49:34,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:49:34,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:49:34,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 06:49:34,673 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:34,679 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:34,684 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:34,689 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:34,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,698 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:34,703 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:34,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,709 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:34,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:34,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:49:34,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:34,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:34,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:34,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-19 06:49:34,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:34,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-19 06:49:34,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:34,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-19 06:49:35,061 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:49:35,061 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:49:35,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:35,249 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:35,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:35,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:35,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:35,341 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:35,350 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:35,367 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:49:35,378 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:35,388 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:35,496 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:49:35,496 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:49:35,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:35,697 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:35,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:35,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:35,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:35,787 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:35,800 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:49:35,809 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:35,822 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:35,832 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:35,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:35,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 212 [2022-11-19 06:49:35,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:35,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-19 06:49:35,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:35,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 224 [2022-11-19 06:49:36,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:36,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:36,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:36,150 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:36,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:36,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:36,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:36,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:36,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:36,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:36,667 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-19 06:49:36,900 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:49:41,544 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1861#(and (= |ULTIMATE.start_main_~mid_index~0#1| (ite (and (not (= (mod |ULTIMATE.start_main_~len~0#1| 2) 0)) (< |ULTIMATE.start_main_~len~0#1| 0)) (+ (div |ULTIMATE.start_main_~len~0#1| 2) 1) (div |ULTIMATE.start_main_~len~0#1| 2))) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_insert_~last~0#1.offset|) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_main_~mid_index~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= (+ |ULTIMATE.start_sll_insert_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|)) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_sll_insert_~index#1|) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|) |ULTIMATE.start_sll_insert_~last~0#1.base|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_sll_insert_#in~data#1| |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~last~0#1.base|) 1)) (= |ULTIMATE.start_sll_insert_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4) 0) (< 0 |ULTIMATE.start_sll_insert_~index#1|) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 8) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (= |ULTIMATE.start_sll_insert_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0)) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_insert_~last~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-19 06:49:41,544 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:49:41,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:49:41,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-11-19 06:49:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376280062] [2022-11-19 06:49:41,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:49:41,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-19 06:49:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:41,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-19 06:49:41,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1281, Unknown=3, NotChecked=72, Total=1482 [2022-11-19 06:49:41,546 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 24 states, 18 states have (on average 2.0) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 06:49:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:42,178 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2022-11-19 06:49:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 06:49:42,180 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.0) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2022-11-19 06:49:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:42,181 INFO L225 Difference]: With dead ends: 119 [2022-11-19 06:49:42,181 INFO L226 Difference]: Without dead ends: 119 [2022-11-19 06:49:42,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=176, Invalid=1714, Unknown=6, NotChecked=84, Total=1980 [2022-11-19 06:49:42,182 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 99 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:42,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 418 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 516 Invalid, 0 Unknown, 252 Unchecked, 0.4s Time] [2022-11-19 06:49:42,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-19 06:49:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 72. [2022-11-19 06:49:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.813953488372093) internal successors, (78), 67 states have internal predecessors, (78), 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) [2022-11-19 06:49:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2022-11-19 06:49:42,186 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 30 [2022-11-19 06:49:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:42,187 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2022-11-19 06:49:42,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.0) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 06:49:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-11-19 06:49:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 06:49:42,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:42,191 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:42,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 06:49:42,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:49:42,398 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:42,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1578703744, now seen corresponding path program 1 times [2022-11-19 06:49:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:42,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876519463] [2022-11-19 06:49:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:42,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:49:43,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:43,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876519463] [2022-11-19 06:49:43,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876519463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:43,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651625790] [2022-11-19 06:49:43,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:43,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:49:43,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:43,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:49:43,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 06:49:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:43,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-19 06:49:43,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:43,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-19 06:49:43,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:43,842 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_594 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_593) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_594)))) is different from true [2022-11-19 06:49:43,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:43,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-19 06:49:43,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:43,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-19 06:49:43,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:43,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-19 06:49:43,886 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-19 06:49:43,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-19 06:49:43,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-19 06:49:43,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-19 06:49:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 06:49:43,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:49:43,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651625790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:43,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:49:43,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 21 [2022-11-19 06:49:43,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519966439] [2022-11-19 06:49:43,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:43,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 06:49:43,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:43,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 06:49:43,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=368, Unknown=1, NotChecked=38, Total=462 [2022-11-19 06:49:43,968 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:49:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:44,415 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2022-11-19 06:49:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 06:49:44,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 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 30 [2022-11-19 06:49:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:44,416 INFO L225 Difference]: With dead ends: 120 [2022-11-19 06:49:44,416 INFO L226 Difference]: Without dead ends: 120 [2022-11-19 06:49:44,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=522, Unknown=1, NotChecked=46, Total=650 [2022-11-19 06:49:44,417 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 190 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:44,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 207 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 318 Invalid, 0 Unknown, 76 Unchecked, 0.3s Time] [2022-11-19 06:49:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-19 06:49:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 72. [2022-11-19 06:49:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 67 states have internal predecessors, (77), 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) [2022-11-19 06:49:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-11-19 06:49:44,422 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 30 [2022-11-19 06:49:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:44,422 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-11-19 06:49:44,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:49:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-11-19 06:49:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-19 06:49:44,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:44,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:44,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 06:49:44,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-19 06:49:44,636 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1695015053, now seen corresponding path program 1 times [2022-11-19 06:49:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:44,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553747889] [2022-11-19 06:49:44,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:44,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:49:44,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:44,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553747889] [2022-11-19 06:49:44,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553747889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:44,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:44,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:49:44,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232782117] [2022-11-19 06:49:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:44,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:49:44,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:44,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:49:44,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:44,719 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:49:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:44,771 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2022-11-19 06:49:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:49:44,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-11-19 06:49:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:44,772 INFO L225 Difference]: With dead ends: 116 [2022-11-19 06:49:44,772 INFO L226 Difference]: Without dead ends: 116 [2022-11-19 06:49:44,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:44,773 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 50 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:44,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:49:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-19 06:49:44,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2022-11-19 06:49:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 68 states have internal predecessors, (78), 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) [2022-11-19 06:49:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-11-19 06:49:44,790 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 31 [2022-11-19 06:49:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:44,792 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-11-19 06:49:44,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:49:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-11-19 06:49:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-19 06:49:44,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:44,795 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:44,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 06:49:44,796 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1010689408, now seen corresponding path program 1 times [2022-11-19 06:49:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:44,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287741997] [2022-11-19 06:49:44,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:44,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:49:44,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:44,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287741997] [2022-11-19 06:49:44,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287741997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:44,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:44,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:49:44,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283049650] [2022-11-19 06:49:44,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:44,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:49:44,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:44,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:49:44,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:49:44,927 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-11-19 06:49:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:44,977 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-11-19 06:49:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:49:44,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 32 [2022-11-19 06:49:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:44,979 INFO L225 Difference]: With dead ends: 70 [2022-11-19 06:49:44,979 INFO L226 Difference]: Without dead ends: 70 [2022-11-19 06:49:44,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:49:44,980 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 114 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:44,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 74 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:49:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-19 06:49:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-19 06:49:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 65 states have internal predecessors, (74), 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) [2022-11-19 06:49:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-11-19 06:49:44,984 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 32 [2022-11-19 06:49:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:44,984 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-11-19 06:49:44,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-11-19 06:49:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-11-19 06:49:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-19 06:49:44,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:44,985 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:44,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 06:49:44,986 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:44,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1005854102, now seen corresponding path program 1 times [2022-11-19 06:49:44,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:44,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878448816] [2022-11-19 06:49:44,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-19 06:49:45,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:45,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878448816] [2022-11-19 06:49:45,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878448816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:45,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:45,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:49:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95698173] [2022-11-19 06:49:45,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:45,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:49:45,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:45,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:49:45,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:49:45,090 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-11-19 06:49:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:45,215 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-11-19 06:49:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:49:45,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 32 [2022-11-19 06:49:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:45,217 INFO L225 Difference]: With dead ends: 79 [2022-11-19 06:49:45,217 INFO L226 Difference]: Without dead ends: 79 [2022-11-19 06:49:45,217 INFO L412 NwaCegarLoop]: 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 [2022-11-19 06:49:45,217 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 52 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:45,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 138 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-19 06:49:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-11-19 06:49:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.697674418604651) internal successors, (73), 64 states have internal predecessors, (73), 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) [2022-11-19 06:49:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-11-19 06:49:45,220 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 32 [2022-11-19 06:49:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:45,221 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-11-19 06:49:45,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-11-19 06:49:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-11-19 06:49:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-19 06:49:45,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:45,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:45,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 06:49:45,222 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:45,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1005854101, now seen corresponding path program 1 times [2022-11-19 06:49:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:45,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260320960] [2022-11-19 06:49:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:45,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:49:45,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:45,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260320960] [2022-11-19 06:49:45,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260320960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:45,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:45,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:49:45,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473156397] [2022-11-19 06:49:45,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:45,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:49:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:45,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:49:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:45,332 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-11-19 06:49:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:45,375 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-11-19 06:49:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:49:45,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 32 [2022-11-19 06:49:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:45,377 INFO L225 Difference]: With dead ends: 68 [2022-11-19 06:49:45,377 INFO L226 Difference]: Without dead ends: 68 [2022-11-19 06:49:45,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:49:45,378 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 60 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 105 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.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:45,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 105 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:49:45,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-19 06:49:45,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-19 06:49:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 63 states have internal predecessors, (71), 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) [2022-11-19 06:49:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-11-19 06:49:45,381 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 32 [2022-11-19 06:49:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:45,382 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-11-19 06:49:45,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-11-19 06:49:45,382 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-11-19 06:49:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-19 06:49:45,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:45,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:45,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 06:49:45,383 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1266439790, now seen corresponding path program 1 times [2022-11-19 06:49:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:45,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64938672] [2022-11-19 06:49:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:49:45,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:45,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64938672] [2022-11-19 06:49:45,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64938672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:45,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:45,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:49:45,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10176519] [2022-11-19 06:49:45,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:45,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:49:45,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:45,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:49:45,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:45,463 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:49:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:45,545 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-11-19 06:49:45,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:49:45,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-19 06:49:45,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:45,546 INFO L225 Difference]: With dead ends: 77 [2022-11-19 06:49:45,546 INFO L226 Difference]: Without dead ends: 77 [2022-11-19 06:49:45,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:45,547 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 48 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:45,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 80 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-19 06:49:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2022-11-19 06:49:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 62 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) [2022-11-19 06:49:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2022-11-19 06:49:45,551 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 33 [2022-11-19 06:49:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:45,551 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2022-11-19 06:49:45,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:49:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-11-19 06:49:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-19 06:49:45,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:45,553 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:45,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 06:49:45,553 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:45,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:45,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1266439789, now seen corresponding path program 1 times [2022-11-19 06:49:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:45,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561847433] [2022-11-19 06:49:45,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:49:45,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:45,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561847433] [2022-11-19 06:49:45,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561847433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:45,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:45,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:49:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123193165] [2022-11-19 06:49:45,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:45,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:49:45,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:45,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:49:45,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:45,667 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:49:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:45,742 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-11-19 06:49:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:49:45,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-19 06:49:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:45,743 INFO L225 Difference]: With dead ends: 66 [2022-11-19 06:49:45,743 INFO L226 Difference]: Without dead ends: 66 [2022-11-19 06:49:45,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:45,744 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 50 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:45,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 77 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-19 06:49:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-19 06:49:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 61 states have internal predecessors, (69), 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) [2022-11-19 06:49:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2022-11-19 06:49:45,747 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 33 [2022-11-19 06:49:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:45,748 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2022-11-19 06:49:45,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:49:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2022-11-19 06:49:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 06:49:45,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:45,749 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:45,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 06:49:45,749 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:45,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:45,750 INFO L85 PathProgramCache]: Analyzing trace with hash -604927796, now seen corresponding path program 1 times [2022-11-19 06:49:45,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:45,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135863233] [2022-11-19 06:49:45,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:45,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-19 06:49:45,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:45,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135863233] [2022-11-19 06:49:45,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135863233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:45,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:45,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:49:45,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764344968] [2022-11-19 06:49:45,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:45,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:49:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:45,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:49:45,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:49:45,937 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) [2022-11-19 06:49:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:46,054 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-11-19 06:49:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:49:46,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 34 [2022-11-19 06:49:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:46,055 INFO L225 Difference]: With dead ends: 65 [2022-11-19 06:49:46,055 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 06:49:46,055 INFO L412 NwaCegarLoop]: 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 [2022-11-19 06:49:46,056 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 49 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:46,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 139 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 06:49:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-19 06:49:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.619047619047619) internal successors, (68), 60 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) [2022-11-19 06:49:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-11-19 06:49:46,059 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 34 [2022-11-19 06:49:46,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:46,059 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-11-19 06:49:46,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) [2022-11-19 06:49:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-11-19 06:49:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 06:49:46,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:46,060 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:46,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 06:49:46,060 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:46,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash 282835287, now seen corresponding path program 1 times [2022-11-19 06:49:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:46,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585444447] [2022-11-19 06:49:46,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:46,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:49:46,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:46,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585444447] [2022-11-19 06:49:46,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585444447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:46,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057714002] [2022-11-19 06:49:46,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:46,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:49:46,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:46,765 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:49:46,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 06:49:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:46,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-19 06:49:46,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:47,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-19 06:49:47,148 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1142 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1142))) (exists ((v_ArrVal_1141 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1141)))) is different from true [2022-11-19 06:49:47,158 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1143 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1143) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1141 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1141)))) is different from true [2022-11-19 06:49:47,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:47,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:49:47,180 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:49:47,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-19 06:49:47,329 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:49:47,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-19 06:49:47,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:47,423 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 06:49:47,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 41 [2022-11-19 06:49:47,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:47,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-19 06:49:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 06:49:47,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:49:47,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057714002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:47,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:49:47,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [20] total 30 [2022-11-19 06:49:47,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173792853] [2022-11-19 06:49:47,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:47,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 06:49:47,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:47,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 06:49:47,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=736, Unknown=3, NotChecked=110, Total=930 [2022-11-19 06:49:47,531 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:49:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:47,706 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2022-11-19 06:49:47,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 06:49:47,707 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 2 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 37 [2022-11-19 06:49:47,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:47,708 INFO L225 Difference]: With dead ends: 71 [2022-11-19 06:49:47,708 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 06:49:47,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=788, Unknown=3, NotChecked=114, Total=992 [2022-11-19 06:49:47,709 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:47,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 201 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 191 Invalid, 0 Unknown, 227 Unchecked, 0.1s Time] [2022-11-19 06:49:47,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 06:49:47,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2022-11-19 06:49:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.553191489361702) internal successors, (73), 62 states have internal predecessors, (73), 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) [2022-11-19 06:49:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-11-19 06:49:47,714 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 37 [2022-11-19 06:49:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:47,714 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-11-19 06:49:47,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:49:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-11-19 06:49:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 06:49:47,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:47,719 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:47,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 06:49:47,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 06:49:47,923 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:49:47,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 282835288, now seen corresponding path program 1 times [2022-11-19 06:49:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:47,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088736780] [2022-11-19 06:49:47,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:49:49,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:49,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088736780] [2022-11-19 06:49:49,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088736780] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:49,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411813820] [2022-11-19 06:49:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:49,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:49:49,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:49,556 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:49:49,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 06:49:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:49,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-19 06:49:49,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:49,799 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:50,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-19 06:49:50,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:50,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:50,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 06:49:50,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:50,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 06:49:50,458 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-19 06:49:50,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-19 06:49:50,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:49:50,690 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:49:50,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-19 06:49:50,711 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-19 06:49:50,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-19 06:49:50,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:50,900 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 06:49:50,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 61 treesize of output 66 [2022-11-19 06:49:50,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:50,924 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 06:49:50,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 66 treesize of output 75 [2022-11-19 06:49:50,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:51,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:51,043 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 06:49:51,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2022-11-19 06:49:51,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 06:49:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 06:49:51,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:49:51,585 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1293 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-19 06:49:54,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411813820] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:54,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [10704970] [2022-11-19 06:49:54,508 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 06:49:54,508 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:49:54,508 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:49:54,509 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:49:54,509 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:49:54,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:49:54,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:49:54,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 06:49:54,584 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:54,590 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:54,595 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:54,600 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:54,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,609 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:54,614 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:54,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,620 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:54,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:54,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:49:54,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:54,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:54,744 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:54,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:54,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:54,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:54,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:54,901 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:49:54,902 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:49:55,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:55,095 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:55,168 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:55,180 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:55,190 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:55,200 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:55,211 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:49:55,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:55,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:55,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:55,325 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:49:55,326 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:49:55,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:55,537 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:55,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:55,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:55,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:49:55,620 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:55,631 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:55,642 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:55,652 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:55,663 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:49:55,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:55,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 212 [2022-11-19 06:49:55,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:55,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-19 06:49:55,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:55,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 218 [2022-11-19 06:49:55,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:55,948 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:49:55,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:55,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:55,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:49:55,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:49:56,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:56,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:56,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:56,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:49:57,014 INFO L321 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-11-19 06:49:57,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 269 treesize of output 303 [2022-11-19 06:49:57,116 INFO L321 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-11-19 06:49:57,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 259 treesize of output 293 [2022-11-19 06:50:03,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:50:03,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:50:03,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:50:03,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:50:03,569 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-19 06:50:03,728 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:50:12,548 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3915#(and (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.offset|) (not (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|)) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= 0 (+ |ULTIMATE.start_sll_insert_~index#1| 1)) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.base|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))' at error location [2022-11-19 06:50:12,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:50:12,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:50:12,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 36 [2022-11-19 06:50:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281252664] [2022-11-19 06:50:12,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:50:12,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 06:50:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:50:12,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 06:50:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3536, Unknown=8, NotChecked=120, Total=3906 [2022-11-19 06:50:12,552 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 37 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 32 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-19 06:50:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:14,275 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-11-19 06:50:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-19 06:50:14,275 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 32 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-11-19 06:50:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:14,276 INFO L225 Difference]: With dead ends: 67 [2022-11-19 06:50:14,276 INFO L226 Difference]: Without dead ends: 67 [2022-11-19 06:50:14,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=372, Invalid=5171, Unknown=11, NotChecked=146, Total=5700 [2022-11-19 06:50:14,278 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 18 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:14,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 582 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 744 Invalid, 0 Unknown, 151 Unchecked, 0.7s Time] [2022-11-19 06:50:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-19 06:50:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-19 06:50:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 62 states have internal predecessors, (72), 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) [2022-11-19 06:50:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-11-19 06:50:14,280 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 37 [2022-11-19 06:50:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:14,281 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-11-19 06:50:14,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 32 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-19 06:50:14,281 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-11-19 06:50:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 06:50:14,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:14,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:50:14,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-19 06:50:14,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:14,488 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:50:14,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash 282839364, now seen corresponding path program 1 times [2022-11-19 06:50:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:50:14,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084011520] [2022-11-19 06:50:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:50:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:50:15,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:50:15,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084011520] [2022-11-19 06:50:15,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084011520] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:50:15,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521763336] [2022-11-19 06:50:15,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:15,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:15,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:50:15,623 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:50:15,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 06:50:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:15,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-19 06:50:15,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:16,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-19 06:50:16,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:16,225 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 17 [2022-11-19 06:50:16,427 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:50:16,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2022-11-19 06:50:18,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:18,530 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 06:50:18,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2022-11-19 06:50:18,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:18,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-19 06:50:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:50:18,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:50:18,677 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1446 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (<= 1 |c_ULTIMATE.start_main_~mid_index~0#1|)) is different from false [2022-11-19 06:50:22,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521763336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:50:22,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1647296296] [2022-11-19 06:50:22,572 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 06:50:22,573 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:50:22,573 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:50:22,573 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:50:22,573 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:50:22,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:50:22,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:50:22,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 06:50:22,645 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:22,651 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:22,656 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:22,660 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:22,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,669 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:22,675 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:22,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,681 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:22,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:50:22,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:50:22,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:50:22,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:22,818 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:22,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:50:22,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:50:22,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:50:22,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:50:22,957 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:50:22,958 INFO L350 Elim1Store]: Elim1 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 218 treesize of output 224 [2022-11-19 06:50:23,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:23,128 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:23,185 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:50:23,195 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:23,204 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:23,213 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:23,222 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:23,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:23,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:23,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:50:23,345 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:50:23,346 INFO L350 Elim1Store]: Elim1 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 218 treesize of output 224 [2022-11-19 06:50:23,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:23,514 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:23,579 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:23,588 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:23,597 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:23,608 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:50:23,618 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:23,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:23,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:23,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:50:23,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:23,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-19 06:50:23,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:50:23,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-19 06:50:23,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:50:23,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 215 [2022-11-19 06:50:23,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:50:23,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:50:23,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:50:23,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:50:23,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:23,940 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:24,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:24,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:24,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:24,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:24,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:50:24,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:50:24,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:50:24,522 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:50:24,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-11-19 06:50:24,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:50:24,573 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:50:24,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-11-19 06:50:24,742 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-19 06:50:24,892 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:50:33,588 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4282#(and (or (and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_main_~ptr~0#1.base| 0) (<= 0 |ULTIMATE.start_main_~ptr~0#1.base|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_main_~count~0#1| 0) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_main_~ptr~0#1.offset|)) (and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_main_~count~0#1| 0) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_main_~mid_index~0#1|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_main_~mid_index~0#1| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 |ULTIMATE.start_main_~ptr~0#1.offset|))))' at error location [2022-11-19 06:50:33,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:50:33,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:50:33,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2022-11-19 06:50:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482483140] [2022-11-19 06:50:33,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:50:33,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 06:50:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:50:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 06:50:33,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=3281, Unknown=11, NotChecked=116, Total=3660 [2022-11-19 06:50:33,591 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 06:50:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:38,826 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-11-19 06:50:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 06:50:38,826 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-11-19 06:50:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:38,827 INFO L225 Difference]: With dead ends: 114 [2022-11-19 06:50:38,827 INFO L226 Difference]: Without dead ends: 114 [2022-11-19 06:50:38,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=347, Invalid=4476, Unknown=11, NotChecked=136, Total=4970 [2022-11-19 06:50:38,829 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 137 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:38,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 687 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 728 Invalid, 0 Unknown, 25 Unchecked, 0.6s Time] [2022-11-19 06:50:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-19 06:50:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 67. [2022-11-19 06:50:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 62 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) [2022-11-19 06:50:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2022-11-19 06:50:38,832 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 37 [2022-11-19 06:50:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:38,832 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2022-11-19 06:50:38,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 06:50:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-11-19 06:50:38,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 06:50:38,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:38,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:50:38,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 06:50:39,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:39,034 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:50:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash 430598647, now seen corresponding path program 1 times [2022-11-19 06:50:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:50:39,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924808136] [2022-11-19 06:50:39,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:50:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:50:39,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:50:39,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924808136] [2022-11-19 06:50:39,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924808136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:50:39,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262361086] [2022-11-19 06:50:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:39,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:50:39,327 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:50:39,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 06:50:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:39,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-19 06:50:39,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:39,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:50:39,582 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1588 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1588))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-19 06:50:39,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:50:39,628 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_1589 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1589))))) is different from true [2022-11-19 06:50:39,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:50:39,661 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1590 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1590))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-19 06:50:39,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:50:39,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:39,709 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 06:50:39,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 06:50:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2022-11-19 06:50:39,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:50:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:50:40,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262361086] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:50:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1611089521] [2022-11-19 06:50:40,054 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 06:50:40,054 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:50:40,054 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:50:40,055 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:50:40,055 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:50:40,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:50:40,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:50:40,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 06:50:40,113 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,120 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,129 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,132 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,139 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,149 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,157 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:50:40,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:50:40,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:50:40,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:50:40,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-19 06:50:40,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:50:40,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-19 06:50:40,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:50:40,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-19 06:50:40,454 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:50:40,454 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:50:40,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,660 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:50:40,765 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,775 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:50:40,788 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,800 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,810 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:40,895 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:50:40,896 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:50:41,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,049 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:41,104 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:50:41,113 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:41,125 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:41,135 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:41,167 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:41,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:50:41,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:50:41,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:50:41,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:50:41,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:50:41,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:50:41,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:50:41,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:50:41,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,379 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:50:41,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:41,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:41,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:41,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:41,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 06:50:41,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 06:50:41,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:50:41,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-19 06:50:41,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:50:41,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-19 06:50:42,014 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-19 06:50:42,150 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:50:47,557 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4738#(and (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|)) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.offset|) (not (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|)) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= (+ |ULTIMATE.start_sll_insert_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|) |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-19 06:50:47,557 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:50:47,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:50:47,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 17 [2022-11-19 06:50:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166005910] [2022-11-19 06:50:47,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:50:47,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-19 06:50:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:50:47,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-19 06:50:47,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1045, Unknown=3, NotChecked=204, Total=1406 [2022-11-19 06:50:47,560 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-19 06:50:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:47,823 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-11-19 06:50:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 06:50:47,824 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-11-19 06:50:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:47,824 INFO L225 Difference]: With dead ends: 63 [2022-11-19 06:50:47,824 INFO L226 Difference]: Without dead ends: 63 [2022-11-19 06:50:47,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 81 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=212, Invalid=1435, Unknown=5, NotChecked=240, Total=1892 [2022-11-19 06:50:47,826 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 197 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:47,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 113 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 127 Invalid, 0 Unknown, 175 Unchecked, 0.1s Time] [2022-11-19 06:50:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-19 06:50:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-19 06:50:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 58 states have internal predecessors, (65), 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) [2022-11-19 06:50:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2022-11-19 06:50:47,829 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 37 [2022-11-19 06:50:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:47,829 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-11-19 06:50:47,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-19 06:50:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-11-19 06:50:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-19 06:50:47,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:47,830 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:50:47,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 06:50:48,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-19 06:50:48,036 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:50:48,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash 177962891, now seen corresponding path program 1 times [2022-11-19 06:50:48,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:50:48,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871184276] [2022-11-19 06:50:48,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:48,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:50:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:50:49,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:50:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871184276] [2022-11-19 06:50:49,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871184276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:50:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421522311] [2022-11-19 06:50:49,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:49,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:49,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:50:49,111 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:50:49,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 06:50:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:49,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-19 06:50:49,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:49,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:49,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:49,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 06:50:49,827 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-19 06:50:49,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-19 06:50:53,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:53,903 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 06:50:53,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 32 [2022-11-19 06:50:53,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 06:50:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 06:50:53,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:50:53,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421522311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:50:53,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:50:53,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 33 [2022-11-19 06:50:53,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674133023] [2022-11-19 06:50:53,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:50:53,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-19 06:50:53,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:50:53,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-19 06:50:53,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1012, Unknown=4, NotChecked=0, Total=1122 [2022-11-19 06:50:53,926 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:50:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:56,215 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-19 06:50:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-19 06:50:56,216 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-11-19 06:50:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:56,216 INFO L225 Difference]: With dead ends: 69 [2022-11-19 06:50:56,217 INFO L226 Difference]: Without dead ends: 69 [2022-11-19 06:50:56,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=135, Invalid=1343, Unknown=4, NotChecked=0, Total=1482 [2022-11-19 06:50:56,218 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 82 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:56,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 442 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 281 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-11-19 06:50:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-19 06:50:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-11-19 06:50:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.5) internal successors, (66), 59 states have internal predecessors, (66), 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) [2022-11-19 06:50:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-11-19 06:50:56,221 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 38 [2022-11-19 06:50:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:56,221 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-11-19 06:50:56,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:50:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-11-19 06:50:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 06:50:56,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:56,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:50:56,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 06:50:56,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-19 06:50:56,427 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:50:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:56,428 INFO L85 PathProgramCache]: Analyzing trace with hash -776352684, now seen corresponding path program 1 times [2022-11-19 06:50:56,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:50:56,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657639135] [2022-11-19 06:50:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:56,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:50:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:50:58,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:50:58,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657639135] [2022-11-19 06:50:58,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657639135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:50:58,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466466066] [2022-11-19 06:50:58,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:58,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:58,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:50:58,519 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:50:58,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 06:50:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:58,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-19 06:50:58,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:58,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 06:50:59,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:59,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-19 06:50:59,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-19 06:50:59,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:50:59,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:59,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:50:59,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:59,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-19 06:50:59,543 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-19 06:50:59,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-19 06:50:59,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-19 06:50:59,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:59,562 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-19 06:51:00,102 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:51:00,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-11-19 06:51:00,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:00,111 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 32 [2022-11-19 06:51:00,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:00,116 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2022-11-19 06:51:00,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:00,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-11-19 06:51:00,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-19 06:51:00,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:00,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:00,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 34 [2022-11-19 06:51:00,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2022-11-19 06:51:00,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:00,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2022-11-19 06:51:00,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 06:51:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:51:00,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:51:00,479 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1894) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-19 06:51:00,490 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1891 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 v_ArrVal_1891)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1894) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-19 06:51:02,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466466066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:51:02,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1514694237] [2022-11-19 06:51:02,502 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-19 06:51:02,502 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:51:02,502 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:51:02,503 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:51:02,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:51:02,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:51:02,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:51:02,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 06:51:02,569 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:02,578 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:02,582 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:02,586 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:02,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,594 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:02,599 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:02,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,605 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:02,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:02,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:51:02,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:02,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:02,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:02,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-19 06:51:02,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:02,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-19 06:51:02,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:02,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-19 06:51:02,917 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:51:02,918 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:51:03,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:03,102 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:03,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:03,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:03,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:03,174 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:03,187 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:03,198 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:51:03,210 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:03,221 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:03,322 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:51:03,322 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:51:03,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:03,487 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:03,537 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:51:03,548 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:03,556 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:03,567 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:03,597 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:03,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:03,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:03,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:03,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:03,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 212 [2022-11-19 06:51:03,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:03,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-19 06:51:03,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:03,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 218 [2022-11-19 06:51:03,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:03,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:51:03,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:03,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:51:03,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:03,868 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:04,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:04,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:04,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:04,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:04,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:51:04,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:51:04,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:51:04,411 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:51:04,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-11-19 06:51:04,448 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:51:04,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-11-19 06:51:04,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:51:04,558 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-19 06:51:04,693 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:51:13,050 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5392#(and (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (or (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) (or (and (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)))) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.offset|) (not (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|)) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (or (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_main_~ptr~0#1.offset|))' at error location [2022-11-19 06:51:13,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:51:13,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:51:13,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 40 [2022-11-19 06:51:13,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967660146] [2022-11-19 06:51:13,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:51:13,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-19 06:51:13,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:51:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-19 06:51:13,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=3946, Unknown=94, NotChecked=258, Total=4556 [2022-11-19 06:51:13,052 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 40 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 06:51:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:51:15,034 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-11-19 06:51:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-19 06:51:15,035 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-11-19 06:51:15,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:51:15,035 INFO L225 Difference]: With dead ends: 65 [2022-11-19 06:51:15,035 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 06:51:15,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=395, Invalid=5667, Unknown=108, NotChecked=310, Total=6480 [2022-11-19 06:51:15,037 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 155 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-19 06:51:15,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 584 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 871 Invalid, 0 Unknown, 77 Unchecked, 0.8s Time] [2022-11-19 06:51:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 06:51:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-19 06:51:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.488888888888889) internal successors, (67), 60 states have internal predecessors, (67), 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) [2022-11-19 06:51:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-11-19 06:51:15,040 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 40 [2022-11-19 06:51:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:51:15,040 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-11-19 06:51:15,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 06:51:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-11-19 06:51:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-19 06:51:15,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:51:15,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:51:15,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 06:51:15,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-19 06:51:15,251 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:51:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:51:15,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1702869937, now seen corresponding path program 1 times [2022-11-19 06:51:15,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:51:15,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152859113] [2022-11-19 06:51:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:51:15,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:51:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:51:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:51:16,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:51:16,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152859113] [2022-11-19 06:51:16,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152859113] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:51:16,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328108703] [2022-11-19 06:51:16,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:51:16,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:51:16,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:51:16,895 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:51:16,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 06:51:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:51:17,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 06:51:17,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:51:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:51:17,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:51:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:51:17,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328108703] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:51:17,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [493092243] [2022-11-19 06:51:17,721 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-19 06:51:17,721 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:51:17,722 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:51:17,722 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:51:17,722 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:51:17,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:51:17,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:51:17,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 06:51:17,786 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:17,793 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:17,798 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:17,803 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:17,811 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:17,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,818 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:17,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,847 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:17,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:17,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:51:17,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:17,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:17,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:17,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-19 06:51:17,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:17,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-19 06:51:18,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:18,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-19 06:51:18,125 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:51:18,126 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:51:18,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:18,281 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:18,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:18,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:18,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:18,361 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:18,372 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:18,383 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:51:18,394 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:18,406 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:18,494 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:51:18,494 INFO L350 Elim1Store]: Elim1 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 224 treesize of output 230 [2022-11-19 06:51:18,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:18,678 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:18,737 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:18,747 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:18,758 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:18,769 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:18,781 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:51:18,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:18,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:18,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:18,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:18,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 220 [2022-11-19 06:51:18,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 218 [2022-11-19 06:51:18,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 218 [2022-11-19 06:51:19,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:19,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:51:19,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:19,066 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:19,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:19,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:51:19,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:19,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:19,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:19,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:19,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:51:19,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:51:19,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:51:19,639 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:51:19,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-11-19 06:51:19,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:51:19,694 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:51:19,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-11-19 06:51:19,964 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-19 06:51:20,106 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:51:27,769 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5845#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (not (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|)) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))' at error location [2022-11-19 06:51:27,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:51:27,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:51:27,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8, 8] total 35 [2022-11-19 06:51:27,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135849584] [2022-11-19 06:51:27,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:51:27,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 06:51:27,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:51:27,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 06:51:27,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2954, Unknown=0, NotChecked=0, Total=3192 [2022-11-19 06:51:27,772 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 35 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-19 06:51:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:51:30,376 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-11-19 06:51:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-19 06:51:30,377 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-11-19 06:51:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:51:30,378 INFO L225 Difference]: With dead ends: 72 [2022-11-19 06:51:30,378 INFO L226 Difference]: Without dead ends: 72 [2022-11-19 06:51:30,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=505, Invalid=5347, Unknown=0, NotChecked=0, Total=5852 [2022-11-19 06:51:30,380 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 456 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-19 06:51:30,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 360 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-19 06:51:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-19 06:51:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2022-11-19 06:51:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.380952380952381) internal successors, (58), 53 states have internal predecessors, (58), 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) [2022-11-19 06:51:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-11-19 06:51:30,382 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 41 [2022-11-19 06:51:30,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:51:30,383 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-11-19 06:51:30,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-19 06:51:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-11-19 06:51:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-19 06:51:30,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:51:30,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:51:30,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-19 06:51:30,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-19 06:51:30,591 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:51:30,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:51:30,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1702874014, now seen corresponding path program 1 times [2022-11-19 06:51:30,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:51:30,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288711885] [2022-11-19 06:51:30,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:51:30,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:51:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:51:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:51:33,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:51:33,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288711885] [2022-11-19 06:51:33,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288711885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:51:33,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074678446] [2022-11-19 06:51:33,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:51:33,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:51:33,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:51:33,735 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:51:33,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 06:51:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:51:33,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-19 06:51:33,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:51:34,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-19 06:51:34,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:51:34,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:34,589 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:34,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:34,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 06:51:34,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:34,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 06:51:34,911 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-19 06:51:34,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-19 06:51:35,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:35,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-11-19 06:51:35,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:35,438 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2022-11-19 06:51:35,567 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-19 06:51:35,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 72 [2022-11-19 06:51:35,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:35,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:35,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 38 [2022-11-19 06:51:35,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:35,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:35,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:51:35,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 45 [2022-11-19 06:51:35,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:35,859 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-19 06:51:35,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-19 06:51:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:51:35,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:51:36,432 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2189))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2188))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (<= (+ 4 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse4)))))) (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2189))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2188 (Array Int Int))) (<= 0 (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse6 4)))) (not (<= 0 .cse6))))))) is different from false [2022-11-19 06:51:36,943 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2189))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2188))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 4) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse4)))))) (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2189))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2188 (Array Int Int))) (<= 0 (select (select .cse7 (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse8 4)))) (not (<= 0 .cse8))))))))) is different from false [2022-11-19 06:51:36,970 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse1 (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2189))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2188))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse0 4))) (<= (+ (select (select .cse1 .cse2) .cse3) 4) (select |c_#length| (select (select .cse4 .cse2) .cse3)))))))))) (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse8 (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2189))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_2188 (Array Int Int))) (<= 0 (select (select .cse8 (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse7 4))))))))))) is different from false [2022-11-19 06:51:36,998 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (and (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2189))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2188))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 4) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse4)))))) (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2189))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2188 (Array Int Int))) (<= 0 (select (select .cse7 (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse8)))) (not (<= 0 .cse8))))))))) is different from false [2022-11-19 06:51:37,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 927 treesize of output 791 [2022-11-19 06:51:38,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074678446] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:51:38,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [482891769] [2022-11-19 06:51:38,116 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-19 06:51:38,116 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:51:38,116 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:51:38,116 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:51:38,116 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:51:38,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:51:38,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:51:38,178 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 06:51:38,189 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,192 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,196 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,205 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,211 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,219 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:38,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2022-11-19 06:51:38,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:38,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,344 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:38,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:51:38,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:51:38,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:51:38,493 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:51:38,493 INFO L350 Elim1Store]: Elim1 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 218 treesize of output 224 [2022-11-19 06:51:38,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,667 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:38,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:38,748 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,758 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:51:38,770 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,781 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,792 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:38,913 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-19 06:51:38,913 INFO L350 Elim1Store]: Elim1 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 218 treesize of output 224 [2022-11-19 06:51:39,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:39,074 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:39,132 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-19 06:51:39,142 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:39,151 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:39,161 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:39,172 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:51:39,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:39,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:39,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-11-19 06:51:39,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:51:39,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:51:39,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:51:39,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:51:39,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:51:39,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:51:39,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:39,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:39,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:39,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:40,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:51:40,179 INFO L321 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-11-19 06:51:40,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 269 treesize of output 303 [2022-11-19 06:51:40,268 INFO L321 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-11-19 06:51:40,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 259 treesize of output 293 [2022-11-19 06:51:42,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 06:51:42,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:51:42,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:51:42,344 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-19 06:51:42,507 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:51:52,606 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6268#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|)) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 |ULTIMATE.start_main_~ptr~0#1.offset|))) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= 0 (+ |ULTIMATE.start_sll_insert_~index#1| 1)) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))' at error location [2022-11-19 06:51:52,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:51:52,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 06:51:52,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 22] total 51 [2022-11-19 06:51:52,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813548034] [2022-11-19 06:51:52,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 06:51:52,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-19 06:51:52,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:51:52,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-19 06:51:52,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=6310, Unknown=27, NotChecked=652, Total=7310 [2022-11-19 06:51:52,611 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 52 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-19 06:51:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:51:55,863 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-19 06:51:55,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-19 06:51:55,863 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-11-19 06:51:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:51:55,864 INFO L225 Difference]: With dead ends: 61 [2022-11-19 06:51:55,864 INFO L226 Difference]: Without dead ends: 61 [2022-11-19 06:51:55,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3007 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=538, Invalid=9546, Unknown=32, NotChecked=804, Total=10920 [2022-11-19 06:51:55,865 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 147 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-19 06:51:55,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 564 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1006 Invalid, 0 Unknown, 75 Unchecked, 0.8s Time] [2022-11-19 06:51:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-19 06:51:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-11-19 06:51:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 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) [2022-11-19 06:51:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-11-19 06:51:55,868 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 41 [2022-11-19 06:51:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:51:55,869 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-11-19 06:51:55,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-19 06:51:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-11-19 06:51:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-19 06:51:55,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:51:55,870 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:51:55,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-19 06:51:56,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-19 06:51:56,076 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:51:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:51:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash 79388924, now seen corresponding path program 1 times [2022-11-19 06:51:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:51:56,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295278037] [2022-11-19 06:51:56,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:51:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:51:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:51:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 06:51:58,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:51:58,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295278037] [2022-11-19 06:51:58,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295278037] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:51:58,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116969709] [2022-11-19 06:51:58,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:51:58,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:51:58,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:51:58,499 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:51:58,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 06:51:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:51:58,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-19 06:51:58,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:51:59,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-19 06:51:59,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:51:59,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:51:59,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 06:51:59,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:59,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 06:51:59,377 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-19 06:51:59,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-19 06:51:59,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:59,387 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-19 06:51:59,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:59,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2022-11-19 06:51:59,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-19 06:51:59,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:51:59,939 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2022-11-19 06:52:00,069 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-19 06:52:00,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 103 [2022-11-19 06:52:00,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:00,082 INFO L350 Elim1Store]: Elim1 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 61 treesize of output 52 [2022-11-19 06:52:00,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:00,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:00,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 56 treesize of output 55 [2022-11-19 06:52:00,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:00,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:00,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:52:00,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 51 [2022-11-19 06:52:00,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:00,344 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-19 06:52:00,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 23 [2022-11-19 06:52:00,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 06:52:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:52:00,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:52:02,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:52:02,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 312 [2022-11-19 06:52:02,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:52:02,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4984 treesize of output 4708 [2022-11-19 06:52:02,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5116 treesize of output 4436 [2022-11-19 06:52:02,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 855 treesize of output 719 [2022-11-19 06:52:02,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:52:02,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2537 treesize of output 4079 [2022-11-19 06:54:59,586 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-19 06:54:59,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-19 06:54:59,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2022-11-19 06:54:59,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [187403907] [2022-11-19 06:54:59,589 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-19 06:54:59,589 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:54:59,589 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:54:59,589 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:54:59,589 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:54:59,593 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:273) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2022-11-19 06:54:59,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:54:59,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2022-11-19 06:54:59,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080323606] [2022-11-19 06:54:59,602 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-19 06:54:59,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-19 06:54:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:54:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-19 06:54:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2884, Unknown=14, NotChecked=0, Total=3080 [2022-11-19 06:54:59,604 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:54:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 06:54:59,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=182, Invalid=2884, Unknown=14, NotChecked=0, Total=3080 [2022-11-19 06:54:59,605 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:54:59,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:54:59,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-19 06:54:59,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:54:59,810 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@5cd61051 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-19 06:54:59,812 INFO L158 Benchmark]: Toolchain (without parser) took 350244.79ms. Allocated memory was 125.8MB in the beginning and 685.8MB in the end (delta: 559.9MB). Free memory was 86.5MB in the beginning and 490.2MB in the end (delta: -403.7MB). Peak memory consumption was 151.9MB. Max. memory is 16.1GB. [2022-11-19 06:54:59,812 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 125.8MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:54:59,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.21ms. Allocated memory is still 125.8MB. Free memory was 86.4MB in the beginning and 91.0MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 06:54:59,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.16ms. Allocated memory is still 125.8MB. Free memory was 91.0MB in the beginning and 88.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:54:59,813 INFO L158 Benchmark]: Boogie Preprocessor took 78.06ms. Allocated memory is still 125.8MB. Free memory was 88.8MB in the beginning and 86.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:54:59,813 INFO L158 Benchmark]: RCFGBuilder took 788.45ms. Allocated memory is still 125.8MB. Free memory was 86.8MB in the beginning and 59.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-19 06:54:59,814 INFO L158 Benchmark]: TraceAbstraction took 348726.27ms. Allocated memory was 125.8MB in the beginning and 685.8MB in the end (delta: 559.9MB). Free memory was 58.4MB in the beginning and 490.2MB in the end (delta: -431.8MB). Peak memory consumption was 124.9MB. Max. memory is 16.1GB. [2022-11-19 06:54:59,815 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.27ms. Allocated memory is still 125.8MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.21ms. Allocated memory is still 125.8MB. Free memory was 86.4MB in the beginning and 91.0MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.16ms. Allocated memory is still 125.8MB. Free memory was 91.0MB in the beginning and 88.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.06ms. Allocated memory is still 125.8MB. Free memory was 88.8MB in the beginning and 86.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 788.45ms. Allocated memory is still 125.8MB. Free memory was 86.8MB in the beginning and 59.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 348726.27ms. Allocated memory was 125.8MB in the beginning and 685.8MB in the end (delta: 559.9MB). Free memory was 58.4MB in the beginning and 490.2MB in the end (delta: -431.8MB). Peak memory consumption was 124.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@5cd61051 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@5cd61051: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS --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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 06:55:02,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:55:02,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:55:02,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:55:02,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:55:02,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:55:02,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:55:02,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:55:02,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:55:02,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:55:02,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:55:02,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:55:02,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:55:02,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:55:02,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:55:02,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:55:02,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:55:02,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:55:02,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:55:02,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:55:02,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:55:02,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:55:02,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:55:02,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:55:02,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:55:02,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:55:02,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:55:02,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:55:02,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:55:02,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:55:02,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:55:02,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:55:02,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:55:02,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:55:02,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:55:02,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:55:02,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:55:02,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:55:02,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:55:02,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:55:02,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:55:02,219 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 06:55:02,259 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:55:02,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:55:02,261 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:55:02,261 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:55:02,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:55:02,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:55:02,263 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:55:02,263 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:55:02,263 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:55:02,263 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:55:02,264 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:55:02,265 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:55:02,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 06:55:02,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 06:55:02,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:55:02,267 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:55:02,267 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 06:55:02,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:55:02,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:55:02,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:55:02,268 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 06:55:02,268 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 06:55:02,269 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 06:55:02,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:55:02,269 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 06:55:02,269 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 06:55:02,269 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 06:55:02,270 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:55:02,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:55:02,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:55:02,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 06:55:02,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:55:02,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:55:02,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:55:02,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:55:02,272 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 06:55:02,272 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 06:55:02,272 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:55:02,273 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 06:55:02,273 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_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/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_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2022-11-19 06:55:02,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:55:02,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:55:02,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:55:02,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:55:02,725 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:55:02,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-11-19 06:55:02,805 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/data/ea984085a/03ea17fb3727425e849422eea12d4bc1/FLAG6d98bf315 [2022-11-19 06:55:03,437 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:55:03,442 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-11-19 06:55:03,458 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/data/ea984085a/03ea17fb3727425e849422eea12d4bc1/FLAG6d98bf315 [2022-11-19 06:55:03,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/data/ea984085a/03ea17fb3727425e849422eea12d4bc1 [2022-11-19 06:55:03,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:55:03,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:55:03,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:55:03,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:55:03,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:55:03,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:55:03" (1/1) ... [2022-11-19 06:55:03,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7587b2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:03, skipping insertion in model container [2022-11-19 06:55:03,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:55:03" (1/1) ... [2022-11-19 06:55:03,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:55:03,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:55:04,259 WARN L234 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_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-11-19 06:55:04,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:55:04,286 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:55:04,356 WARN L234 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_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-11-19 06:55:04,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:55:04,398 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:55:04,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04 WrapperNode [2022-11-19 06:55:04,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:55:04,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:55:04,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:55:04,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:55:04,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (1/1) ... [2022-11-19 06:55:04,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (1/1) ... [2022-11-19 06:55:04,480 INFO L138 Inliner]: procedures = 131, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-11-19 06:55:04,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:55:04,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:55:04,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:55:04,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:55:04,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (1/1) ... [2022-11-19 06:55:04,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (1/1) ... [2022-11-19 06:55:04,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (1/1) ... [2022-11-19 06:55:04,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (1/1) ... [2022-11-19 06:55:04,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (1/1) ... [2022-11-19 06:55:04,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (1/1) ... [2022-11-19 06:55:04,539 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (1/1) ... [2022-11-19 06:55:04,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (1/1) ... [2022-11-19 06:55:04,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:55:04,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:55:04,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:55:04,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:55:04,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (1/1) ... [2022-11-19 06:55:04,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:55:04,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:55:04,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:55:04,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:55:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-19 06:55:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-19 06:55:04,647 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-19 06:55:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 06:55:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:55:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:55:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 06:55:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 06:55:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:55:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 06:55:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-19 06:55:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 06:55:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:55:04,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:55:04,840 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:55:04,842 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:55:05,468 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:55:05,475 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:55:05,475 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-19 06:55:05,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:55:05 BoogieIcfgContainer [2022-11-19 06:55:05,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:55:05,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:55:05,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:55:05,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:55:05,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:55:03" (1/3) ... [2022-11-19 06:55:05,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13707dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:55:05, skipping insertion in model container [2022-11-19 06:55:05,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:55:04" (2/3) ... [2022-11-19 06:55:05,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13707dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:55:05, skipping insertion in model container [2022-11-19 06:55:05,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:55:05" (3/3) ... [2022-11-19 06:55:05,486 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-11-19 06:55:05,518 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:55:05,519 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-19 06:55:05,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:55:05,574 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f0b0eb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:55:05,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-11-19 06:55:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 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) [2022-11-19 06:55:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 06:55:05,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:05,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:05,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:55:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951417, now seen corresponding path program 1 times [2022-11-19 06:55:05,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:55:05,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497508269] [2022-11-19 06:55:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:05,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:05,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:55:05,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:55:05,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-19 06:55:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:05,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:55:05,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:05,835 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:55:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:05,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:55:05,856 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:55:05,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497508269] [2022-11-19 06:55:05,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497508269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:55:05,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:55:05,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:55:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421975622] [2022-11-19 06:55:05,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:55:05,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:55:05,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:55:05,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:55:05,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:55:05,904 INFO L87 Difference]: Start difference. First operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 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) [2022-11-19 06:55:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:06,115 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-11-19 06:55:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:55:06,117 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 [2022-11-19 06:55:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:06,126 INFO L225 Difference]: With dead ends: 97 [2022-11-19 06:55:06,126 INFO L226 Difference]: Without dead ends: 94 [2022-11-19 06:55:06,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:55:06,131 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:06,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 158 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:55:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-19 06:55:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-11-19 06:55:06,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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) [2022-11-19 06:55:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-11-19 06:55:06,185 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 7 [2022-11-19 06:55:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:06,186 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-11-19 06:55:06,186 INFO L496 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) [2022-11-19 06:55:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-11-19 06:55:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 06:55:06,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:06,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:06,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-19 06:55:06,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:06,399 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:55:06,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:06,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951418, now seen corresponding path program 1 times [2022-11-19 06:55:06,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:55:06,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928748229] [2022-11-19 06:55:06,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:06,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:06,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:55:06,402 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:55:06,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-19 06:55:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:06,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:55:06,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:06,489 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:55:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:06,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:55:06,517 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:55:06,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928748229] [2022-11-19 06:55:06,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928748229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:55:06,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:55:06,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:55:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252419963] [2022-11-19 06:55:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:55:06,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:55:06,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:55:06,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:55:06,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:55:06,521 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. 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) [2022-11-19 06:55:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:06,755 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-11-19 06:55:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:55:06,758 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 [2022-11-19 06:55:06,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:06,759 INFO L225 Difference]: With dead ends: 92 [2022-11-19 06:55:06,760 INFO L226 Difference]: Without dead ends: 92 [2022-11-19 06:55:06,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:55:06,761 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 158 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.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:06,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:55:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-19 06:55:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-19 06:55:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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) [2022-11-19 06:55:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-11-19 06:55:06,771 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 7 [2022-11-19 06:55:06,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:06,771 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-11-19 06:55:06,771 INFO L496 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) [2022-11-19 06:55:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-11-19 06:55:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 06:55:06,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:06,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:06,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:06,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:06,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:55:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390976, now seen corresponding path program 1 times [2022-11-19 06:55:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:55:06,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718349159] [2022-11-19 06:55:06,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:06,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:06,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:55:06,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:55:06,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-19 06:55:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:07,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:55:07,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:07,100 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:55:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:07,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:55:07,180 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:55:07,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718349159] [2022-11-19 06:55:07,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718349159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:55:07,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:55:07,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:55:07,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49744949] [2022-11-19 06:55:07,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:55:07,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:55:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:55:07,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:55:07,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:55:07,186 INFO L87 Difference]: Start difference. First operand 92 states and 101 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) [2022-11-19 06:55:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:07,735 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-11-19 06:55:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:55:07,736 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 [2022-11-19 06:55:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:07,738 INFO L225 Difference]: With dead ends: 96 [2022-11-19 06:55:07,739 INFO L226 Difference]: Without dead ends: 96 [2022-11-19 06:55:07,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:55:07,740 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:07,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 329 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 06:55:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-19 06:55:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-11-19 06:55:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 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) [2022-11-19 06:55:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-11-19 06:55:07,757 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 13 [2022-11-19 06:55:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:07,758 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-11-19 06:55:07,758 INFO L496 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) [2022-11-19 06:55:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-11-19 06:55:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 06:55:07,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:07,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:07,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:07,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:07,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:55:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390975, now seen corresponding path program 1 times [2022-11-19 06:55:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:55:07,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274413169] [2022-11-19 06:55:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:07,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:07,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:55:07,976 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:55:07,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-19 06:55:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:08,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-19 06:55:08,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:08,084 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:55:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:08,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:55:08,210 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:55:08,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274413169] [2022-11-19 06:55:08,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274413169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:55:08,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:55:08,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:55:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71210556] [2022-11-19 06:55:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:55:08,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:55:08,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:55:08,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:55:08,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:55:08,213 INFO L87 Difference]: Start difference. First operand 91 states and 100 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) [2022-11-19 06:55:08,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:08,682 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-11-19 06:55:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:55:08,683 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 [2022-11-19 06:55:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:08,684 INFO L225 Difference]: With dead ends: 95 [2022-11-19 06:55:08,684 INFO L226 Difference]: Without dead ends: 95 [2022-11-19 06:55:08,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:55:08,686 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 9 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:08,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 345 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 06:55:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-19 06:55:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2022-11-19 06:55:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 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) [2022-11-19 06:55:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-11-19 06:55:08,707 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 13 [2022-11-19 06:55:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:08,707 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-11-19 06:55:08,708 INFO L496 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) [2022-11-19 06:55:08,708 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-11-19 06:55:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 06:55:08,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:08,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:08,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:08,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:08,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:55:08,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:08,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2068593344, now seen corresponding path program 1 times [2022-11-19 06:55:08,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:55:08,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442502280] [2022-11-19 06:55:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:08,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:08,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:55:08,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:55:08,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-19 06:55:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:09,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:55:09,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:09,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:55:09,032 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:55:09,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442502280] [2022-11-19 06:55:09,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442502280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:55:09,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:55:09,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:55:09,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064593773] [2022-11-19 06:55:09,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:55:09,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:55:09,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:55:09,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:55:09,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:55:09,035 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-19 06:55:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:09,048 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-11-19 06:55:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:55:09,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2022-11-19 06:55:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:09,052 INFO L225 Difference]: With dead ends: 96 [2022-11-19 06:55:09,052 INFO L226 Difference]: Without dead ends: 96 [2022-11-19 06:55:09,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:55:09,056 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:09,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 193 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:55:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-19 06:55:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-11-19 06:55:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 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) [2022-11-19 06:55:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-11-19 06:55:09,081 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 15 [2022-11-19 06:55:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:09,081 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-11-19 06:55:09,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-19 06:55:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-11-19 06:55:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:55:09,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:09,083 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:09,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-11-19 06:55:09,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:09,295 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:55:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:09,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1769802942, now seen corresponding path program 1 times [2022-11-19 06:55:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:55:09,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801686069] [2022-11-19 06:55:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:09,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:09,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:55:09,297 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:55:09,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-19 06:55:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:09,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:55:09,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:09,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 06:55:09,576 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:55:09,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801686069] [2022-11-19 06:55:09,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801686069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:55:09,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1204208334] [2022-11-19 06:55:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:09,577 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 06:55:09,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 06:55:09,579 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 06:55:09,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-19 06:55:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:09,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:55:09,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:09,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 06:55:09,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1204208334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:55:09,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085162925] [2022-11-19 06:55:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:09,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:55:09,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:55:09,923 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:55:09,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 06:55:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:10,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:55:10,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:55:10,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 06:55:10,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085162925] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:55:10,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 06:55:10,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2022-11-19 06:55:10,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340802763] [2022-11-19 06:55:10,190 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 06:55:10,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:55:10,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:55:10,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:55:10,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:55:10,191 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-19 06:55:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:10,272 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2022-11-19 06:55:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:55:10,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-19 06:55:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:10,275 INFO L225 Difference]: With dead ends: 109 [2022-11-19 06:55:10,275 INFO L226 Difference]: Without dead ends: 109 [2022-11-19 06:55:10,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:55:10,277 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 105 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:10,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 398 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:55:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-19 06:55:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-19 06:55:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.6) internal successors, (112), 102 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:55:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2022-11-19 06:55:10,292 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 28 [2022-11-19 06:55:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:10,293 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2022-11-19 06:55:10,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-19 06:55:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2022-11-19 06:55:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-19 06:55:10,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:10,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:10,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-19 06:55:10,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2022-11-19 06:55:10,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:10,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:55:10,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:55:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:10,905 INFO L85 PathProgramCache]: Analyzing trace with hash -888530816, now seen corresponding path program 2 times [2022-11-19 06:55:10,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:55:10,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797621201] [2022-11-19 06:55:10,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 06:55:10,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:10,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:55:10,907 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:55:10,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-19 06:55:11,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 06:55:11,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:55:11,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-19 06:55:11,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:11,183 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:55:11,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 06:55:11,469 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 06:55:11,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 06:55:11,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 06:55:11,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:11,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 06:55:11,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 06:55:14,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:14,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 06:55:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 6 refuted. 6 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:55:14,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:14,371 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:55:14,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797621201] [2022-11-19 06:55:14,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797621201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:55:14,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [766676968] [2022-11-19 06:55:14,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 06:55:14,372 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 06:55:14,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 06:55:14,384 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 06:55:14,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-19 06:55:14,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 06:55:14,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122282228] [2022-11-19 06:55:14,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 06:55:14,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:55:14,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:55:14,739 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:55:14,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 1 [2022-11-19 06:55:14,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 06:55:15,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 06:55:15,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:55:15,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-19 06:55:15,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:15,035 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:55:15,116 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_343 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_343) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-19 06:55:15,214 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 06:55:15,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 06:55:15,246 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_344 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_344))) is different from true [2022-11-19 06:55:15,393 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 06:55:15,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 06:55:15,501 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_345 (_ BitVec 1))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_345) |c_#valid|)) is different from true [2022-11-19 06:55:15,636 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 06:55:15,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 06:55:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2022-11-19 06:55:15,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-19 06:55:16,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122282228] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:55:16,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:55:16,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 5] total 22 [2022-11-19 06:55:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318236423] [2022-11-19 06:55:16,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:55:16,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-19 06:55:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:55:16,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-19 06:55:16,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=344, Unknown=9, NotChecked=120, Total=552 [2022-11-19 06:55:16,633 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 19 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-19 06:55:16,664 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_226 (_ BitVec 1))) (and (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_226) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((v_ArrVal_345 (_ BitVec 1))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_345) |c_#valid|)) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_343 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_343) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_227 (_ BitVec 1))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_227)))) (exists ((v_ArrVal_344 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_344))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-19 06:55:25,854 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_226 (_ BitVec 1))) (and (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_226) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((v_ArrVal_345 (_ BitVec 1))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_345) |c_#valid|)) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_343 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_343) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((v_ArrVal_344 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_344))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-19 06:55:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:34,308 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2022-11-19 06:55:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-19 06:55:34,309 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 19 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 41 [2022-11-19 06:55:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:34,310 INFO L225 Difference]: With dead ends: 126 [2022-11-19 06:55:34,310 INFO L226 Difference]: Without dead ends: 126 [2022-11-19 06:55:34,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=133, Invalid=576, Unknown=13, NotChecked=270, Total=992 [2022-11-19 06:55:34,311 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 56 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:34,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 416 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 382 Unchecked, 0.2s Time] [2022-11-19 06:55:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-19 06:55:34,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2022-11-19 06:55:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 76 states have (on average 1.5263157894736843) internal successors, (116), 106 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:55:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2022-11-19 06:55:34,317 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 41 [2022-11-19 06:55:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:34,317 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2022-11-19 06:55:34,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 19 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-19 06:55:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2022-11-19 06:55:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-19 06:55:34,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:34,319 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:34,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:34,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:34,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:34,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:55:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash -888530815, now seen corresponding path program 1 times [2022-11-19 06:55:34,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:55:34,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684263856] [2022-11-19 06:55:34,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:34,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:34,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:55:34,730 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:55:34,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-19 06:55:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:34,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-19 06:55:34,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:35,004 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:55:35,013 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:55:35,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:55:35,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 06:55:35,107 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_413 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_413) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-19 06:55:35,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:35,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:55:35,206 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 06:55:35,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 06:55:35,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:55:35,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:35,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:55:35,700 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|)) is different from true [2022-11-19 06:55:35,761 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:55:35,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 06:55:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-19 06:55:35,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:36,217 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:55:36,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684263856] [2022-11-19 06:55:36,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684263856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:55:36,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1751676134] [2022-11-19 06:55:36,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:36,218 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 06:55:36,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 06:55:36,219 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 06:55:36,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-11-19 06:55:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:36,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-19 06:55:36,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:36,675 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:55:36,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:55:36,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:36,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:55:36,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:55:37,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:37,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:55:37,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:55:37,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:37,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 06:55:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 06:55:37,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:40,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1751676134] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:55:40,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577030969] [2022-11-19 06:55:40,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:40,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:55:40,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:55:40,596 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:55:40,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 06:55:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:40,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-19 06:55:40,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:40,812 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:55:40,818 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:55:41,187 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:55:41,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 06:55:41,222 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 06:55:41,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 06:55:41,522 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_541 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_541) |c_#valid|)) (exists ((v_ArrVal_540 (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_540) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-19 06:55:41,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:41,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-19 06:55:41,644 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-19 06:55:41,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-19 06:55:41,911 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_542 (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_542) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-19 06:55:41,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:41,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-19 06:55:41,999 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-19 06:55:41,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 06:55:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 18 not checked. [2022-11-19 06:55:42,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:42,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577030969] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:55:42,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:55:42,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-11-19 06:55:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290686547] [2022-11-19 06:55:42,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:55:42,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 06:55:42,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:55:42,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 06:55:42,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=711, Unknown=17, NotChecked=228, Total=1056 [2022-11-19 06:55:42,477 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 29 states, 26 states have (on average 3.269230769230769) internal successors, (85), 22 states have internal predecessors, (85), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-19 06:55:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:44,496 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-11-19 06:55:44,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 06:55:44,497 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 3.269230769230769) internal successors, (85), 22 states have internal predecessors, (85), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 41 [2022-11-19 06:55:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:44,498 INFO L225 Difference]: With dead ends: 113 [2022-11-19 06:55:44,498 INFO L226 Difference]: Without dead ends: 113 [2022-11-19 06:55:44,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=175, Invalid=1298, Unknown=25, NotChecked=308, Total=1806 [2022-11-19 06:55:44,499 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 13 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 630 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:44,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 628 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 630 Unchecked, 0.5s Time] [2022-11-19 06:55:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-19 06:55:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-11-19 06:55:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.513157894736842) internal successors, (115), 105 states have internal predecessors, (115), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:55:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-11-19 06:55:44,505 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 41 [2022-11-19 06:55:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:44,506 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-11-19 06:55:44,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 3.269230769230769) internal successors, (85), 22 states have internal predecessors, (85), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-19 06:55:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-11-19 06:55:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-19 06:55:44,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:44,508 INFO L195 NwaCegarLoop]: 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] [2022-11-19 06:55:44,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:44,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-11-19 06:55:44,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:45,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:55:45,118 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:55:45,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:45,118 INFO L85 PathProgramCache]: Analyzing trace with hash -338093919, now seen corresponding path program 1 times [2022-11-19 06:55:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:55:45,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425715315] [2022-11-19 06:55:45,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:45,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:45,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:55:45,120 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:55:45,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-19 06:55:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:45,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-19 06:55:45,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:45,534 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:55:45,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 06:55:46,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:46,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-19 06:55:46,175 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-19 06:55:46,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-19 06:55:46,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-19 06:55:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:55:46,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:47,230 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:55:47,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425715315] [2022-11-19 06:55:47,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425715315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:55:47,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1533926696] [2022-11-19 06:55:47,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:47,231 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 06:55:47,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 06:55:47,234 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 06:55:47,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-19 06:55:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:47,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-19 06:55:47,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:47,772 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:55:48,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 06:55:48,906 INFO L321 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2022-11-19 06:55:48,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 35 [2022-11-19 06:55:48,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:48,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-11-19 06:55:49,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-19 06:55:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:55:49,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:49,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1533926696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:55:49,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909722011] [2022-11-19 06:55:49,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:49,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:55:49,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:55:49,471 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:55:49,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-19 06:55:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:49,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-19 06:55:49,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:49,709 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:55:49,858 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_735 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_735) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-19 06:55:49,926 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 06:55:49,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 06:55:50,134 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 06:55:50,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 06:55:50,990 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_737 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_737))) (exists ((v_ArrVal_739 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_739))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-19 06:55:51,089 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-19 06:55:51,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2022-11-19 06:55:51,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-19 06:55:51,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-19 06:55:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2022-11-19 06:55:51,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:52,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909722011] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:55:52,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:55:52,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2022-11-19 06:55:52,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963776092] [2022-11-19 06:55:52,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:55:52,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-19 06:55:52,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:55:52,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-19 06:55:52,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2519, Unknown=38, NotChecked=206, Total=2970 [2022-11-19 06:55:52,288 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 51 states, 48 states have (on average 2.2916666666666665) internal successors, (110), 44 states have internal predecessors, (110), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-19 06:55:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:55,021 INFO L93 Difference]: Finished difference Result 132 states and 150 transitions. [2022-11-19 06:55:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 06:55:55,022 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 2.2916666666666665) internal successors, (110), 44 states have internal predecessors, (110), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 44 [2022-11-19 06:55:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:55,023 INFO L225 Difference]: With dead ends: 132 [2022-11-19 06:55:55,023 INFO L226 Difference]: Without dead ends: 132 [2022-11-19 06:55:55,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1433 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=355, Invalid=3760, Unknown=53, NotChecked=254, Total=4422 [2022-11-19 06:55:55,025 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 93 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 499 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:55,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1486 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 759 Invalid, 0 Unknown, 499 Unchecked, 1.3s Time] [2022-11-19 06:55:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-19 06:55:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2022-11-19 06:55:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 107 states have internal predecessors, (119), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:55:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-11-19 06:55:55,031 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 44 [2022-11-19 06:55:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:55,032 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-11-19 06:55:55,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 2.2916666666666665) internal successors, (110), 44 states have internal predecessors, (110), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-19 06:55:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-11-19 06:55:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-19 06:55:55,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:55,034 INFO L195 NwaCegarLoop]: 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] [2022-11-19 06:55:55,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:55,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:55,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:55,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:55,638 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:55:55,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash -338093918, now seen corresponding path program 1 times [2022-11-19 06:55:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:55:55,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171971607] [2022-11-19 06:55:55,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:55,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:55:55,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:55:55,641 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:55:55,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-19 06:55:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:55,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-19 06:55:55,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:56,045 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:55:56,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:55:56,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-19 06:55:56,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:55:56,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:56,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:55:56,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:55:56,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 06:55:56,845 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 06:55:56,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:55:56,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-19 06:55:56,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 06:55:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:55:57,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:55:58,032 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:55:58,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171971607] [2022-11-19 06:55:58,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171971607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:55:58,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [67695904] [2022-11-19 06:55:58,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:58,032 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 06:55:58,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 06:55:58,034 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 06:55:58,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-19 06:55:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:55:58,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-19 06:55:58,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:55:58,690 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:55:58,698 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:55:59,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:55:59,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:56:00,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:00,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:56:00,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:00,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 06:56:00,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:00,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-19 06:56:00,384 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-19 06:56:00,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-11-19 06:56:00,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 06:56:00,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-19 06:56:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:56:00,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:01,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [67695904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:56:01,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37191622] [2022-11-19 06:56:01,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:01,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:01,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:56:01,508 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:56:01,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-19 06:56:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:01,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-19 06:56:01,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:01,881 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:56:02,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:56:02,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:56:03,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:03,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-19 06:56:03,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:03,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:56:03,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:03,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 06:56:03,535 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-19 06:56:03,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-11-19 06:56:03,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-19 06:56:03,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 06:56:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:56:03,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:04,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37191622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:56:04,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:56:04,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 42 [2022-11-19 06:56:04,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208227305] [2022-11-19 06:56:04,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:56:04,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-19 06:56:04,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:04,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-19 06:56:04,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2118, Unknown=25, NotChecked=0, Total=2352 [2022-11-19 06:56:04,595 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 43 states, 39 states have (on average 2.358974358974359) internal successors, (92), 38 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-19 06:56:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:07,757 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-11-19 06:56:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 06:56:07,758 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 2.358974358974359) internal successors, (92), 38 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 44 [2022-11-19 06:56:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:07,759 INFO L225 Difference]: With dead ends: 132 [2022-11-19 06:56:07,759 INFO L226 Difference]: Without dead ends: 132 [2022-11-19 06:56:07,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=360, Invalid=3261, Unknown=39, NotChecked=0, Total=3660 [2022-11-19 06:56:07,761 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 46 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:07,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1296 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 641 Invalid, 0 Unknown, 208 Unchecked, 1.3s Time] [2022-11-19 06:56:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-19 06:56:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2022-11-19 06:56:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 107 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:56:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2022-11-19 06:56:07,767 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 44 [2022-11-19 06:56:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:07,767 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2022-11-19 06:56:07,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 2.358974358974359) internal successors, (92), 38 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-19 06:56:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-11-19 06:56:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-19 06:56:07,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:07,769 INFO L195 NwaCegarLoop]: 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] [2022-11-19 06:56:07,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:07,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:08,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:08,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:08,374 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:08,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:08,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1890978520, now seen corresponding path program 1 times [2022-11-19 06:56:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:08,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257706210] [2022-11-19 06:56:08,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:08,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:08,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:08,376 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:08,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-19 06:56:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:08,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:56:08,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:56:08,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:56:08,613 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:08,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257706210] [2022-11-19 06:56:08,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257706210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:56:08,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:56:08,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:56:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956904269] [2022-11-19 06:56:08,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:56:08,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:56:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:08,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:56:08,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:56:08,615 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-11-19 06:56:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:08,663 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2022-11-19 06:56:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:56:08,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 45 [2022-11-19 06:56:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:08,665 INFO L225 Difference]: With dead ends: 116 [2022-11-19 06:56:08,665 INFO L226 Difference]: Without dead ends: 116 [2022-11-19 06:56:08,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:56:08,666 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 82 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:08,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 186 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:56:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-19 06:56:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-11-19 06:56:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.5) internal successors, (117), 107 states have internal predecessors, (117), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:56:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2022-11-19 06:56:08,671 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 45 [2022-11-19 06:56:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:08,672 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2022-11-19 06:56:08,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-11-19 06:56:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2022-11-19 06:56:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-19 06:56:08,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:08,673 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:56:08,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:08,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:08,883 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash -457619027, now seen corresponding path program 1 times [2022-11-19 06:56:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:08,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824076059] [2022-11-19 06:56:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:08,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:08,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:08,886 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:08,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-19 06:56:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:09,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:56:09,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:56:09,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:56:10,113 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:10,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824076059] [2022-11-19 06:56:10,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824076059] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:56:10,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1788839770] [2022-11-19 06:56:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:10,114 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 06:56:10,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 06:56:10,118 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 06:56:10,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-19 06:56:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:10,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:56:10,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:56:10,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:56:11,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1788839770] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:56:11,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101235189] [2022-11-19 06:56:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:11,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:11,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:56:11,223 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:56:11,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-19 06:56:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:11,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:56:11,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:56:11,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:56:12,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101235189] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:56:12,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 06:56:12,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-19 06:56:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026047648] [2022-11-19 06:56:12,182 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 06:56:12,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 06:56:12,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:12,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 06:56:12,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:56:12,183 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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) [2022-11-19 06:56:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:12,243 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-11-19 06:56:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:56:12,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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 47 [2022-11-19 06:56:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:12,245 INFO L225 Difference]: With dead ends: 112 [2022-11-19 06:56:12,245 INFO L226 Difference]: Without dead ends: 112 [2022-11-19 06:56:12,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:56:12,246 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 211 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:12,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 229 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:56:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-19 06:56:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-19 06:56:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 104 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:56:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2022-11-19 06:56:12,251 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 47 [2022-11-19 06:56:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:12,251 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2022-11-19 06:56:12,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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) [2022-11-19 06:56:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-11-19 06:56:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-19 06:56:12,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:12,252 INFO L195 NwaCegarLoop]: 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] [2022-11-19 06:56:12,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:12,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:12,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:12,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 06:56:12,860 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:12,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:12,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1301289572, now seen corresponding path program 1 times [2022-11-19 06:56:12,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:12,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856392050] [2022-11-19 06:56:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:12,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:12,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:12,862 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:12,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-19 06:56:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:13,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:56:13,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:56:13,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:56:13,083 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:13,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856392050] [2022-11-19 06:56:13,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856392050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:56:13,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:56:13,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:56:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705764018] [2022-11-19 06:56:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:56:13,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:56:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:13,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:56:13,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:56:13,085 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:56:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:13,351 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2022-11-19 06:56:13,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:56:13,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-11-19 06:56:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:13,352 INFO L225 Difference]: With dead ends: 123 [2022-11-19 06:56:13,352 INFO L226 Difference]: Without dead ends: 123 [2022-11-19 06:56:13,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:56:13,353 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:13,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 145 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:56:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-19 06:56:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2022-11-19 06:56:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 103 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:56:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-11-19 06:56:13,358 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 48 [2022-11-19 06:56:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:13,358 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-11-19 06:56:13,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:56:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-11-19 06:56:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-19 06:56:13,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:13,360 INFO L195 NwaCegarLoop]: 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] [2022-11-19 06:56:13,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:13,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:13,572 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:13,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1301289571, now seen corresponding path program 1 times [2022-11-19 06:56:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:13,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581634650] [2022-11-19 06:56:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:13,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:13,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:13,574 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:13,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-19 06:56:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:13,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:56:13,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:56:13,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:56:13,895 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:13,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581634650] [2022-11-19 06:56:13,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581634650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:56:13,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:56:13,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:56:13,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83585699] [2022-11-19 06:56:13,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:56:13,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:56:13,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:13,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:56:13,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:56:13,898 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:56:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:14,253 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-11-19 06:56:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:56:14,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-11-19 06:56:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:14,255 INFO L225 Difference]: With dead ends: 110 [2022-11-19 06:56:14,256 INFO L226 Difference]: Without dead ends: 110 [2022-11-19 06:56:14,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:56:14,257 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 65 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:14,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 141 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:56:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-19 06:56:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-19 06:56:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 102 states have internal predecessors, (111), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:56:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-11-19 06:56:14,262 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 48 [2022-11-19 06:56:14,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:14,262 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-11-19 06:56:14,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:56:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-11-19 06:56:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-19 06:56:14,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:14,263 INFO L195 NwaCegarLoop]: 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] [2022-11-19 06:56:14,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:14,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:14,467 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:14,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1301289412, now seen corresponding path program 1 times [2022-11-19 06:56:14,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:14,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965409929] [2022-11-19 06:56:14,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:14,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:14,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:14,469 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:14,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-19 06:56:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:14,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:56:14,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-19 06:56:14,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:56:14,697 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:14,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965409929] [2022-11-19 06:56:14,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965409929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:56:14,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:56:14,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:56:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055290102] [2022-11-19 06:56:14,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:56:14,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:56:14,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:14,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:56:14,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:56:14,698 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:56:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:14,837 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2022-11-19 06:56:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:56:14,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-11-19 06:56:14,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:14,839 INFO L225 Difference]: With dead ends: 121 [2022-11-19 06:56:14,839 INFO L226 Difference]: Without dead ends: 121 [2022-11-19 06:56:14,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:56:14,840 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:14,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 87 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:56:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-19 06:56:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2022-11-19 06:56:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 101 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:56:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2022-11-19 06:56:14,845 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 48 [2022-11-19 06:56:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:14,845 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2022-11-19 06:56:14,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 06:56:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2022-11-19 06:56:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-19 06:56:14,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:14,846 INFO L195 NwaCegarLoop]: 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] [2022-11-19 06:56:14,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:15,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:15,055 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1301289411, now seen corresponding path program 1 times [2022-11-19 06:56:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:15,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459424848] [2022-11-19 06:56:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:15,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:15,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:15,058 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:15,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-19 06:56:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:15,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:56:15,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-19 06:56:15,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:56:15,443 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:15,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459424848] [2022-11-19 06:56:15,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459424848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:56:15,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:56:15,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:56:15,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288350055] [2022-11-19 06:56:15,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:56:15,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:56:15,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:15,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:56:15,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:56:15,445 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-11-19 06:56:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:15,704 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-11-19 06:56:15,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:56:15,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 48 [2022-11-19 06:56:15,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:15,705 INFO L225 Difference]: With dead ends: 108 [2022-11-19 06:56:15,705 INFO L226 Difference]: Without dead ends: 108 [2022-11-19 06:56:15,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:56:15,706 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 138 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 106 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.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:15,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 106 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:56:15,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-19 06:56:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-11-19 06:56:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 100 states have internal predecessors, (109), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:56:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2022-11-19 06:56:15,711 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 48 [2022-11-19 06:56:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:15,712 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2022-11-19 06:56:15,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-11-19 06:56:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-11-19 06:56:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-19 06:56:15,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:15,713 INFO L195 NwaCegarLoop]: 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] [2022-11-19 06:56:15,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:15,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:15,919 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:15,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1685271039, now seen corresponding path program 1 times [2022-11-19 06:56:15,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:15,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485438298] [2022-11-19 06:56:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:15,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:15,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:15,921 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:15,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-19 06:56:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:16,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:56:16,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:16,202 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:56:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 06:56:16,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:56:16,276 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:16,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485438298] [2022-11-19 06:56:16,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485438298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:56:16,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:56:16,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:56:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599963600] [2022-11-19 06:56:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:56:16,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:56:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:56:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:56:16,278 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-11-19 06:56:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:16,703 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-11-19 06:56:16,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:56:16,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 49 [2022-11-19 06:56:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:16,704 INFO L225 Difference]: With dead ends: 119 [2022-11-19 06:56:16,705 INFO L226 Difference]: Without dead ends: 119 [2022-11-19 06:56:16,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:56:16,706 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 59 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:16,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 225 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 06:56:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-19 06:56:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2022-11-19 06:56:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 99 states have internal predecessors, (108), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:56:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2022-11-19 06:56:16,711 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 49 [2022-11-19 06:56:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:16,712 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2022-11-19 06:56:16,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-11-19 06:56:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2022-11-19 06:56:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-19 06:56:16,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:16,713 INFO L195 NwaCegarLoop]: 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] [2022-11-19 06:56:16,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-11-19 06:56:16,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:16,927 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:16,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1685271038, now seen corresponding path program 1 times [2022-11-19 06:56:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:16,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390107093] [2022-11-19 06:56:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:16,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:16,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:16,929 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:16,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-19 06:56:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:17,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-19 06:56:17,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:17,211 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:56:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 06:56:17,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:56:17,361 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:17,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390107093] [2022-11-19 06:56:17,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390107093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:56:17,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:56:17,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:56:17,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954464074] [2022-11-19 06:56:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:56:17,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:56:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:17,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:56:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:56:17,362 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-11-19 06:56:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:17,830 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2022-11-19 06:56:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:56:17,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 49 [2022-11-19 06:56:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:17,831 INFO L225 Difference]: With dead ends: 106 [2022-11-19 06:56:17,832 INFO L226 Difference]: Without dead ends: 106 [2022-11-19 06:56:17,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:56:17,832 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 61 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:17,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 228 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 06:56:17,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-19 06:56:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-19 06:56:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 98 states have internal predecessors, (107), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:56:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-11-19 06:56:17,837 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 49 [2022-11-19 06:56:17,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:17,838 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-11-19 06:56:17,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-11-19 06:56:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-11-19 06:56:17,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-19 06:56:17,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:17,839 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-11-19 06:56:17,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:18,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:18,040 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash -342796830, now seen corresponding path program 1 times [2022-11-19 06:56:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:18,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391063807] [2022-11-19 06:56:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:18,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:18,041 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:18,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-19 06:56:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:18,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:56:18,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-19 06:56:18,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:56:18,318 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:18,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391063807] [2022-11-19 06:56:18,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391063807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:56:18,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:56:18,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:56:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865401391] [2022-11-19 06:56:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:56:18,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:56:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:56:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:56:18,320 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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) [2022-11-19 06:56:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:18,512 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2022-11-19 06:56:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:56:18,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 51 [2022-11-19 06:56:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:18,514 INFO L225 Difference]: With dead ends: 117 [2022-11-19 06:56:18,514 INFO L226 Difference]: Without dead ends: 117 [2022-11-19 06:56:18,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:56:18,515 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 130 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:18,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 100 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:56:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-19 06:56:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2022-11-19 06:56:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 97 states have internal predecessors, (106), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:56:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2022-11-19 06:56:18,528 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 51 [2022-11-19 06:56:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:18,529 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2022-11-19 06:56:18,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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) [2022-11-19 06:56:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-11-19 06:56:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-19 06:56:18,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:18,530 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-11-19 06:56:18,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:18,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:18,739 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash -342796829, now seen corresponding path program 1 times [2022-11-19 06:56:18,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:18,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472979757] [2022-11-19 06:56:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:18,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:18,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:18,741 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:18,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-19 06:56:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:19,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 06:56:19,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-19 06:56:19,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:56:19,174 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:19,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472979757] [2022-11-19 06:56:19,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472979757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:56:19,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:56:19,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:56:19,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809089534] [2022-11-19 06:56:19,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:56:19,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:56:19,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:19,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:56:19,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:56:19,176 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-19 06:56:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:19,409 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-11-19 06:56:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:56:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 51 [2022-11-19 06:56:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:19,411 INFO L225 Difference]: With dead ends: 103 [2022-11-19 06:56:19,411 INFO L226 Difference]: Without dead ends: 103 [2022-11-19 06:56:19,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:56:19,412 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 117 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:19,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 102 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:56:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-19 06:56:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-19 06:56:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 95 states have internal predecessors, (104), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 06:56:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2022-11-19 06:56:19,417 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 51 [2022-11-19 06:56:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:19,418 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2022-11-19 06:56:19,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-19 06:56:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2022-11-19 06:56:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 06:56:19,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:19,419 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-11-19 06:56:19,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:19,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:19,634 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:19,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1171904341, now seen corresponding path program 1 times [2022-11-19 06:56:19,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:19,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706146014] [2022-11-19 06:56:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:19,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:19,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:19,636 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:19,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-19 06:56:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:20,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-19 06:56:20,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:20,309 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-19 06:56:20,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-19 06:56:20,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:20,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-11-19 06:56:21,841 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:56:21,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-19 06:56:21,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:21,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-11-19 06:56:22,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-19 06:56:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:56:22,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:22,640 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1748 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1748) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-11-19 06:56:23,990 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:23,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706146014] [2022-11-19 06:56:23,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706146014] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:56:23,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [457544049] [2022-11-19 06:56:23,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:23,991 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 06:56:23,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 06:56:23,992 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 06:56:23,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-19 06:56:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:24,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-19 06:56:24,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:24,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 06:56:24,965 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1822 (_ BitVec 1))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1822)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-19 06:56:25,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 06:56:25,136 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1823 (_ BitVec 1))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1823) |c_#valid|))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-19 06:56:25,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 06:56:25,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 06:56:26,998 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-19 06:56:26,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-11-19 06:56:27,327 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:56:27,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2022-11-19 06:56:27,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:27,713 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 06:56:27,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 45 [2022-11-19 06:56:28,251 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-19 06:56:28,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-11-19 06:56:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-11-19 06:56:28,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:28,576 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1827) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-11-19 06:56:30,438 INFO L321 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2022-11-19 06:56:30,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 59 [2022-11-19 06:56:30,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:56:30,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 59 treesize of output 82 [2022-11-19 06:56:30,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-19 06:56:32,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [457544049] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:56:32,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502253587] [2022-11-19 06:56:32,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:32,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:32,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:56:32,384 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:56:32,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-19 06:56:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:32,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-19 06:56:32,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:32,702 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:56:32,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 06:56:32,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1900 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1900)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-19 06:56:33,055 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 06:56:33,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 06:56:33,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 06:56:33,706 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 06:56:33,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 06:56:35,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-19 06:56:36,537 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:56:36,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-11-19 06:56:36,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:56:38,311 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:56:38,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-19 06:56:38,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:38,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-19 06:56:39,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-19 06:56:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-19 06:56:39,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:39,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 06:56:41,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502253587] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:56:41,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:56:41,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 28] total 65 [2022-11-19 06:56:41,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244348784] [2022-11-19 06:56:41,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:56:41,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-19 06:56:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:56:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-19 06:56:41,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=6589, Unknown=191, NotChecked=850, Total=8010 [2022-11-19 06:56:41,773 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 65 states, 62 states have (on average 2.1451612903225805) internal successors, (133), 57 states have internal predecessors, (133), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-19 06:56:51,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:56:51,084 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-11-19 06:56:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-19 06:56:51,085 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 62 states have (on average 2.1451612903225805) internal successors, (133), 57 states have internal predecessors, (133), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 54 [2022-11-19 06:56:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:56:51,086 INFO L225 Difference]: With dead ends: 103 [2022-11-19 06:56:51,086 INFO L226 Difference]: Without dead ends: 103 [2022-11-19 06:56:51,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4087 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=708, Invalid=11529, Unknown=215, NotChecked=1120, Total=13572 [2022-11-19 06:56:51,089 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 40 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 502 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 06:56:51,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 676 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 0 Unknown, 502 Unchecked, 0.5s Time] [2022-11-19 06:56:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-19 06:56:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-19 06:56:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 96 states have internal predecessors, (103), 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) [2022-11-19 06:56:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2022-11-19 06:56:51,093 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 54 [2022-11-19 06:56:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:56:51,093 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2022-11-19 06:56:51,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 62 states have (on average 2.1451612903225805) internal successors, (133), 57 states have internal predecessors, (133), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-19 06:56:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-11-19 06:56:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 06:56:51,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:56:51,095 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-11-19 06:56:51,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:51,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:51,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-19 06:56:51,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:51,700 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:56:51,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:56:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1171904388, now seen corresponding path program 1 times [2022-11-19 06:56:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:56:51,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409143784] [2022-11-19 06:56:51,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:51,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:56:51,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:56:51,702 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:56:51,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-19 06:56:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:52,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-19 06:56:52,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:52,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:56:52,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:56:52,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:52,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 06:56:53,738 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:56:53,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-19 06:56:53,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:53,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 06:56:54,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-19 06:56:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:56:54,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:56,809 INFO L321 Elim1Store]: treesize reduction 7, result has 65.0 percent of original size [2022-11-19 06:56:56,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-11-19 06:56:57,341 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1980) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-19 06:56:57,780 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:56:57,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409143784] [2022-11-19 06:56:57,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409143784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:56:57,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [838808139] [2022-11-19 06:56:57,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:56:57,781 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 06:56:57,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 06:56:57,782 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 06:56:57,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-19 06:56:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:58,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-19 06:56:58,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:58,805 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:57:00,595 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 06:57:00,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-11-19 06:57:00,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:00,988 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 06:57:00,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 56 [2022-11-19 06:57:01,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:57:01,573 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-19 06:57:01,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 54 [2022-11-19 06:57:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-19 06:57:02,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:57:13,782 INFO L321 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2022-11-19 06:57:13,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 57 [2022-11-19 06:57:13,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:57:13,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 83 [2022-11-19 06:57:13,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-19 06:57:14,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:57:14,935 INFO L350 Elim1Store]: Elim1 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 81 treesize of output 133 [2022-11-19 06:57:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-19 06:57:16,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [838808139] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:57:16,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958880706] [2022-11-19 06:57:16,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:16,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:57:16,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:57:16,646 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:57:16,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-19 06:57:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:16,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-19 06:57:16,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:57:16,953 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:57:17,245 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_2128 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2128) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-19 06:57:17,318 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 06:57:17,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 06:57:17,769 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 06:57:17,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 06:57:19,655 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 06:57:19,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 06:57:19,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-19 06:57:21,309 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:57:21,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-19 06:57:21,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-11-19 06:57:21,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-19 06:57:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 1 refuted. 6 times theorem prover too weak. 3 trivial. 12 not checked. [2022-11-19 06:57:21,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:57:21,945 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 06:57:23,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2132) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 06:57:24,000 INFO L321 Elim1Store]: treesize reduction 7, result has 65.0 percent of original size [2022-11-19 06:57:24,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-11-19 06:57:24,917 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2132) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|)) is different from false [2022-11-19 06:57:25,948 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_67| (_ BitVec 32)) (v_ArrVal_2132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2137 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_67| v_ArrVal_2137))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (= .cse0 (select (select (store (store .cse1 .cse0 v_ArrVal_2132) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_67| v_ArrVal_2133) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_67|) (_ bv0 1))))) is different from false [2022-11-19 06:57:25,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958880706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:57:25,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2022-11-19 06:57:25,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 15, 25] total 74 [2022-11-19 06:57:25,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667693802] [2022-11-19 06:57:25,953 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2022-11-19 06:57:25,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-19 06:57:25,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:57:25,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-19 06:57:25,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=6356, Unknown=314, NotChecked=1014, Total=8010 [2022-11-19 06:57:25,957 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 75 states, 70 states have (on average 2.2285714285714286) internal successors, (156), 66 states have internal predecessors, (156), 8 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-19 06:57:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:32,541 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-11-19 06:57:32,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-19 06:57:32,542 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 70 states have (on average 2.2285714285714286) internal successors, (156), 66 states have internal predecessors, (156), 8 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 54 [2022-11-19 06:57:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:32,543 INFO L225 Difference]: With dead ends: 116 [2022-11-19 06:57:32,543 INFO L226 Difference]: Without dead ends: 116 [2022-11-19 06:57:32,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3298 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=528, Invalid=9677, Unknown=325, NotChecked=1242, Total=11772 [2022-11-19 06:57:32,547 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 61 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 749 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:32,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1504 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 433 Invalid, 0 Unknown, 749 Unchecked, 1.0s Time] [2022-11-19 06:57:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-19 06:57:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2022-11-19 06:57:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 95 states have internal predecessors, (103), 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) [2022-11-19 06:57:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-11-19 06:57:32,551 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 54 [2022-11-19 06:57:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:32,551 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-11-19 06:57:32,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 70 states have (on average 2.2285714285714286) internal successors, (156), 66 states have internal predecessors, (156), 8 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-19 06:57:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-11-19 06:57:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 06:57:32,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:32,553 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-11-19 06:57:32,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-19 06:57:32,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-19 06:57:32,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-19 06:57:33,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:57:33,167 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 06:57:33,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:33,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1171904389, now seen corresponding path program 1 times [2022-11-19 06:57:33,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:57:33,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083496158] [2022-11-19 06:57:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:33,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:57:33,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:57:33,169 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 06:57:33,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-19 06:57:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:33,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-19 06:57:33,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:57:33,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:57:34,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:57:34,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:57:34,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:34,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 06:57:34,579 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:57:34,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 06:57:34,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:57:35,672 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:57:35,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-11-19 06:57:35,710 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-19 06:57:35,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 41 [2022-11-19 06:57:35,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-11-19 06:57:35,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:35,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-19 06:57:35,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:35,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-19 06:57:36,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-19 06:57:36,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-19 06:57:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:57:36,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:57:36,936 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2214 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2214) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2213) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2214 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2214) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-19 06:57:38,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:57:38,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2022-11-19 06:57:52,387 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:57:52,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083496158] [2022-11-19 06:57:52,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083496158] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:57:52,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [678621694] [2022-11-19 06:57:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:52,387 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 06:57:52,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 06:57:52,389 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 06:57:52,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-19 06:57:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:53,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-19 06:57:53,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:57:57,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:58:00,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:00,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 06:58:04,470 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:58:04,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-11-19 06:58:04,609 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-19 06:58:04,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 [2022-11-19 06:58:04,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-19 06:58:05,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:05,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-19 06:58:05,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:05,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2022-11-19 06:58:06,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-19 06:58:06,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-19 06:58:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:58:08,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:58:08,632 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2295 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2295) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2296 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2295) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2296) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-19 06:58:08,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:58:08,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2022-11-19 06:58:08,895 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2294 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2294) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2295) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) (and (or (and (forall ((v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_prenex_27) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv0 32))) .cse0) (forall ((v_ArrVal_2296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2293) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2296) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|))) (forall ((v_prenex_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_prenex_27) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_26) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) .cse0)) is different from false [2022-11-19 06:58:16,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:58:16,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 335 treesize of output 290 [2022-11-19 06:58:16,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 262 [2022-11-19 06:58:16,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 258 [2022-11-19 06:58:16,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 250 [2022-11-19 06:58:16,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 246 [2022-11-19 06:58:37,177 WARN L233 SmtUtils]: Spent 10.79s on a formula simplification. DAG size of input: 27 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 06:58:37,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [678621694] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:58:37,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178634898] [2022-11-19 06:58:37,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:58:37,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:58:37,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:58:37,182 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:58:37,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-19 06:58:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:58:37,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-19 06:58:37,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:58:37,758 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 06:58:37,786 INFO L350 Elim1Store]: Elim1 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 [2022-11-19 06:58:43,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 06:58:43,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 06:58:47,867 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:58:47,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 06:58:47,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 06:58:48,105 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:58:48,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2022-11-19 06:58:48,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:48,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 06:58:48,182 INFO L321 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-11-19 06:58:48,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-19 06:58:48,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-19 06:58:53,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:53,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-11-19 06:58:53,797 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-19 06:58:53,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2022-11-19 06:58:54,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:54,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-19 06:58:54,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:54,735 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-19 06:58:55,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-19 06:58:55,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 06:58:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:58:57,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:58:57,615 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2381) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-19 06:59:11,939 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset|))) (and (forall ((v_ArrVal_2379 (_ BitVec 32)) (v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2377 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store .cse0 .cse1 v_ArrVal_2377)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse1 v_ArrVal_2379)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2381) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2377 (_ BitVec 32))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store .cse0 .cse1 v_ArrVal_2377)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))))) is different from false [2022-11-19 06:59:38,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178634898] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:59:38,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:59:38,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 23] total 66 [2022-11-19 06:59:38,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504233909] [2022-11-19 06:59:38,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:59:38,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-19 06:59:38,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:59:38,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-19 06:59:38,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=7070, Unknown=271, NotChecked=880, Total=8556 [2022-11-19 06:59:38,300 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 67 states, 63 states have (on average 1.9206349206349207) internal successors, (121), 58 states have internal predecessors, (121), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-19 07:00:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:00:02,015 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-11-19 07:00:02,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-19 07:00:02,016 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 63 states have (on average 1.9206349206349207) internal successors, (121), 58 states have internal predecessors, (121), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 54 [2022-11-19 07:00:02,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:00:02,016 INFO L225 Difference]: With dead ends: 102 [2022-11-19 07:00:02,016 INFO L226 Difference]: Without dead ends: 102 [2022-11-19 07:00:02,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3698 ImplicationChecksByTransitivity, 134.0s TimeCoverageRelationStatistics Valid=576, Invalid=10506, Unknown=280, NotChecked=1070, Total=12432 [2022-11-19 07:00:02,019 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 39 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 433 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:00:02,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1816 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 369 Invalid, 0 Unknown, 433 Unchecked, 2.4s Time] [2022-11-19 07:00:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-19 07:00:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-19 07:00:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 95 states have internal predecessors, (102), 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) [2022-11-19 07:00:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-11-19 07:00:02,024 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 54 [2022-11-19 07:00:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:00:02,025 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-11-19 07:00:02,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 63 states have (on average 1.9206349206349207) internal successors, (121), 58 states have internal predecessors, (121), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-19 07:00:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-11-19 07:00:02,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 07:00:02,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:00:02,026 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-11-19 07:00:02,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:02,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:02,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:02,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 07:00:02,637 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 07:00:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:00:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1438572533, now seen corresponding path program 1 times [2022-11-19 07:00:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:00:02,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102796782] [2022-11-19 07:00:02,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:02,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:00:02,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:00:02,639 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:00:02,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-19 07:00:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:02,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 07:00:02,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:00:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 07:00:03,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:00:03,683 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:00:03,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102796782] [2022-11-19 07:00:03,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102796782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:00:03,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:00:03,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 07:00:03,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84884702] [2022-11-19 07:00:03,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:00:03,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:00:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:00:03,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:00:03,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:00:03,685 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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) [2022-11-19 07:00:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:00:05,473 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2022-11-19 07:00:05,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:00:05,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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 54 [2022-11-19 07:00:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:00:05,475 INFO L225 Difference]: With dead ends: 176 [2022-11-19 07:00:05,475 INFO L226 Difference]: Without dead ends: 176 [2022-11-19 07:00:05,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:00:05,476 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 423 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:00:05,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 243 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-19 07:00:05,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-19 07:00:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 104. [2022-11-19 07:00:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.308641975308642) internal successors, (106), 97 states have internal predecessors, (106), 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) [2022-11-19 07:00:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2022-11-19 07:00:05,480 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 54 [2022-11-19 07:00:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:00:05,480 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2022-11-19 07:00:05,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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) [2022-11-19 07:00:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2022-11-19 07:00:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 07:00:05,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:00:05,481 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-11-19 07:00:05,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:05,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:00:05,683 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 07:00:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:00:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1438572534, now seen corresponding path program 1 times [2022-11-19 07:00:05,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:00:05,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798004099] [2022-11-19 07:00:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:05,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:00:05,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:00:05,686 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:00:05,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-11-19 07:00:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:05,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-19 07:00:05,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:00:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 07:00:06,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:00:06,918 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:00:06,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798004099] [2022-11-19 07:00:06,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798004099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:00:06,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:00:06,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 07:00:06,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294768202] [2022-11-19 07:00:06,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:00:06,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:00:06,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:00:06,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:00:06,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:00:06,920 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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) [2022-11-19 07:00:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:00:09,053 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-11-19 07:00:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:00:09,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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 54 [2022-11-19 07:00:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:00:09,055 INFO L225 Difference]: With dead ends: 164 [2022-11-19 07:00:09,056 INFO L226 Difference]: Without dead ends: 164 [2022-11-19 07:00:09,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:00:09,056 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 363 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:00:09,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 246 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-19 07:00:09,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-19 07:00:09,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 106. [2022-11-19 07:00:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 99 states have internal predecessors, (108), 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) [2022-11-19 07:00:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-11-19 07:00:09,061 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 54 [2022-11-19 07:00:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:00:09,062 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-11-19 07:00:09,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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) [2022-11-19 07:00:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-11-19 07:00:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 07:00:09,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:00:09,063 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-11-19 07:00:09,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:09,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:00:09,267 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 07:00:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:00:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1438572580, now seen corresponding path program 1 times [2022-11-19 07:00:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:00:09,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900154198] [2022-11-19 07:00:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:09,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:00:09,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:00:09,269 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:00:09,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-11-19 07:00:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:09,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-19 07:00:09,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:00:09,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:09,737 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2598 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2598))))) is different from true [2022-11-19 07:00:09,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:09,990 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2599 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2599))))) is different from true [2022-11-19 07:00:10,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:10,222 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2600 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2600) |c_#valid|)))) is different from true [2022-11-19 07:00:10,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:10,510 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:00:10,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 07:00:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-11-19 07:00:10,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:00:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 07:00:12,137 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:00:12,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900154198] [2022-11-19 07:00:12,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900154198] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:00:12,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1681409928] [2022-11-19 07:00:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:12,137 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:00:12,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:00:12,138 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:00:12,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2022-11-19 07:00:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:12,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-19 07:00:12,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:00:12,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:12,828 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2679 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2679) |c_#valid|)))) is different from true [2022-11-19 07:00:12,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:13,082 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2680 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2680) |c_#valid|)))) is different from true [2022-11-19 07:00:13,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:13,332 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2681 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2681))))) is different from true [2022-11-19 07:00:13,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:13,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:00:13,575 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:00:13,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 07:00:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-11-19 07:00:13,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:00:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 07:00:15,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1681409928] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:00:15,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478747635] [2022-11-19 07:00:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:15,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:00:15,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:00:15,209 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:00:15,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-19 07:00:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:15,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-19 07:00:15,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:00:15,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:15,576 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2760 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2760) |c_#valid|)))) is different from true [2022-11-19 07:00:15,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:15,870 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2761 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2761) |c_#valid|)))) is different from true [2022-11-19 07:00:16,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:16,193 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2762 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2762))))) is different from true [2022-11-19 07:00:16,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2022-11-19 07:00:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-11-19 07:00:16,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:00:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-19 07:00:20,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478747635] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:00:20,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 07:00:20,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 8, 7, 8, 7] total 24 [2022-11-19 07:00:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141038198] [2022-11-19 07:00:20,952 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 07:00:20,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-19 07:00:20,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:00:20,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-19 07:00:20,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=184, Unknown=9, NotChecked=324, Total=600 [2022-11-19 07:00:20,953 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 25 states, 25 states have (on average 4.6) internal successors, (115), 23 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-19 07:00:21,173 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| (_ bv0 32)))) (and (or (= (_ bv0 1) .cse0) (not (= (select |c_old(#valid)| (_ bv0 32)) (_ bv0 1)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2762 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2762))))) (or (not (= (_ bv0 1) (bvadd (_ bv1 1) .cse0))) (not (= (_ bv0 32) |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2600 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2600) |c_#valid|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2760 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2760) |c_#valid|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2680 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2680) |c_#valid|)))) (or (not (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| (_ bv0 32))) (not (= (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (_ bv0 1)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2761 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2761) |c_#valid|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2681 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2681))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2679 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2679) |c_#valid|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2599 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2599))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2598 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2598))))))) is different from true [2022-11-19 07:00:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:00:22,152 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-11-19 07:00:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:00:22,153 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.6) internal successors, (115), 23 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 54 [2022-11-19 07:00:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:00:22,154 INFO L225 Difference]: With dead ends: 97 [2022-11-19 07:00:22,154 INFO L226 Difference]: Without dead ends: 97 [2022-11-19 07:00:22,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 272 SyntacticMatches, 23 SemanticMatches, 27 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=112, Invalid=255, Unknown=15, NotChecked=430, Total=812 [2022-11-19 07:00:22,155 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 207 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 702 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 07:00:22,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 276 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 86 Invalid, 0 Unknown, 702 Unchecked, 0.6s Time] [2022-11-19 07:00:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-19 07:00:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-19 07:00:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 90 states have internal predecessors, (96), 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) [2022-11-19 07:00:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2022-11-19 07:00:22,159 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 54 [2022-11-19 07:00:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:00:22,160 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2022-11-19 07:00:22,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.6) internal successors, (115), 23 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-19 07:00:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-11-19 07:00:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-19 07:00:22,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:00:22,161 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:00:22,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (46)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:22,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:22,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:22,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:00:22,767 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 07:00:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:00:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash 918686917, now seen corresponding path program 1 times [2022-11-19 07:00:22,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:00:22,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069567181] [2022-11-19 07:00:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:22,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:00:22,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:00:22,769 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:00:22,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-11-19 07:00:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:23,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 07:00:23,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:00:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-19 07:00:23,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:00:23,135 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:00:23,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069567181] [2022-11-19 07:00:23,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069567181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:00:23,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:00:23,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:00:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27829108] [2022-11-19 07:00:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:00:23,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:00:23,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:00:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:00:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:00:23,137 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:00:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:00:23,486 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-11-19 07:00:23,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:00:23,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2022-11-19 07:00:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:00:23,487 INFO L225 Difference]: With dead ends: 98 [2022-11-19 07:00:23,487 INFO L226 Difference]: Without dead ends: 98 [2022-11-19 07:00:23,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:00:23,488 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:00:23,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:00:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-19 07:00:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-11-19 07:00:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 89 states have internal predecessors, (95), 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) [2022-11-19 07:00:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-11-19 07:00:23,493 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 56 [2022-11-19 07:00:23,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:00:23,494 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-11-19 07:00:23,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:00:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-11-19 07:00:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-19 07:00:23,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:00:23,495 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:00:23,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:23,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:00:23,699 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 07:00:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:00:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash 918686918, now seen corresponding path program 1 times [2022-11-19 07:00:23,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:00:23,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074110573] [2022-11-19 07:00:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:23,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:00:23,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:00:23,701 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:00:23,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-11-19 07:00:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:24,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-19 07:00:24,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:00:25,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:00:25,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:00:25,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:00:26,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:26,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 07:00:27,127 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:00:27,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 07:00:27,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:00:27,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:00:28,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:28,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 07:00:29,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:29,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 07:00:29,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:00:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:00:30,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:00:30,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-19 07:00:31,846 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2914 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2914) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_2914 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2914) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2022-11-19 07:00:42,853 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:00:42,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074110573] [2022-11-19 07:00:42,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074110573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:00:42,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [28883528] [2022-11-19 07:00:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:42,854 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:00:42,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:00:42,855 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:00:42,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (50)] Waiting until timeout for monitored process [2022-11-19 07:00:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:43,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-19 07:00:43,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:00:47,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:00:47,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:00:49,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:49,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 07:00:49,657 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:00:49,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 07:00:49,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:00:51,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:00:53,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:53,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 07:00:54,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:54,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 07:00:54,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:00:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:00:54,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:00:54,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-19 07:00:57,363 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2996 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2996) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) is different from false [2022-11-19 07:01:07,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [28883528] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:01:07,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433765715] [2022-11-19 07:01:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:01:07,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:01:07,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:01:07,095 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:01:07,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-11-19 07:01:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:01:07,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-19 07:01:07,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:01:12,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:01:15,476 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:01:15,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 07:01:15,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:01:19,673 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-19 07:01:19,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2022-11-19 07:01:19,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:01:19,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 07:01:19,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:01:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:01:19,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:01:19,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-19 07:01:28,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433765715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:01:28,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:01:28,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 56 [2022-11-19 07:01:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724769186] [2022-11-19 07:01:28,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:01:28,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-19 07:01:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:01:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-19 07:01:28,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=6045, Unknown=343, NotChecked=326, Total=7140 [2022-11-19 07:01:28,310 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 57 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 49 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-19 07:01:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:01:35,736 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-11-19 07:01:35,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-19 07:01:35,736 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 49 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 56 [2022-11-19 07:01:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:01:35,737 INFO L225 Difference]: With dead ends: 103 [2022-11-19 07:01:35,737 INFO L226 Difference]: Without dead ends: 103 [2022-11-19 07:01:35,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3100 ImplicationChecksByTransitivity, 59.2s TimeCoverageRelationStatistics Valid=545, Invalid=7482, Unknown=353, NotChecked=362, Total=8742 [2022-11-19 07:01:35,738 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 50 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:01:35,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 976 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 367 Invalid, 0 Unknown, 116 Unchecked, 2.3s Time] [2022-11-19 07:01:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-19 07:01:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2022-11-19 07:01:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 91 states have internal predecessors, (97), 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) [2022-11-19 07:01:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-11-19 07:01:35,743 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 56 [2022-11-19 07:01:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:01:35,743 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-11-19 07:01:35,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 49 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-19 07:01:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-11-19 07:01:35,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-19 07:01:35,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:01:35,759 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:01:35,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (50)] Forceful destruction successful, exit code 0 [2022-11-19 07:01:35,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2022-11-19 07:01:36,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-11-19 07:01:36,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:01:36,367 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-19 07:01:36,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:01:36,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1905133873, now seen corresponding path program 1 times [2022-11-19 07:01:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:01:36,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796284467] [2022-11-19 07:01:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:01:36,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:01:36,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:01:36,369 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:01:36,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2022-11-19 07:01:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:01:36,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-19 07:01:36,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:01:37,342 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 07:01:37,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:01:38,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:01:38,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-19 07:01:39,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-19 07:01:39,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:01:39,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 07:01:39,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:01:41,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:01:41,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-19 07:01:41,385 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-19 07:01:41,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-11-19 07:01:41,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-19 07:01:41,548 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:01:41,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 07:01:41,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:01:44,055 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:01:44,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2022-11-19 07:01:44,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:01:44,111 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 32 [2022-11-19 07:01:44,214 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-19 07:01:44,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-19 07:01:44,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:01:45,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:01:45,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-19 07:01:45,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-19 07:01:45,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:01:45,507 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-19 07:01:46,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-19 07:01:46,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:01:47,507 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-19 07:01:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:01:47,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:01:48,713 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3166) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3165) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3167) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-19 07:01:55,309 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3164 (_ BitVec 32)) (v_ArrVal_3167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (_ bv4 32)) v_ArrVal_3164)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3166) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_3163) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3165) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3167) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-19 07:02:06,730 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:02:06,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796284467] [2022-11-19 07:02:06,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796284467] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:02:06,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [92656758] [2022-11-19 07:02:06,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:02:06,731 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:02:06,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:02:06,732 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:02:06,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2022-11-19 07:02:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:02:07,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-19 07:02:07,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:02:08,399 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 07:02:08,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:02:10,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:02:10,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-19 07:02:12,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-19 07:02:12,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:02:12,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 07:02:12,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:02:13,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:02:13,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-19 07:02:13,378 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-19 07:02:13,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-11-19 07:02:13,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-19 07:02:13,527 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:02:13,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 07:02:13,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:02:18,355 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:02:18,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2022-11-19 07:02:18,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:02:18,415 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 32 [2022-11-19 07:02:18,521 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-19 07:02:18,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-19 07:02:18,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:02:20,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:02:20,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-19 07:02:20,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-19 07:02:20,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:02:20,220 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-19 07:02:21,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-19 07:02:21,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:02:22,136 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-19 07:02:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:02:22,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:02:22,279 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3264 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3264) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3263) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3265) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-19 07:02:28,755 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3261 (_ BitVec 32)) (v_ArrVal_3265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3264 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset|) v_ArrVal_3261)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3264) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_3262) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3263) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_3260) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3265) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-19 07:02:31,810 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3261 (_ BitVec 32)) (v_ArrVal_3265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3264 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)) v_ArrVal_3261)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_3264) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3262) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_3263) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3260) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_3265) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-19 07:02:35,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [92656758] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:02:35,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411969775] [2022-11-19 07:02:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:02:35,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:02:35,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:02:35,125 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:02:35,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0f6cc1-582e-4589-bf9a-2e4f5469394d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-11-19 07:02:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:02:35,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-19 07:02:35,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:02:35,544 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-19 07:02:36,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 07:02:36,692 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3347 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_3347) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-19 07:02:37,003 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 07:02:37,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 07:02:37,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-19 07:02:38,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:02:40,113 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:02:40,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 07:02:41,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:02:41,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-19 07:02:43,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-11-19 07:02:43,766 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2022-11-19 07:02:43,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:02:45,204 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:02:45,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 07:02:45,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:02:45,364 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:02:45,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-11-19 07:02:45,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:02:45,384 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-19 07:02:45,442 INFO L321 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-11-19 07:02:45,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-19 07:02:45,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-19 07:02:50,117 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:02:50,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2022-11-19 07:02:50,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:02:50,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-11-19 07:02:50,154 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-19 07:02:51,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:02:51,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-19 07:02:51,337 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-19 07:02:51,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:02:51,377 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-19 07:02:52,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-11-19 07:02:52,645 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-19 07:02:54,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:02:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 12 not checked. [2022-11-19 07:02:54,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:02:54,185 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3364) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3363) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false