./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:06:21,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:06:21,292 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-06 21:06:21,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:06:21,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:06:21,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:06:21,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:06:21,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:06:21,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:06:21,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:06:21,353 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 21:06:21,354 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 21:06:21,354 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 21:06:21,356 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 21:06:21,356 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 21:06:21,357 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 21:06:21,357 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 21:06:21,358 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 21:06:21,358 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 21:06:21,359 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 21:06:21,359 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 21:06:21,360 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 21:06:21,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:06:21,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:06:21,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:06:21,362 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:06:21,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:06:21,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:06:21,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:06:21,386 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:06:21,386 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:06:21,387 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:06:21,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:06:21,387 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:06:21,388 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:06:21,388 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:06:21,388 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:06:21,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:06:21,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:06:21,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:06:21,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:06:21,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:06:21,391 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 21:06:21,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:06:21,391 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 21:06:21,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:06:21,392 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_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/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_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2023-11-06 21:06:21,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:06:21,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:06:21,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:06:21,681 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:06:21,682 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:06:21,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2023-11-06 21:06:24,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:06:25,212 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:06:25,217 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2023-11-06 21:06:25,233 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/data/6814fb18c/3ed8e943929747be9f1667470a9b15b3/FLAG671653e5c [2023-11-06 21:06:25,248 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/data/6814fb18c/3ed8e943929747be9f1667470a9b15b3 [2023-11-06 21:06:25,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:06:25,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:06:25,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:06:25,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:06:25,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:06:25,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7deee318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25, skipping insertion in model container [2023-11-06 21:06:25,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,309 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:06:25,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:06:25,657 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:06:25,725 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:06:25,766 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:06:25,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25 WrapperNode [2023-11-06 21:06:25,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:06:25,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:06:25,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:06:25,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:06:25,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,833 INFO L138 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2023-11-06 21:06:25,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:06:25,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:06:25,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:06:25,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:06:25,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:06:25,903 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:06:25,903 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:06:25,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:06:25,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (1/1) ... [2023-11-06 21:06:25,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:06:25,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:06:25,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:06:25,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:06:25,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:06:25,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:06:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 21:06:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:06:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:06:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:06:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:06:25,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:06:26,138 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:06:26,141 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:06:26,450 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:06:26,505 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:06:26,508 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 21:06:26,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:06:26 BoogieIcfgContainer [2023-11-06 21:06:26,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:06:26,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:06:26,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:06:26,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:06:26,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:06:25" (1/3) ... [2023-11-06 21:06:26,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557da43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:06:26, skipping insertion in model container [2023-11-06 21:06:26,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:25" (2/3) ... [2023-11-06 21:06:26,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557da43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:06:26, skipping insertion in model container [2023-11-06 21:06:26,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:06:26" (3/3) ... [2023-11-06 21:06:26,527 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2023-11-06 21:06:26,549 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:06:26,550 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-11-06 21:06:26,604 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:06:26,615 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;@4d543eaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 21:06:26,616 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-11-06 21:06:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 51 states have internal predecessors, (56), 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-06 21:06:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-06 21:06:26,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:26,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-06 21:06:26,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:26,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 3879, now seen corresponding path program 1 times [2023-11-06 21:06:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:26,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362643305] [2023-11-06 21:06:26,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:26,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:26,842 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-06 21:06:26,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362643305] [2023-11-06 21:06:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362643305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:26,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:26,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:06:26,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174518266] [2023-11-06 21:06:26,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:26,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:06:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:26,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:06:26,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:06:26,929 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:27,109 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-11-06 21:06:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:06:27,112 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-06 21:06:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:27,120 INFO L225 Difference]: With dead ends: 53 [2023-11-06 21:06:27,125 INFO L226 Difference]: Without dead ends: 52 [2023-11-06 21:06:27,127 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-06 21:06:27,130 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:27,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 20 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:06:27,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-06 21:06:27,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2023-11-06 21:06:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 46 states have internal predecessors, (52), 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-06 21:06:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2023-11-06 21:06:27,168 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 2 [2023-11-06 21:06:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:27,169 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2023-11-06 21:06:27,169 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-06 21:06:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2023-11-06 21:06:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-06 21:06:27,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:27,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-06 21:06:27,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:06:27,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:27,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash 3880, now seen corresponding path program 1 times [2023-11-06 21:06:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:27,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782057861] [2023-11-06 21:06:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:27,336 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-06 21:06:27,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:27,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782057861] [2023-11-06 21:06:27,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782057861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:27,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:27,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:06:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081800797] [2023-11-06 21:06:27,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:27,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:06:27,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:27,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:06:27,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:06:27,340 INFO L87 Difference]: Start difference. First operand 47 states and 52 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-06 21:06:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:27,426 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-11-06 21:06:27,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:06:27,427 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-06 21:06:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:27,429 INFO L225 Difference]: With dead ends: 48 [2023-11-06 21:06:27,429 INFO L226 Difference]: Without dead ends: 48 [2023-11-06 21:06:27,429 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-06 21:06:27,431 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:27,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 39 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:06:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-06 21:06:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2023-11-06 21:06:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 41 states have internal predecessors, (47), 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-06 21:06:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2023-11-06 21:06:27,440 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 2 [2023-11-06 21:06:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:27,440 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2023-11-06 21:06:27,440 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-06 21:06:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2023-11-06 21:06:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 21:06:27,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:27,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:27,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:06:27,442 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:27,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:27,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1730509016, now seen corresponding path program 1 times [2023-11-06 21:06:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:27,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371091422] [2023-11-06 21:06:27,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:27,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:27,576 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-06 21:06:27,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:27,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371091422] [2023-11-06 21:06:27,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371091422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:27,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:27,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:06:27,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824215841] [2023-11-06 21:06:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:27,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:06:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:06:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:06:27,581 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:27,726 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2023-11-06 21:06:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:06:27,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 21:06:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:27,730 INFO L225 Difference]: With dead ends: 69 [2023-11-06 21:06:27,730 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 21:06:27,731 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-06 21:06:27,732 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 50 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:27,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 34 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:06:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 21:06:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 43. [2023-11-06 21:06:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 42 states have internal predecessors, (48), 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-06 21:06:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-11-06 21:06:27,742 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 8 [2023-11-06 21:06:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:27,743 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-11-06 21:06:27,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-11-06 21:06:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 21:06:27,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:27,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:27,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:06:27,745 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:27,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:27,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1730507620, now seen corresponding path program 1 times [2023-11-06 21:06:27,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:27,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597160364] [2023-11-06 21:06:27,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:27,865 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-06 21:06:27,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:27,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597160364] [2023-11-06 21:06:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597160364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:27,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:27,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:06:27,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054706573] [2023-11-06 21:06:27,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:27,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:06:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:27,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:06:27,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:06:27,869 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:27,959 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2023-11-06 21:06:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:06:27,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 21:06:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:27,961 INFO L225 Difference]: With dead ends: 48 [2023-11-06 21:06:27,961 INFO L226 Difference]: Without dead ends: 48 [2023-11-06 21:06:27,961 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-06 21:06:27,963 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:27,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 22 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:06:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-06 21:06:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2023-11-06 21:06:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.7) internal successors, (51), 43 states have internal predecessors, (51), 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-06 21:06:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-11-06 21:06:27,971 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 8 [2023-11-06 21:06:27,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:27,971 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-11-06 21:06:27,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-11-06 21:06:27,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 21:06:27,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:27,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:27,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:06:27,973 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:27,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1730507621, now seen corresponding path program 1 times [2023-11-06 21:06:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:27,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137226487] [2023-11-06 21:06:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:28,179 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-06 21:06:28,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:28,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137226487] [2023-11-06 21:06:28,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137226487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:28,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:28,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:06:28,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411165082] [2023-11-06 21:06:28,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:28,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:06:28,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:28,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:06:28,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:06:28,188 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:28,328 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2023-11-06 21:06:28,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:06:28,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 21:06:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:28,332 INFO L225 Difference]: With dead ends: 74 [2023-11-06 21:06:28,333 INFO L226 Difference]: Without dead ends: 74 [2023-11-06 21:06:28,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:06:28,343 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:28,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 40 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:06:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-06 21:06:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 59. [2023-11-06 21:06:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 58 states have internal predecessors, (71), 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-06 21:06:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2023-11-06 21:06:28,351 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 8 [2023-11-06 21:06:28,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:28,351 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2023-11-06 21:06:28,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2023-11-06 21:06:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 21:06:28,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:28,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:28,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:06:28,356 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:28,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash 866437451, now seen corresponding path program 1 times [2023-11-06 21:06:28,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:28,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961166432] [2023-11-06 21:06:28,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:28,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:28,646 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-06 21:06:28,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961166432] [2023-11-06 21:06:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961166432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:06:28,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124965633] [2023-11-06 21:06:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:28,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:06:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:28,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:06:28,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:06:28,650 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:28,747 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2023-11-06 21:06:28,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:06:28,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 21:06:28,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:28,751 INFO L225 Difference]: With dead ends: 58 [2023-11-06 21:06:28,751 INFO L226 Difference]: Without dead ends: 58 [2023-11-06 21:06:28,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:06:28,752 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:28,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:06:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-06 21:06:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-06 21:06:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 57 states have internal predecessors, (70), 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-06 21:06:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2023-11-06 21:06:28,764 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 10 [2023-11-06 21:06:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:28,764 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2023-11-06 21:06:28,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:28,765 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2023-11-06 21:06:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 21:06:28,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:28,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:28,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:06:28,766 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:28,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:28,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1463010864, now seen corresponding path program 1 times [2023-11-06 21:06:28,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:28,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73831201] [2023-11-06 21:06:28,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:28,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:29,176 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-06 21:06:29,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:29,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73831201] [2023-11-06 21:06:29,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73831201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:29,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:29,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:06:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531593955] [2023-11-06 21:06:29,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:29,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:06:29,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:29,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:06:29,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:06:29,180 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:29,348 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2023-11-06 21:06:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:06:29,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 21:06:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:29,349 INFO L225 Difference]: With dead ends: 63 [2023-11-06 21:06:29,349 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 21:06:29,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:06:29,351 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:29,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 69 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:06:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 21:06:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2023-11-06 21:06:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.525) internal successors, (61), 52 states have internal predecessors, (61), 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-06 21:06:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2023-11-06 21:06:29,357 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 12 [2023-11-06 21:06:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:29,357 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2023-11-06 21:06:29,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2023-11-06 21:06:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 21:06:29,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:29,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:29,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:06:29,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:29,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:29,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1462999879, now seen corresponding path program 1 times [2023-11-06 21:06:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:29,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894437682] [2023-11-06 21:06:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:29,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:29,437 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-06 21:06:29,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:29,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894437682] [2023-11-06 21:06:29,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894437682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:29,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:29,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:06:29,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268064764] [2023-11-06 21:06:29,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:29,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:06:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:29,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:06:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:06:29,440 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:29,521 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2023-11-06 21:06:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:06:29,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 21:06:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:29,522 INFO L225 Difference]: With dead ends: 69 [2023-11-06 21:06:29,523 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 21:06:29,523 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-06 21:06:29,524 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:29,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 50 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:06:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 21:06:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2023-11-06 21:06:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 61 states have internal predecessors, (77), 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-06 21:06:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2023-11-06 21:06:29,531 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 12 [2023-11-06 21:06:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:29,531 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2023-11-06 21:06:29,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2023-11-06 21:06:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 21:06:29,536 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:29,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:29,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:06:29,536 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:29,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:29,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1098836238, now seen corresponding path program 1 times [2023-11-06 21:06:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:29,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380213072] [2023-11-06 21:06:29,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:29,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:29,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:29,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380213072] [2023-11-06 21:06:29,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380213072] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:06:29,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919443168] [2023-11-06 21:06:29,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:29,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:06:29,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:06:29,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:06:29,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:06:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:29,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 21:06:29,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:06:29,865 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 13 treesize of output 9 [2023-11-06 21:06:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:29,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:06:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:29,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919443168] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:06:29,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1564655024] [2023-11-06 21:06:29,946 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-06 21:06:29,951 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 21:06:29,957 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 21:06:29,962 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 21:06:29,963 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 21:06:30,742 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 21:06:33,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1564655024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:33,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:06:33,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [3, 3, 3] total 13 [2023-11-06 21:06:33,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040207561] [2023-11-06 21:06:33,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:33,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:06:33,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:33,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:06:33,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=152, Unknown=3, NotChecked=0, Total=210 [2023-11-06 21:06:33,236 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:36,018 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2023-11-06 21:06:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:06:36,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-06 21:06:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:36,021 INFO L225 Difference]: With dead ends: 78 [2023-11-06 21:06:36,021 INFO L226 Difference]: Without dead ends: 64 [2023-11-06 21:06:36,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=55, Invalid=152, Unknown=3, NotChecked=0, Total=210 [2023-11-06 21:06:36,022 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 7 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:36,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 328 Invalid, 8 Unknown, 0 Unchecked, 2.8s Time] [2023-11-06 21:06:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-06 21:06:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-06 21:06:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 63 states have internal predecessors, (79), 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-06 21:06:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2023-11-06 21:06:36,033 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 15 [2023-11-06 21:06:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:36,034 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2023-11-06 21:06:36,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2023-11-06 21:06:36,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 21:06:36,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:36,035 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:36,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:06:36,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-06 21:06:36,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:36,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1447780460, now seen corresponding path program 1 times [2023-11-06 21:06:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:36,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114355200] [2023-11-06 21:06:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:36,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:36,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:36,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114355200] [2023-11-06 21:06:36,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114355200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:36,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:36,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:06:36,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131704325] [2023-11-06 21:06:36,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:36,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:06:36,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:36,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:06:36,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:06:36,397 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:36,485 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2023-11-06 21:06:36,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:06:36,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-06 21:06:36,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:36,486 INFO L225 Difference]: With dead ends: 72 [2023-11-06 21:06:36,486 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 21:06:36,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:06:36,487 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:36,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 37 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:06:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 21:06:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2023-11-06 21:06:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 59 states have internal predecessors, (70), 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-06 21:06:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2023-11-06 21:06:36,493 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 15 [2023-11-06 21:06:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:36,493 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2023-11-06 21:06:36,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:06:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2023-11-06 21:06:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 21:06:36,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:36,495 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:36,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:06:36,495 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:36,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1986639017, now seen corresponding path program 1 times [2023-11-06 21:06:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:36,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231307214] [2023-11-06 21:06:36,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:36,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:36,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:36,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231307214] [2023-11-06 21:06:36,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231307214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:36,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:36,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:06:36,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942764743] [2023-11-06 21:06:36,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:36,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:06:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:36,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:06:36,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:06:36,858 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 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-06 21:06:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:37,020 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2023-11-06 21:06:37,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:06:37,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 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 19 [2023-11-06 21:06:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:37,021 INFO L225 Difference]: With dead ends: 76 [2023-11-06 21:06:37,021 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 21:06:37,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:06:37,022 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:37,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 86 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:06:37,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 21:06:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2023-11-06 21:06:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.4375) internal successors, (69), 59 states have internal predecessors, (69), 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-06 21:06:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2023-11-06 21:06:37,027 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 19 [2023-11-06 21:06:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:37,027 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2023-11-06 21:06:37,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 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-06 21:06:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2023-11-06 21:06:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 21:06:37,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:37,035 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:37,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:06:37,037 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:37,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1456267282, now seen corresponding path program 1 times [2023-11-06 21:06:37,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:37,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979570679] [2023-11-06 21:06:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:37,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979570679] [2023-11-06 21:06:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979570679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:37,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:06:37,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480871184] [2023-11-06 21:06:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:37,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:06:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:37,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:06:37,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:06:37,377 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-06 21:06:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:37,587 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2023-11-06 21:06:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:06:37,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 20 [2023-11-06 21:06:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:37,588 INFO L225 Difference]: With dead ends: 75 [2023-11-06 21:06:37,588 INFO L226 Difference]: Without dead ends: 75 [2023-11-06 21:06:37,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:06:37,589 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:37,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 65 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:06:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-06 21:06:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2023-11-06 21:06:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 59 states have internal predecessors, (68), 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-06 21:06:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-11-06 21:06:37,593 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 20 [2023-11-06 21:06:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:37,594 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-11-06 21:06:37,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-06 21:06:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-11-06 21:06:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 21:06:37,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:37,595 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:37,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:06:37,595 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:37,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2100354617, now seen corresponding path program 1 times [2023-11-06 21:06:37,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:37,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310607422] [2023-11-06 21:06:37,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:37,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:37,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:37,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310607422] [2023-11-06 21:06:37,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310607422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:37,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:06:37,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:06:37,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689935524] [2023-11-06 21:06:37,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:37,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:06:37,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:37,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:06:37,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:06:37,964 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-06 21:06:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:38,124 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2023-11-06 21:06:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:06:38,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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 21 [2023-11-06 21:06:38,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:38,126 INFO L225 Difference]: With dead ends: 61 [2023-11-06 21:06:38,126 INFO L226 Difference]: Without dead ends: 61 [2023-11-06 21:06:38,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:06:38,127 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:38,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 48 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:06:38,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-06 21:06:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-11-06 21:06:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 59 states have internal predecessors, (67), 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-06 21:06:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2023-11-06 21:06:38,131 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2023-11-06 21:06:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:38,131 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2023-11-06 21:06:38,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-06 21:06:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2023-11-06 21:06:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 21:06:38,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:38,132 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:38,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:06:38,133 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:38,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1013749287, now seen corresponding path program 1 times [2023-11-06 21:06:38,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:38,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010419171] [2023-11-06 21:06:38,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:38,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:38,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010419171] [2023-11-06 21:06:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010419171] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:06:38,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471695369] [2023-11-06 21:06:38,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:38,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:06:38,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:06:38,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:06:38,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:06:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:38,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 21:06:38,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:06:38,504 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-06 21:06:38,544 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 21:06:38,545 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 11 treesize of output 11 [2023-11-06 21:06:38,568 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 21:06:38,619 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:06:38,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 16 [2023-11-06 21:06:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:38,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:06:38,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471695369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:06:38,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:06:38,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2023-11-06 21:06:38,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427897064] [2023-11-06 21:06:38,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:06:38,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:06:38,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:38,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:06:38,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:06:38,673 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-06 21:06:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:38,950 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2023-11-06 21:06:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 21:06:38,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 22 [2023-11-06 21:06:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:38,951 INFO L225 Difference]: With dead ends: 68 [2023-11-06 21:06:38,951 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 21:06:38,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2023-11-06 21:06:38,953 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:38,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 90 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:06:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 21:06:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2023-11-06 21:06:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.375) internal successors, (66), 59 states have internal predecessors, (66), 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-06 21:06:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2023-11-06 21:06:38,956 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 22 [2023-11-06 21:06:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:38,957 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2023-11-06 21:06:38,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-06 21:06:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2023-11-06 21:06:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 21:06:38,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:38,958 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:38,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 21:06:39,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 21:06:39,165 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:39,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:39,165 INFO L85 PathProgramCache]: Analyzing trace with hash 939258027, now seen corresponding path program 1 times [2023-11-06 21:06:39,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:39,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588047161] [2023-11-06 21:06:39,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:39,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:39,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:39,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588047161] [2023-11-06 21:06:39,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588047161] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:06:39,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230952277] [2023-11-06 21:06:39,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:39,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:06:39,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:06:39,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:06:39,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:06:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:39,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 21:06:39,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:06:39,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 21:06:39,611 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 21:06:39,612 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 21:06:39,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-06 21:06:39,688 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 21:06:39,688 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-06 21:06:39,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-06 21:06:39,839 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:06:39,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 21:06:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:39,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:06:40,033 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_34|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_526) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_34|) 0)) (< |v_ULTIMATE.start_main_~list~0#1.offset_34| 0))) is different from false [2023-11-06 21:06:40,047 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:06:40,047 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-06 21:06:40,063 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:06:40,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 21:06:40,070 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-06 21:06:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:40,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230952277] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:06:40,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [640448173] [2023-11-06 21:06:40,248 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-06 21:06:40,248 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 21:06:40,249 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 21:06:40,249 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 21:06:40,249 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 21:06:46,247 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 21:06:47,214 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse2 (<= (+ |c_ULTIMATE.start_main_~y~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse3 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~y~0#1.base|))) (.cse4 (<= 8 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse5 (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0))) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) 4)) (.cse7 (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1))) (or (and (exists ((|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int)))) (= (let ((.cse0 (store |v_#memory_$Pointer$.base_60| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |v_#memory_$Pointer$.base_60| |c_ULTIMATE.start_main_~y~0#1.base|) 0 |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) 4 |c_ULTIMATE.start_main_~y~0#1.base|))) |c_#memory_$Pointer$.base|)) .cse1 (exists ((|v_#length_46| (Array Int Int))) (= (store |v_#length_46| |c_ULTIMATE.start_main_~y~0#1.base| 13) |c_#length|)) (exists ((|v_#valid_68| (Array Int Int))) (and (= (select |v_#valid_68| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_68| |c_ULTIMATE.start_main_~y~0#1.base| 1)))) .cse2 (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet4#1_20| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet4#1_20| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet4#1_20| 0)))) .cse3 .cse4 .cse5 (exists ((|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int)))) (= (let ((.cse6 (store |v_#memory_$Pointer$.offset_56| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |v_#memory_$Pointer$.offset_56| |c_ULTIMATE.start_main_~y~0#1.base|) 0 0)))) (store .cse6 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) 4 0))) |c_#memory_$Pointer$.offset|)) .cse7 (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_55| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_55| |c_ULTIMATE.start_main_~list~0#1.base|) 4 .cse8)) |c_#memory_int|) (= |v_#memory_int_55| (store |v_#memory_int_54| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |v_#memory_int_54| |c_ULTIMATE.start_main_~y~0#1.base|) 0 (select (select |v_#memory_int_55| |c_ULTIMATE.start_main_~y~0#1.base|) 0))))))) (let ((.cse9 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base| 1))) (and .cse1 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0) .cse2 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1) (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|) (= (select .cse9 |c_ULTIMATE.start_main_~y~0#1.base|) 0) .cse3 (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (let ((.cse11 (store |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 |c_ULTIMATE.start_main_~list~0#1.base|)))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_main_~y~0#1.base|) 0 |c_ULTIMATE.start_main_~list~0#1.base|))) (store (store |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~y~0#1.base| .cse10) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse11 |c_ULTIMATE.start_main_~y~0#1.base| .cse10) |c_ULTIMATE.start_main_~list~0#1.base|) 4 |c_ULTIMATE.start_main_~y~0#1.base|)))))) .cse4 .cse5 (= |c_#valid| (store .cse9 |c_ULTIMATE.start_main_~y~0#1.base| 1)) (exists ((|v_#memory_int_42| (Array Int (Array Int Int))) (|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_44| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_43| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse14 (select |v_#memory_int_44| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse13 (select |v_#memory_int_42| 1))) (and (= |v_#memory_int_43| (store |v_#memory_int_42| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_42| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse12 0)))) (= (store |v_#memory_int_45| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |v_#memory_int_45| |c_ULTIMATE.start_main_~y~0#1.base|) 0 (select (select |v_#memory_int_46| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) |v_#memory_int_46|) (= (select .cse13 1) 0) (= (store |v_#memory_int_44| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse14 8 (select (select |v_#memory_int_45| |c_ULTIMATE.start_main_~list~0#1.base|) 8))) |v_#memory_int_45|) (= |v_#memory_int_44| (store |v_#memory_int_43| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse12 4 (select .cse14 4)))) (= (store |v_#memory_int_46| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~list~0#1.base|) 4 .cse8)) |c_#memory_int|) (= (select .cse13 0) 48)))) (exists ((|v_#memory_$Pointer$.offset_44| (Array Int (Array Int Int)))) (= (let ((.cse16 (store |v_#memory_$Pointer$.offset_44| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_44| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 12)))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_main_~y~0#1.base|) 0 0))) (store (store |v_#memory_$Pointer$.offset_44| |c_ULTIMATE.start_main_~y~0#1.base| .cse15) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse16 |c_ULTIMATE.start_main_~y~0#1.base| .cse15) |c_ULTIMATE.start_main_~list~0#1.base|) 4 0)))) |c_#memory_$Pointer$.offset|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base|) 0) .cse7 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1) (exists ((|v_#length_42| (Array Int Int))) (and (= 22 (select |v_#length_42| 2)) (= (select |v_#length_42| 1) 2) (= (store (store |v_#length_42| |c_ULTIMATE.start_main_~list~0#1.base| 13) |c_ULTIMATE.start_main_~y~0#1.base| 13) |c_#length|))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_16| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet4#1_16| 2147483647) (not (= |v_ULTIMATE.start_main_#t~nondet4#1_16| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet4#1_16| 2147483648)))))))) (<= 1 |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_main_#t~nondet6#1| 2147483647) (<= 0 (+ |c_ULTIMATE.start_main_#t~nondet6#1| 2147483648))) is different from true [2023-11-06 21:06:47,238 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse2 (<= (+ |c_ULTIMATE.start_main_~y~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse3 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~y~0#1.base|))) (.cse4 (<= 8 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse5 (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0))) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) 4)) (.cse7 (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1))) (or (and (exists ((|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int)))) (= (let ((.cse0 (store |v_#memory_$Pointer$.base_60| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |v_#memory_$Pointer$.base_60| |c_ULTIMATE.start_main_~y~0#1.base|) 0 |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) 4 |c_ULTIMATE.start_main_~y~0#1.base|))) |c_#memory_$Pointer$.base|)) .cse1 (exists ((|v_#length_46| (Array Int Int))) (= (store |v_#length_46| |c_ULTIMATE.start_main_~y~0#1.base| 13) |c_#length|)) (exists ((|v_#valid_68| (Array Int Int))) (and (= (select |v_#valid_68| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_68| |c_ULTIMATE.start_main_~y~0#1.base| 1)))) .cse2 (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet4#1_20| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet4#1_20| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet4#1_20| 0)))) .cse3 .cse4 .cse5 (exists ((|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int)))) (= (let ((.cse6 (store |v_#memory_$Pointer$.offset_56| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |v_#memory_$Pointer$.offset_56| |c_ULTIMATE.start_main_~y~0#1.base|) 0 0)))) (store .cse6 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) 4 0))) |c_#memory_$Pointer$.offset|)) .cse7 (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_55| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_55| |c_ULTIMATE.start_main_~list~0#1.base|) 4 .cse8)) |c_#memory_int|) (= |v_#memory_int_55| (store |v_#memory_int_54| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |v_#memory_int_54| |c_ULTIMATE.start_main_~y~0#1.base|) 0 (select (select |v_#memory_int_55| |c_ULTIMATE.start_main_~y~0#1.base|) 0))))))) (let ((.cse9 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base| 1))) (and .cse1 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0) .cse2 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1) (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|) (= (select .cse9 |c_ULTIMATE.start_main_~y~0#1.base|) 0) .cse3 (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (let ((.cse11 (store |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 |c_ULTIMATE.start_main_~list~0#1.base|)))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_main_~y~0#1.base|) 0 |c_ULTIMATE.start_main_~list~0#1.base|))) (store (store |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~y~0#1.base| .cse10) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse11 |c_ULTIMATE.start_main_~y~0#1.base| .cse10) |c_ULTIMATE.start_main_~list~0#1.base|) 4 |c_ULTIMATE.start_main_~y~0#1.base|)))))) .cse4 .cse5 (= |c_#valid| (store .cse9 |c_ULTIMATE.start_main_~y~0#1.base| 1)) (exists ((|v_#memory_int_42| (Array Int (Array Int Int))) (|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_44| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_43| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse14 (select |v_#memory_int_44| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse13 (select |v_#memory_int_42| 1))) (and (= |v_#memory_int_43| (store |v_#memory_int_42| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_42| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse12 0)))) (= (store |v_#memory_int_45| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |v_#memory_int_45| |c_ULTIMATE.start_main_~y~0#1.base|) 0 (select (select |v_#memory_int_46| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) |v_#memory_int_46|) (= (select .cse13 1) 0) (= (store |v_#memory_int_44| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse14 8 (select (select |v_#memory_int_45| |c_ULTIMATE.start_main_~list~0#1.base|) 8))) |v_#memory_int_45|) (= |v_#memory_int_44| (store |v_#memory_int_43| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse12 4 (select .cse14 4)))) (= (store |v_#memory_int_46| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~list~0#1.base|) 4 .cse8)) |c_#memory_int|) (= (select .cse13 0) 48)))) (exists ((|v_#memory_$Pointer$.offset_44| (Array Int (Array Int Int)))) (= (let ((.cse16 (store |v_#memory_$Pointer$.offset_44| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_44| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 12)))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_main_~y~0#1.base|) 0 0))) (store (store |v_#memory_$Pointer$.offset_44| |c_ULTIMATE.start_main_~y~0#1.base| .cse15) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse16 |c_ULTIMATE.start_main_~y~0#1.base| .cse15) |c_ULTIMATE.start_main_~list~0#1.base|) 4 0)))) |c_#memory_$Pointer$.offset|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base|) 0) .cse7 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1) (exists ((|v_#length_42| (Array Int Int))) (and (= 22 (select |v_#length_42| 2)) (= (select |v_#length_42| 1) 2) (= (store (store |v_#length_42| |c_ULTIMATE.start_main_~list~0#1.base| 13) |c_ULTIMATE.start_main_~y~0#1.base| 13) |c_#length|))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_16| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet4#1_16| 2147483647) (not (= |v_ULTIMATE.start_main_#t~nondet4#1_16| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet4#1_16| 2147483648)))))))) (<= 1 |c_#StackHeapBarrier|)) is different from true [2023-11-06 21:06:48,189 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2181#(and (= |ULTIMATE.start_main_~y~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (or (= |ULTIMATE.start_main_~y~0#1.base| 0) (and (<= 12 (select |#length| |ULTIMATE.start_main_~y~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) 8) 12) (<= (+ |ULTIMATE.start_main_~y~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_67| (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_42| Int) (|v_ULTIMATE.start_main_~list~0#1.base_44| Int)) (and (<= (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_42|) (select |#length| |v_ULTIMATE.start_main_~list~0#1.base_44|)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~list~0#1.base_44|) |v_ULTIMATE.start_main_~list~0#1.offset_42|) 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~list~0#1.base_44|) |v_ULTIMATE.start_main_~list~0#1.offset_42|) 0) (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_42|) (= (select |v_#valid_67| |v_ULTIMATE.start_main_~list~0#1.base_44|) 1) (= (select |v_#valid_67| |ULTIMATE.start_main_~y~0#1.base|) 1) (= |#valid| (store |v_#valid_67| |ULTIMATE.start_main_~y~0#1.base| 0)))) (= |ULTIMATE.start_main_~y~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) 8)))) (= |ULTIMATE.start_main_~list~0#1.base| 0) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2023-11-06 21:06:48,189 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 21:06:48,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:06:48,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2023-11-06 21:06:48,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412561193] [2023-11-06 21:06:48,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:06:48,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 21:06:48,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:06:48,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 21:06:48,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1172, Unknown=6, NotChecked=216, Total=1560 [2023-11-06 21:06:48,192 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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-06 21:06:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:06:49,720 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2023-11-06 21:06:49,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 21:06:49,721 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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 22 [2023-11-06 21:06:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:06:49,721 INFO L225 Difference]: With dead ends: 106 [2023-11-06 21:06:49,721 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 21:06:49,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=520, Invalid=2566, Unknown=6, NotChecked=330, Total=3422 [2023-11-06 21:06:49,724 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 199 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:06:49,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 127 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 431 Invalid, 0 Unknown, 101 Unchecked, 0.5s Time] [2023-11-06 21:06:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 21:06:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 63. [2023-11-06 21:06:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 62 states have internal predecessors, (70), 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-06 21:06:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2023-11-06 21:06:49,727 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 22 [2023-11-06 21:06:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:06:49,728 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2023-11-06 21:06:49,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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-06 21:06:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2023-11-06 21:06:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 21:06:49,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:06:49,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:06:49,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:06:49,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 21:06:49,935 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:06:49,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:06:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash 939256631, now seen corresponding path program 1 times [2023-11-06 21:06:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:06:49,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42553273] [2023-11-06 21:06:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:06:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:50,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:06:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42553273] [2023-11-06 21:06:50,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42553273] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:06:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315667116] [2023-11-06 21:06:50,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:06:50,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:06:50,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:06:50,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:06:50,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ecf074-fdd4-43a4-8087-3bda5b2b8fa1/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 21:06:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:06:50,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 21:06:50,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:06:50,352 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-06 21:06:50,374 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 21:06:50,374 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 11 treesize of output 11 [2023-11-06 21:06:50,399 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:06:50,438 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 21:06:50,438 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 21:06:50,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-11-06 21:06:50,624 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:06:50,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2023-11-06 21:06:50,653 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-06 21:06:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:50,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:06:51,044 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:06:51,044 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 45 treesize of output 49 [2023-11-06 21:06:51,231 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:06:51,239 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-06 21:06:51,251 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:06:51,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 21:06:51,258 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-06 21:06:51,288 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 21:06:51,289 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2023-11-06 21:06:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:06:51,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315667116] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:06:51,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1182657785] [2023-11-06 21:06:51,386 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-06 21:06:51,386 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 21:06:51,387 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 21:06:51,387 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 21:06:51,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs