./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:11:30,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:11:30,446 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:11:30,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:11:30,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:11:30,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:11:30,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:11:30,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:11:30,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:11:30,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:11:30,504 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:11:30,505 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:11:30,506 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:11:30,507 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:11:30,508 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:11:30,508 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:11:30,509 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:11:30,509 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:11:30,510 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:11:30,510 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:11:30,511 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:11:30,512 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:11:30,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:11:30,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:11:30,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:11:30,514 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:11:30,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:11:30,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:11:30,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:11:30,516 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:11:30,518 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:11:30,518 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:11:30,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:11:30,518 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:11:30,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:11:30,519 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:11:30,519 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:11:30,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:11:30,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:11:30,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:11:30,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:11:30,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:11:30,521 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:11:30,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:11:30,522 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:11:30,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:11:30,522 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/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_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2023-11-12 00:11:30,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:11:30,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:11:30,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:11:30,879 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:11:30,879 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:11:30,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/heap-manipulation/dancing.i [2023-11-12 00:11:34,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:11:34,345 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:11:34,347 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/sv-benchmarks/c/heap-manipulation/dancing.i [2023-11-12 00:11:34,369 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/data/d44b11d66/2bfe21e50ad24740b82a1c5e040eb0a0/FLAG1b271d874 [2023-11-12 00:11:34,382 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/data/d44b11d66/2bfe21e50ad24740b82a1c5e040eb0a0 [2023-11-12 00:11:34,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:11:34,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:11:34,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:11:34,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:11:34,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:11:34,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:34,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37651a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34, skipping insertion in model container [2023-11-12 00:11:34,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:34,450 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:11:34,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:11:34,847 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:11:34,908 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:11:34,941 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:11:34,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34 WrapperNode [2023-11-12 00:11:34,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:11:34,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:11:34,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:11:34,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:11:34,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:34,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:34,994 INFO L138 Inliner]: procedures = 124, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 101 [2023-11-12 00:11:34,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:11:34,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:11:34,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:11:34,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:11:35,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:35,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:35,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:35,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:35,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:35,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:35,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:35,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:35,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:11:35,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:11:35,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:11:35,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:11:35,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (1/1) ... [2023-11-12 00:11:35,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:11:35,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:35,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:11:35,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:11:35,109 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2023-11-12 00:11:35,110 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2023-11-12 00:11:35,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-12 00:11:35,110 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-12 00:11:35,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:11:35,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:11:35,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:11:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:11:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:11:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:11:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:11:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:11:35,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:11:35,285 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:11:35,295 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:11:35,792 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:11:35,873 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:11:35,873 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 00:11:35,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:11:35 BoogieIcfgContainer [2023-11-12 00:11:35,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:11:35,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:11:35,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:11:35,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:11:35,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:11:34" (1/3) ... [2023-11-12 00:11:35,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605ce75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:11:35, skipping insertion in model container [2023-11-12 00:11:35,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:34" (2/3) ... [2023-11-12 00:11:35,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605ce75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:11:35, skipping insertion in model container [2023-11-12 00:11:35,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:11:35" (3/3) ... [2023-11-12 00:11:35,888 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2023-11-12 00:11:35,908 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:11:35,908 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-12 00:11:35,957 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:11:35,965 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;@995b101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:11:35,965 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2023-11-12 00:11:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 92 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:11:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-12 00:11:35,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:35,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-12 00:11:35,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:11:35,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash 7103, now seen corresponding path program 1 times [2023-11-12 00:11:35,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:35,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917846118] [2023-11-12 00:11:35,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:35,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:36,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:36,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917846118] [2023-11-12 00:11:36,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917846118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:36,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:36,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:11:36,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401701671] [2023-11-12 00:11:36,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:36,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:11:36,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:36,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:11:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:11:36,296 INFO L87 Difference]: Start difference. First operand has 101 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 92 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:36,491 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2023-11-12 00:11:36,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:11:36,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-12 00:11:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:36,509 INFO L225 Difference]: With dead ends: 98 [2023-11-12 00:11:36,509 INFO L226 Difference]: Without dead ends: 97 [2023-11-12 00:11:36,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:11:36,518 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:36,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 81 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:36,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-12 00:11:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-12 00:11:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 88 states have internal predecessors, (97), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:11:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2023-11-12 00:11:36,589 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 2 [2023-11-12 00:11:36,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:36,590 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2023-11-12 00:11:36,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2023-11-12 00:11:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-12 00:11:36,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:36,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-12 00:11:36,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:11:36,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:11:36,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash 7104, now seen corresponding path program 1 times [2023-11-12 00:11:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:36,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336973167] [2023-11-12 00:11:36,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:36,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:36,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:36,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336973167] [2023-11-12 00:11:36,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336973167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:36,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:36,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:11:36,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66990817] [2023-11-12 00:11:36,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:36,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:11:36,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:36,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:11:36,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:11:36,740 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:36,853 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2023-11-12 00:11:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:11:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-12 00:11:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:36,861 INFO L225 Difference]: With dead ends: 95 [2023-11-12 00:11:36,861 INFO L226 Difference]: Without dead ends: 95 [2023-11-12 00:11:36,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:11:36,869 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:36,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 82 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-12 00:11:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-12 00:11:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 47 states have (on average 2.021276595744681) internal successors, (95), 86 states have internal predecessors, (95), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:11:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2023-11-12 00:11:36,887 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 2 [2023-11-12 00:11:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:36,887 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2023-11-12 00:11:36,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2023-11-12 00:11:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:11:36,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:36,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:36,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:11:36,889 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:11:36,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:36,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1638519625, now seen corresponding path program 1 times [2023-11-12 00:11:36,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:36,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4448409] [2023-11-12 00:11:36,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:36,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:37,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4448409] [2023-11-12 00:11:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4448409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:37,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:37,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:11:37,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887445055] [2023-11-12 00:11:37,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:37,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:11:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:37,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:11:37,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:11:37,030 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:37,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:37,188 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2023-11-12 00:11:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:11:37,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 00:11:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:37,194 INFO L225 Difference]: With dead ends: 151 [2023-11-12 00:11:37,195 INFO L226 Difference]: Without dead ends: 151 [2023-11-12 00:11:37,196 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 [2023-11-12 00:11:37,202 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:37,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 183 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-12 00:11:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 93. [2023-11-12 00:11:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 84 states have internal predecessors, (93), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:11:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2023-11-12 00:11:37,221 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 7 [2023-11-12 00:11:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:37,221 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2023-11-12 00:11:37,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2023-11-12 00:11:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:11:37,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:37,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:37,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:11:37,223 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:11:37,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:37,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1638519626, now seen corresponding path program 1 times [2023-11-12 00:11:37,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:37,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771186908] [2023-11-12 00:11:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:37,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:37,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771186908] [2023-11-12 00:11:37,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771186908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:37,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:37,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:11:37,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248705371] [2023-11-12 00:11:37,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:37,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:11:37,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:37,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:11:37,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:11:37,331 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:37,486 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2023-11-12 00:11:37,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:11:37,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 00:11:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:37,489 INFO L225 Difference]: With dead ends: 151 [2023-11-12 00:11:37,489 INFO L226 Difference]: Without dead ends: 151 [2023-11-12 00:11:37,489 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 [2023-11-12 00:11:37,490 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:37,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 187 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-12 00:11:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 91. [2023-11-12 00:11:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 82 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:11:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2023-11-12 00:11:37,501 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 7 [2023-11-12 00:11:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:37,502 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2023-11-12 00:11:37,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2023-11-12 00:11:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:11:37,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:37,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:37,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:11:37,504 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:11:37,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1632720510, now seen corresponding path program 1 times [2023-11-12 00:11:37,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:37,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540362096] [2023-11-12 00:11:37,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:37,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:37,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:37,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540362096] [2023-11-12 00:11:37,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540362096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:37,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:37,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:11:37,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367270410] [2023-11-12 00:11:37,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:37,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:11:37,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:37,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:11:37,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:11:37,674 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-11-12 00:11:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:37,800 INFO L93 Difference]: Finished difference Result 163 states and 189 transitions. [2023-11-12 00:11:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:11:37,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2023-11-12 00:11:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:37,804 INFO L225 Difference]: With dead ends: 163 [2023-11-12 00:11:37,804 INFO L226 Difference]: Without dead ends: 163 [2023-11-12 00:11:37,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:11:37,805 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 70 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:37,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 336 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:37,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-12 00:11:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2023-11-12 00:11:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 2.0259740259740258) internal successors, (156), 113 states have internal predecessors, (156), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 00:11:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 176 transitions. [2023-11-12 00:11:37,842 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 176 transitions. Word has length 9 [2023-11-12 00:11:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:37,843 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 176 transitions. [2023-11-12 00:11:37,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-11-12 00:11:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 176 transitions. [2023-11-12 00:11:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:11:37,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:37,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:37,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:11:37,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:11:37,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1635638068, now seen corresponding path program 1 times [2023-11-12 00:11:37,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:37,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470206009] [2023-11-12 00:11:37,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:37,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:38,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:38,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470206009] [2023-11-12 00:11:38,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470206009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:38,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:38,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:11:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539439901] [2023-11-12 00:11:38,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:38,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:11:38,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:38,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:11:38,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:11:38,023 INFO L87 Difference]: Start difference. First operand 126 states and 176 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:38,161 INFO L93 Difference]: Finished difference Result 125 states and 175 transitions. [2023-11-12 00:11:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:11:38,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-12 00:11:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:38,163 INFO L225 Difference]: With dead ends: 125 [2023-11-12 00:11:38,167 INFO L226 Difference]: Without dead ends: 125 [2023-11-12 00:11:38,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:11:38,170 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 128 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:38,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 110 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-12 00:11:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-12 00:11:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 77 states have (on average 2.012987012987013) internal successors, (155), 112 states have internal predecessors, (155), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 00:11:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2023-11-12 00:11:38,181 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 9 [2023-11-12 00:11:38,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:38,181 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2023-11-12 00:11:38,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2023-11-12 00:11:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:11:38,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:38,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:38,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:11:38,183 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:11:38,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1635638067, now seen corresponding path program 1 times [2023-11-12 00:11:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:38,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57251752] [2023-11-12 00:11:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:38,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:38,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57251752] [2023-11-12 00:11:38,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57251752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:38,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:38,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:11:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493099565] [2023-11-12 00:11:38,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:38,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:11:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:38,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:11:38,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:11:38,391 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:38,515 INFO L93 Difference]: Finished difference Result 124 states and 174 transitions. [2023-11-12 00:11:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:11:38,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-12 00:11:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:38,517 INFO L225 Difference]: With dead ends: 124 [2023-11-12 00:11:38,517 INFO L226 Difference]: Without dead ends: 124 [2023-11-12 00:11:38,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:11:38,519 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 127 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:38,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 95 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-12 00:11:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-12 00:11:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 2.0) internal successors, (154), 111 states have internal predecessors, (154), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 00:11:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 174 transitions. [2023-11-12 00:11:38,530 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 174 transitions. Word has length 9 [2023-11-12 00:11:38,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:38,531 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 174 transitions. [2023-11-12 00:11:38,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 174 transitions. [2023-11-12 00:11:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:11:38,532 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:38,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:38,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:11:38,533 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:11:38,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash 127498352, now seen corresponding path program 1 times [2023-11-12 00:11:38,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:38,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965649040] [2023-11-12 00:11:38,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:38,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:38,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:38,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965649040] [2023-11-12 00:11:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965649040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:38,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:11:38,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712106851] [2023-11-12 00:11:38,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:38,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:11:38,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:38,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:11:38,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:11:38,624 INFO L87 Difference]: Start difference. First operand 124 states and 174 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2023-11-12 00:11:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:39,007 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2023-11-12 00:11:39,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:11:39,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2023-11-12 00:11:39,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:39,009 INFO L225 Difference]: With dead ends: 146 [2023-11-12 00:11:39,009 INFO L226 Difference]: Without dead ends: 146 [2023-11-12 00:11:39,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:11:39,012 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 212 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:39,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 171 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:11:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-12 00:11:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2023-11-12 00:11:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.8571428571428572) internal successors, (143), 106 states have internal predecessors, (143), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 00:11:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 163 transitions. [2023-11-12 00:11:39,020 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 163 transitions. Word has length 12 [2023-11-12 00:11:39,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:39,020 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 163 transitions. [2023-11-12 00:11:39,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2023-11-12 00:11:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2023-11-12 00:11:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:11:39,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:39,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:39,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:11:39,022 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:11:39,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:39,022 INFO L85 PathProgramCache]: Analyzing trace with hash 127498353, now seen corresponding path program 1 times [2023-11-12 00:11:39,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:39,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133800362] [2023-11-12 00:11:39,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:39,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:39,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:39,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133800362] [2023-11-12 00:11:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133800362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:39,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:39,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:11:39,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880116829] [2023-11-12 00:11:39,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:39,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:11:39,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:39,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:11:39,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:11:39,211 INFO L87 Difference]: Start difference. First operand 119 states and 163 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2023-11-12 00:11:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:39,509 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2023-11-12 00:11:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:11:39,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2023-11-12 00:11:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:39,511 INFO L225 Difference]: With dead ends: 142 [2023-11-12 00:11:39,512 INFO L226 Difference]: Without dead ends: 142 [2023-11-12 00:11:39,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:11:39,513 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 179 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:39,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 198 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:11:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-12 00:11:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 119. [2023-11-12 00:11:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.7792207792207793) internal successors, (137), 106 states have internal predecessors, (137), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 00:11:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2023-11-12 00:11:39,520 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 12 [2023-11-12 00:11:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:39,521 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2023-11-12 00:11:39,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2023-11-12 00:11:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2023-11-12 00:11:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:11:39,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:39,522 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:39,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:11:39,523 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:11:39,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash 733959799, now seen corresponding path program 1 times [2023-11-12 00:11:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:39,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756814802] [2023-11-12 00:11:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:39,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756814802] [2023-11-12 00:11:39,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756814802] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638845296] [2023-11-12 00:11:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:39,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:39,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:39,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:11:39,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:11:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:39,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 00:11:39,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:11:39,794 INFO L351 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 [2023-11-12 00:11:39,841 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:11:39,841 INFO L351 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 14 [2023-11-12 00:11:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:11:39,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:11:39,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638845296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:39,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:11:39,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-11-12 00:11:39,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930093988] [2023-11-12 00:11:39,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:39,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:11:39,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:39,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:11:39,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:11:39,888 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-11-12 00:11:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:40,084 INFO L93 Difference]: Finished difference Result 131 states and 172 transitions. [2023-11-12 00:11:40,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:11:40,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2023-11-12 00:11:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:40,087 INFO L225 Difference]: With dead ends: 131 [2023-11-12 00:11:40,087 INFO L226 Difference]: Without dead ends: 131 [2023-11-12 00:11:40,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:11:40,088 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:40,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 141 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:11:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-12 00:11:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2023-11-12 00:11:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.75) internal successors, (147), 112 states have internal predecessors, (147), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-12 00:11:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 169 transitions. [2023-11-12 00:11:40,094 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 169 transitions. Word has length 15 [2023-11-12 00:11:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:40,095 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 169 transitions. [2023-11-12 00:11:40,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-11-12 00:11:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 169 transitions. [2023-11-12 00:11:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:11:40,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:40,096 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:40,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:11:40,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:11:40,307 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:11:40,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:40,308 INFO L85 PathProgramCache]: Analyzing trace with hash 733959800, now seen corresponding path program 1 times [2023-11-12 00:11:40,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:40,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420181064] [2023-11-12 00:11:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:40,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:40,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:40,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420181064] [2023-11-12 00:11:40,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420181064] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:40,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917766157] [2023-11-12 00:11:40,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:40,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:40,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:40,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:11:40,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:11:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:40,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-12 00:11:40,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:11:40,694 INFO L351 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 8 treesize of output 1 [2023-11-12 00:11:40,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:40,778 INFO L351 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 9 [2023-11-12 00:11:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:40,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:11:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:41,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917766157] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:11:41,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [169590595] [2023-11-12 00:11:41,084 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:11:41,084 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:11:41,089 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:11:41,095 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:11:41,095 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:11:47,692 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 174 for LOIs [2023-11-12 00:11:47,994 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:11:59,088 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2744#(and (or (not (= is_list_containing_x_~x.offset is_list_containing_x_~l.offset)) (not (= is_list_containing_x_~l.base is_list_containing_x_~x.base))) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_17| Int)) (= (mod |v_ULTIMATE.start_main_#t~nondet16#1_17| 256) 0)) (= |is_list_containing_x_#in~x.offset| is_list_containing_x_~x.offset) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (exists ((|v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1| Int)) (and (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) (store (select |v_#memory_$Pointer$.base_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4) 0)) |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1| (store (select (store |v_#memory_$Pointer$.base_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) (store (select |v_#memory_$Pointer$.base_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4) 0)) |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)))) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_36| Int) (|v_ULTIMATE.start_main_#t~nondet18#1_19| Int) (|v_ULTIMATE.start_main_~x~0#1.base_36| Int)) (and (<= 1 |#StackHeapBarrier|) (or (and (= (mod |v_ULTIMATE.start_main_#t~nondet18#1_19| 256) 0) (= |is_list_containing_x_#in~x.base| |v_ULTIMATE.start_main_~x~0#1.base_36|) (= |is_list_containing_x_#in~x.offset| |v_ULTIMATE.start_main_~x~0#1.offset_36|)) (and (not (= (mod |v_ULTIMATE.start_main_#t~nondet18#1_19| 256) 0)) (= |is_list_containing_x_#in~x.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) 4)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) 4) |is_list_containing_x_#in~x.base|))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) 4) 0) (<= 2 |is_list_containing_x_#in~l.base|) (= |is_list_containing_x_#in~l.offset| 0) (<= 2 |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (= |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 0))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4)) (exists ((|v_#memory_int_64| (Array Int (Array Int Int))) (|v_#memory_int_65| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_65| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1| (store (select |v_#memory_int_65| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))))) (= |v_#memory_int_65| (store |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) (store (select |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4) (select (select |v_#memory_int_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4))))))) (= 1 (select |#valid| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|)) (<= (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 8) (select |#length| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|)) (<= 0 (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) (store (select |v_#memory_$Pointer$.offset_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4) 0)) |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1| (store (select (store |v_#memory_$Pointer$.offset_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) (store (select |v_#memory_$Pointer$.offset_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4) 0)) |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)))))))) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset) (or (< (+ is_list_containing_x_~l.offset 4) 0) (< (select |#length| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 8))) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|))' at error location [2023-11-12 00:11:59,088 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:11:59,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:11:59,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2023-11-12 00:11:59,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095560892] [2023-11-12 00:11:59,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:11:59,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 00:11:59,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:59,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 00:11:59,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=425, Unknown=4, NotChecked=0, Total=506 [2023-11-12 00:11:59,091 INFO L87 Difference]: Start difference. First operand 127 states and 169 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:59,779 INFO L93 Difference]: Finished difference Result 128 states and 169 transitions. [2023-11-12 00:11:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:11:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-12 00:11:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:59,782 INFO L225 Difference]: With dead ends: 128 [2023-11-12 00:11:59,782 INFO L226 Difference]: Without dead ends: 128 [2023-11-12 00:11:59,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=91, Invalid=505, Unknown=4, NotChecked=0, Total=600 [2023-11-12 00:11:59,783 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 141 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:59,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 222 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:11:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-12 00:11:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2023-11-12 00:11:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.7142857142857142) internal successors, (144), 111 states have internal predecessors, (144), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-12 00:11:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 166 transitions. [2023-11-12 00:11:59,791 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 166 transitions. Word has length 15 [2023-11-12 00:11:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:59,792 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 166 transitions. [2023-11-12 00:11:59,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:11:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 166 transitions. [2023-11-12 00:11:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:11:59,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:59,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:59,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:12:00,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-12 00:12:00,000 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:12:00,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:00,001 INFO L85 PathProgramCache]: Analyzing trace with hash 878011380, now seen corresponding path program 1 times [2023-11-12 00:12:00,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:00,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105145706] [2023-11-12 00:12:00,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:00,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:00,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:00,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105145706] [2023-11-12 00:12:00,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105145706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:12:00,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:12:00,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:12:00,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590432545] [2023-11-12 00:12:00,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:12:00,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:12:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:00,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:12:00,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:12:00,369 INFO L87 Difference]: Start difference. First operand 126 states and 166 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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) [2023-11-12 00:12:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:00,893 INFO L93 Difference]: Finished difference Result 158 states and 199 transitions. [2023-11-12 00:12:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:12:00,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 16 [2023-11-12 00:12:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:00,895 INFO L225 Difference]: With dead ends: 158 [2023-11-12 00:12:00,895 INFO L226 Difference]: Without dead ends: 158 [2023-11-12 00:12:00,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:12:00,896 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:00,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 328 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:12:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-12 00:12:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 123. [2023-11-12 00:12:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 108 states have internal predecessors, (138), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-12 00:12:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 160 transitions. [2023-11-12 00:12:00,905 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 160 transitions. Word has length 16 [2023-11-12 00:12:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:00,905 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 160 transitions. [2023-11-12 00:12:00,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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) [2023-11-12 00:12:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 160 transitions. [2023-11-12 00:12:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:12:00,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:00,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:00,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:12:00,907 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:12:00,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1983604522, now seen corresponding path program 1 times [2023-11-12 00:12:00,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:00,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810233537] [2023-11-12 00:12:00,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:00,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:01,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:01,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810233537] [2023-11-12 00:12:01,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810233537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:12:01,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:12:01,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:12:01,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822258969] [2023-11-12 00:12:01,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:12:01,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:12:01,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:01,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:12:01,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:12:01,269 INFO L87 Difference]: Start difference. First operand 123 states and 160 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-11-12 00:12:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:01,783 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2023-11-12 00:12:01,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:12:01,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 18 [2023-11-12 00:12:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:01,785 INFO L225 Difference]: With dead ends: 143 [2023-11-12 00:12:01,785 INFO L226 Difference]: Without dead ends: 143 [2023-11-12 00:12:01,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:12:01,786 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 38 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:01,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 405 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:12:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-12 00:12:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 120. [2023-11-12 00:12:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 105 states have internal predecessors, (132), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-12 00:12:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2023-11-12 00:12:01,793 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 18 [2023-11-12 00:12:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:01,793 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2023-11-12 00:12:01,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-11-12 00:12:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2023-11-12 00:12:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:12:01,795 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:01,795 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:01,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 00:12:01,795 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:12:01,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:01,796 INFO L85 PathProgramCache]: Analyzing trace with hash -282547365, now seen corresponding path program 1 times [2023-11-12 00:12:01,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:01,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005321616] [2023-11-12 00:12:01,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:01,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:01,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:01,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005321616] [2023-11-12 00:12:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005321616] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:12:01,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243394506] [2023-11-12 00:12:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:01,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:12:01,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:12:01,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:12:01,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:12:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:02,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-12 00:12:02,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:12:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:02,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:12:02,572 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 00:12:02,572 INFO L351 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 12 treesize of output 11 [2023-11-12 00:12:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243394506] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:12:02,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [247665737] [2023-11-12 00:12:02,608 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:12:02,609 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:12:02,609 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:12:02,609 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:12:02,609 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:12:03,185 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 22 for LOIs [2023-11-12 00:12:03,208 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:12:05,688 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3694#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| 0) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_23| Int)) (= (mod |v_ULTIMATE.start_main_#t~nondet16#1_23| 256) 0)) (= |ULTIMATE.start_remove_#in~x#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1)) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|))' at error location [2023-11-12 00:12:05,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:12:05,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:12:05,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2023-11-12 00:12:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719592875] [2023-11-12 00:12:05,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:12:05,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-12 00:12:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:05,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 00:12:05,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=556, Unknown=2, NotChecked=0, Total=650 [2023-11-12 00:12:05,691 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:12:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:06,968 INFO L93 Difference]: Finished difference Result 187 states and 238 transitions. [2023-11-12 00:12:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 00:12:06,969 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2023-11-12 00:12:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:06,971 INFO L225 Difference]: With dead ends: 187 [2023-11-12 00:12:06,971 INFO L226 Difference]: Without dead ends: 187 [2023-11-12 00:12:06,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=146, Invalid=908, Unknown=2, NotChecked=0, Total=1056 [2023-11-12 00:12:06,973 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 384 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:06,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 312 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-12 00:12:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-12 00:12:06,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 158. [2023-11-12 00:12:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 110 states have (on average 1.7545454545454546) internal successors, (193), 138 states have internal predecessors, (193), 15 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-12 00:12:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 228 transitions. [2023-11-12 00:12:06,983 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 228 transitions. Word has length 18 [2023-11-12 00:12:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:06,983 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 228 transitions. [2023-11-12 00:12:06,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:12:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 228 transitions. [2023-11-12 00:12:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:12:06,984 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:06,985 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:06,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-12 00:12:07,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-12 00:12:07,192 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:12:07,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash -282547364, now seen corresponding path program 1 times [2023-11-12 00:12:07,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:07,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409313690] [2023-11-12 00:12:07,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:07,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:07,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409313690] [2023-11-12 00:12:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409313690] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:12:07,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915210517] [2023-11-12 00:12:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:07,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:12:07,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:12:07,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:12:07,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:12:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:07,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-12 00:12:07,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:12:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:08,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:12:08,700 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:12:08,701 INFO L351 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 21 treesize of output 25 [2023-11-12 00:12:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915210517] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:12:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1598715701] [2023-11-12 00:12:08,854 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:12:08,854 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:12:08,855 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:12:08,855 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:12:08,855 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:12:09,281 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 22 for LOIs [2023-11-12 00:12:09,303 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:12:12,127 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4193#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_29| Int)) (= (mod |v_ULTIMATE.start_main_#t~nondet16#1_29| 256) 0)) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.offset| 0) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|) (<= (select |#length| |ULTIMATE.start_remove_~x#1.base|) 7))' at error location [2023-11-12 00:12:12,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:12:12,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:12:12,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-11-12 00:12:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890277369] [2023-11-12 00:12:12,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:12:12,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-12 00:12:12,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:12,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 00:12:12,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1152, Unknown=2, NotChecked=0, Total=1332 [2023-11-12 00:12:12,130 INFO L87 Difference]: Start difference. First operand 158 states and 228 transitions. Second operand has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 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) [2023-11-12 00:12:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:14,041 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2023-11-12 00:12:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 00:12:14,041 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 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) Word has length 18 [2023-11-12 00:12:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:14,043 INFO L225 Difference]: With dead ends: 181 [2023-11-12 00:12:14,043 INFO L226 Difference]: Without dead ends: 181 [2023-11-12 00:12:14,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=283, Invalid=1695, Unknown=2, NotChecked=0, Total=1980 [2023-11-12 00:12:14,045 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 720 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:14,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 447 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-12 00:12:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-12 00:12:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 156. [2023-11-12 00:12:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 111 states have (on average 1.6666666666666667) internal successors, (185), 136 states have internal predecessors, (185), 15 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-12 00:12:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2023-11-12 00:12:14,054 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 18 [2023-11-12 00:12:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:14,054 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2023-11-12 00:12:14,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 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) [2023-11-12 00:12:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2023-11-12 00:12:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:12:14,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:14,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:14,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:12:14,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-12 00:12:14,262 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:12:14,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash -395425206, now seen corresponding path program 1 times [2023-11-12 00:12:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:14,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451253214] [2023-11-12 00:12:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:14,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:14,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:14,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451253214] [2023-11-12 00:12:14,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451253214] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:12:14,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071329846] [2023-11-12 00:12:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:14,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:12:14,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:12:14,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:12:14,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:12:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:14,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-12 00:12:14,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:12:14,925 INFO L351 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 [2023-11-12 00:12:15,021 INFO L351 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 [2023-11-12 00:12:15,157 INFO L351 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 9 [2023-11-12 00:12:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:15,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:12:15,229 INFO L351 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 28 [2023-11-12 00:12:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071329846] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:12:15,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [700992782] [2023-11-12 00:12:15,444 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:12:15,444 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:12:15,445 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:337) 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:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-12 00:12:15,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:12:15,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2023-11-12 00:12:15,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175575637] [2023-11-12 00:12:15,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:12:15,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 00:12:15,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:15,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 00:12:15,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-12 00:12:15,451 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:12:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:17,686 INFO L93 Difference]: Finished difference Result 404 states and 600 transitions. [2023-11-12 00:12:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 00:12:17,687 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-12 00:12:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:17,690 INFO L225 Difference]: With dead ends: 404 [2023-11-12 00:12:17,691 INFO L226 Difference]: Without dead ends: 404 [2023-11-12 00:12:17,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-11-12 00:12:17,692 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 336 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:17,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1009 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-12 00:12:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-11-12 00:12:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 179. [2023-11-12 00:12:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 127 states have (on average 1.5905511811023623) internal successors, (202), 153 states have internal predecessors, (202), 20 states have call successors, (20), 7 states have call predecessors, (20), 8 states have return successors, (25), 18 states have call predecessors, (25), 20 states have call successors, (25) [2023-11-12 00:12:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 247 transitions. [2023-11-12 00:12:17,708 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 247 transitions. Word has length 21 [2023-11-12 00:12:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:17,708 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 247 transitions. [2023-11-12 00:12:17,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:12:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 247 transitions. [2023-11-12 00:12:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:12:17,710 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:17,710 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:17,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:12:17,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-12 00:12:17,916 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-12 00:12:17,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:17,916 INFO L85 PathProgramCache]: Analyzing trace with hash -395425205, now seen corresponding path program 1 times [2023-11-12 00:12:17,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:17,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084621229] [2023-11-12 00:12:17,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:17,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:18,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:18,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084621229] [2023-11-12 00:12:18,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084621229] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:12:18,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931735700] [2023-11-12 00:12:18,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:18,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:12:18,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:12:18,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:12:18,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bcdbf4-4bd0-4dc2-8117-1612773fcf96/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:12:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:18,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-12 00:12:18,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:12:18,983 INFO L351 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 [2023-11-12 00:12:18,994 INFO L351 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 [2023-11-12 00:12:19,271 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:12:19,272 INFO L351 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 16 treesize of output 15 [2023-11-12 00:12:19,322 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:12:19,323 INFO L351 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 16 treesize of output 15 [2023-11-12 00:12:19,462 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:12:19,462 INFO L351 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 20 treesize of output 19 [2023-11-12 00:12:19,516 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:12:19,516 INFO L351 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 20 treesize of output 19 [2023-11-12 00:12:19,594 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:12:19,594 INFO L351 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 34 [2023-11-12 00:12:19,634 INFO L322 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-12 00:12:19,634 INFO L351 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 25 [2023-11-12 00:12:21,906 INFO L351 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 23 treesize of output 11 [2023-11-12 00:12:21,920 INFO L351 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 [2023-11-12 00:12:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:12:22,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:12:26,658 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse0 0) (= |ULTIMATE.start_main_~n~0#1.base| .cse0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= |c_ULTIMATE.start_main_~n~0#1.offset| (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse9 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse9 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int))) (let ((.cse11 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse11 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse11)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse14 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))))))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= |ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2)) (= (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int))) (let ((.cse19 (select (select (let ((.cse20 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~n~0#1.offset| .cse19) (= .cse19 0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse22 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= |ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse22 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2)) (= (select (select (let ((.cse23 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse22 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse24 (select (select (let ((.cse25 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse24 0) (= |ULTIMATE.start_main_~n~0#1.base| .cse24)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse27 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse26 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= |c_ULTIMATE.start_main_~n~0#1.offset| (select (select (let ((.cse28 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int))) (let ((.cse29 (select (select (let ((.cse30 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~n~0#1.offset| .cse29) (= .cse29 0))))) (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|)))) is different from false [2023-11-12 00:12:27,153 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse0 0) (= |ULTIMATE.start_main_~n~0#1.base| .cse0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= |ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse9 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse9 0) (= |ULTIMATE.start_main_~n~0#1.base| .cse9)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse12 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= |ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int))) (= (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse16 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int))) (let ((.cse18 (select (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse18) (= .cse18 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse20 (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse20 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse23 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse22 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse26 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (let ((.cse25 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2)) (= (select (select (let ((.cse27 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0))))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int))) (= (select (select (let ((.cse28 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false