./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:13:10,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:13:10,321 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 05:13:10,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:13:10,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:13:10,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:13:10,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:13:10,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:13:10,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:13:10,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:13:10,361 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:13:10,361 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:13:10,362 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:13:10,363 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:13:10,363 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:13:10,364 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:13:10,364 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:13:10,365 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:13:10,365 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:13:10,366 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:13:10,367 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:13:10,367 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:13:10,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 05:13:10,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 05:13:10,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:13:10,376 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:13:10,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:13:10,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:13:10,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:13:10,381 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 05:13:10,382 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 05:13:10,382 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 05:13:10,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:13:10,383 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 05:13:10,383 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:13:10,384 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:13:10,384 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:13:10,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:13:10,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:13:10,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:13:10,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:13:10,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:13:10,387 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:13:10,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:13:10,388 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:13:10,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:13:10,389 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_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/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_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d [2023-11-19 05:13:10,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:13:10,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:13:10,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:13:10,751 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:13:10,752 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:13:10,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2023-11-19 05:13:13,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:13:14,282 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:13:14,283 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2023-11-19 05:13:14,298 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/data/9d5c586a8/40f5f35ce4cf44a3a3ef1ed6799a184e/FLAG2d690d6d4 [2023-11-19 05:13:14,311 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/data/9d5c586a8/40f5f35ce4cf44a3a3ef1ed6799a184e [2023-11-19 05:13:14,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:13:14,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:13:14,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:13:14,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:13:14,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:13:14,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75433249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14, skipping insertion in model container [2023-11-19 05:13:14,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,371 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:13:14,677 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:13:14,694 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:13:14,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:13:14,827 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:13:14,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14 WrapperNode [2023-11-19 05:13:14,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:13:14,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:13:14,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:13:14,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:13:14,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,883 INFO L138 Inliner]: procedures = 127, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2023-11-19 05:13:14,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:13:14,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:13:14,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:13:14,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:13:14,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:13:14,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:13:14,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:13:14,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:13:14,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (1/1) ... [2023-11-19 05:13:14,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:13:14,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:13:14,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:13:14,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:13:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:13:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:13:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 05:13:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:13:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:13:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:13:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:13:15,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:13:15,145 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:13:15,148 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:13:15,767 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:13:15,845 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:13:15,846 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-19 05:13:15,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:13:15 BoogieIcfgContainer [2023-11-19 05:13:15,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:13:15,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:13:15,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:13:15,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:13:15,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:13:14" (1/3) ... [2023-11-19 05:13:15,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4a8f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:13:15, skipping insertion in model container [2023-11-19 05:13:15,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:13:14" (2/3) ... [2023-11-19 05:13:15,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4a8f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:13:15, skipping insertion in model container [2023-11-19 05:13:15,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:13:15" (3/3) ... [2023-11-19 05:13:15,863 INFO L112 eAbstractionObserver]: Analyzing ICFG skiplist_3lvl.i [2023-11-19 05:13:15,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:13:15,884 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2023-11-19 05:13:15,936 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:13:15,945 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;@77f6f543, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:13:15,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-11-19 05:13:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 60 states have (on average 2.6166666666666667) internal successors, (157), 145 states have internal predecessors, (157), 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-19 05:13:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 05:13:15,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:15,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 05:13:15,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:15,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 9180, now seen corresponding path program 1 times [2023-11-19 05:13:15,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:15,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070667245] [2023-11-19 05:13:15,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:15,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:16,338 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-19 05:13:16,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070667245] [2023-11-19 05:13:16,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070667245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:16,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:16,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:13:16,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102703300] [2023-11-19 05:13:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:16,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:13:16,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:16,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:13:16,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:13:16,401 INFO L87 Difference]: Start difference. First operand has 146 states, 60 states have (on average 2.6166666666666667) internal successors, (157), 145 states have internal predecessors, (157), 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-19 05:13:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:16,703 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2023-11-19 05:13:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:13:16,706 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-19 05:13:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:16,715 INFO L225 Difference]: With dead ends: 137 [2023-11-19 05:13:16,718 INFO L226 Difference]: Without dead ends: 136 [2023-11-19 05:13:16,720 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-19 05:13:16,725 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:16,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 147 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:13:16,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-19 05:13:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-19 05:13:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 60 states have (on average 2.3666666666666667) internal successors, (142), 135 states have internal predecessors, (142), 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-19 05:13:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2023-11-19 05:13:16,800 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 2 [2023-11-19 05:13:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:16,801 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2023-11-19 05:13:16,801 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-19 05:13:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2023-11-19 05:13:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 05:13:16,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:16,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 05:13:16,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:13:16,802 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:16,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash 9181, now seen corresponding path program 1 times [2023-11-19 05:13:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:16,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877496583] [2023-11-19 05:13:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:16,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:16,914 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-19 05:13:16,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:16,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877496583] [2023-11-19 05:13:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877496583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:16,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:16,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:13:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093578591] [2023-11-19 05:13:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:16,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:13:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:16,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:13:16,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:13:16,918 INFO L87 Difference]: Start difference. First operand 136 states and 142 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-19 05:13:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:17,150 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2023-11-19 05:13:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:13:17,151 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-19 05:13:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:17,152 INFO L225 Difference]: With dead ends: 127 [2023-11-19 05:13:17,153 INFO L226 Difference]: Without dead ends: 127 [2023-11-19 05:13:17,153 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-19 05:13:17,155 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 25 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:17,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 151 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:13:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-19 05:13:17,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-19 05:13:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 60 states have (on average 2.216666666666667) internal successors, (133), 126 states have internal predecessors, (133), 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-19 05:13:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2023-11-19 05:13:17,178 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 2 [2023-11-19 05:13:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:17,179 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2023-11-19 05:13:17,179 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-19 05:13:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2023-11-19 05:13:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 05:13:17,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:17,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:17,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:13:17,181 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:17,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1695299367, now seen corresponding path program 1 times [2023-11-19 05:13:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:17,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283617866] [2023-11-19 05:13:17,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:17,599 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-19 05:13:17,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:17,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283617866] [2023-11-19 05:13:17,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283617866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:17,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:17,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:13:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634721875] [2023-11-19 05:13:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:17,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:13:17,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:17,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:13:17,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:13:17,609 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-19 05:13:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:17,921 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2023-11-19 05:13:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:13:17,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-19 05:13:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:17,924 INFO L225 Difference]: With dead ends: 126 [2023-11-19 05:13:17,924 INFO L226 Difference]: Without dead ends: 126 [2023-11-19 05:13:17,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:13:17,926 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 10 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:17,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 269 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:13:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-19 05:13:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-19 05:13:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 60 states have (on average 2.2) internal successors, (132), 125 states have internal predecessors, (132), 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-19 05:13:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2023-11-19 05:13:17,937 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 8 [2023-11-19 05:13:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:17,938 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2023-11-19 05:13:17,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-19 05:13:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2023-11-19 05:13:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 05:13:17,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:17,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:17,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:13:17,939 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:17,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1695299366, now seen corresponding path program 1 times [2023-11-19 05:13:17,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494442484] [2023-11-19 05:13:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:18,261 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-19 05:13:18,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:18,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494442484] [2023-11-19 05:13:18,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494442484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:18,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:18,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:13:18,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103488117] [2023-11-19 05:13:18,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:18,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:13:18,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:18,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:13:18,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:13:18,265 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-19 05:13:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:18,479 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2023-11-19 05:13:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:13:18,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-19 05:13:18,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:18,480 INFO L225 Difference]: With dead ends: 125 [2023-11-19 05:13:18,480 INFO L226 Difference]: Without dead ends: 125 [2023-11-19 05:13:18,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:13:18,482 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 8 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:18,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 281 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:13:18,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-19 05:13:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-19 05:13:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 60 states have (on average 2.183333333333333) internal successors, (131), 124 states have internal predecessors, (131), 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-19 05:13:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2023-11-19 05:13:18,490 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 8 [2023-11-19 05:13:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:18,490 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2023-11-19 05:13:18,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-19 05:13:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2023-11-19 05:13:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:13:18,491 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:18,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:18,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:13:18,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:18,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1014672829, now seen corresponding path program 1 times [2023-11-19 05:13:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:18,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109476652] [2023-11-19 05:13:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:18,552 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-19 05:13:18,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:18,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109476652] [2023-11-19 05:13:18,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109476652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:18,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:18,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:13:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965342306] [2023-11-19 05:13:18,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:18,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:13:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:13:18,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:13:18,554 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:18,714 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2023-11-19 05:13:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:13:18,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 05:13:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:18,716 INFO L225 Difference]: With dead ends: 124 [2023-11-19 05:13:18,716 INFO L226 Difference]: Without dead ends: 124 [2023-11-19 05:13:18,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:13:18,718 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 11 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:18,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 347 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:13:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-19 05:13:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-19 05:13:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 60 states have (on average 2.1666666666666665) internal successors, (130), 123 states have internal predecessors, (130), 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-19 05:13:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2023-11-19 05:13:18,724 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 9 [2023-11-19 05:13:18,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:18,725 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2023-11-19 05:13:18,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2023-11-19 05:13:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:13:18,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:18,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:18,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:13:18,726 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:18,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:18,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1014672828, now seen corresponding path program 1 times [2023-11-19 05:13:18,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:18,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566620095] [2023-11-19 05:13:18,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:18,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:19,056 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-19 05:13:19,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566620095] [2023-11-19 05:13:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566620095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:19,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:13:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278131620] [2023-11-19 05:13:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:19,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:13:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:13:19,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:13:19,059 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:19,318 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2023-11-19 05:13:19,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:13:19,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 05:13:19,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:19,320 INFO L225 Difference]: With dead ends: 123 [2023-11-19 05:13:19,320 INFO L226 Difference]: Without dead ends: 123 [2023-11-19 05:13:19,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:13:19,321 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 12 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:19,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 247 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:13:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-19 05:13:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-19 05:13:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 60 states have (on average 2.15) internal successors, (129), 122 states have internal predecessors, (129), 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-19 05:13:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2023-11-19 05:13:19,327 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 9 [2023-11-19 05:13:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:19,328 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2023-11-19 05:13:19,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2023-11-19 05:13:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 05:13:19,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:19,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:19,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:13:19,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:19,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1390086628, now seen corresponding path program 1 times [2023-11-19 05:13:19,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:19,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948698010] [2023-11-19 05:13:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:19,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:19,448 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-19 05:13:19,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:19,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948698010] [2023-11-19 05:13:19,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948698010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:19,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:19,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:13:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199590513] [2023-11-19 05:13:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:19,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:13:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:19,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:13:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:13:19,451 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-19 05:13:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:19,623 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2023-11-19 05:13:19,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:13:19,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-19 05:13:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:19,625 INFO L225 Difference]: With dead ends: 122 [2023-11-19 05:13:19,625 INFO L226 Difference]: Without dead ends: 122 [2023-11-19 05:13:19,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:13:19,629 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:19,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 343 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:13:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-19 05:13:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-11-19 05:13:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 60 states have (on average 2.1333333333333333) internal successors, (128), 121 states have internal predecessors, (128), 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-19 05:13:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2023-11-19 05:13:19,641 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 10 [2023-11-19 05:13:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:19,641 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2023-11-19 05:13:19,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-19 05:13:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2023-11-19 05:13:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 05:13:19,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:19,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:19,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 05:13:19,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:19,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1390086627, now seen corresponding path program 1 times [2023-11-19 05:13:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:19,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947769825] [2023-11-19 05:13:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:20,191 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-19 05:13:20,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:20,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947769825] [2023-11-19 05:13:20,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947769825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:20,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:20,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 05:13:20,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605773330] [2023-11-19 05:13:20,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:20,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 05:13:20,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:20,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 05:13:20,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:13:20,194 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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-19 05:13:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:20,555 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2023-11-19 05:13:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:13:20,556 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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-19 05:13:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:20,557 INFO L225 Difference]: With dead ends: 121 [2023-11-19 05:13:20,557 INFO L226 Difference]: Without dead ends: 121 [2023-11-19 05:13:20,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-19 05:13:20,558 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 8 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:20,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 302 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:13:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-19 05:13:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-19 05:13:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 60 states have (on average 2.1166666666666667) internal successors, (127), 120 states have internal predecessors, (127), 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-19 05:13:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2023-11-19 05:13:20,562 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 10 [2023-11-19 05:13:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:20,563 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2023-11-19 05:13:20,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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-19 05:13:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2023-11-19 05:13:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:13:20,563 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:20,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:20,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 05:13:20,564 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:20,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:20,565 INFO L85 PathProgramCache]: Analyzing trace with hash 331666501, now seen corresponding path program 1 times [2023-11-19 05:13:20,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:20,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599681088] [2023-11-19 05:13:20,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:20,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:20,971 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-19 05:13:20,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:20,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599681088] [2023-11-19 05:13:20,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599681088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:20,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:20,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 05:13:20,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622633509] [2023-11-19 05:13:20,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:20,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 05:13:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 05:13:20,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-19 05:13:20,977 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:21,309 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2023-11-19 05:13:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 05:13:21,310 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 05:13:21,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:21,311 INFO L225 Difference]: With dead ends: 120 [2023-11-19 05:13:21,311 INFO L226 Difference]: Without dead ends: 120 [2023-11-19 05:13:21,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-19 05:13:21,312 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 15 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:21,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 447 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:13:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-19 05:13:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-19 05:13:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 60 states have (on average 2.1) internal successors, (126), 119 states have internal predecessors, (126), 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-19 05:13:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2023-11-19 05:13:21,316 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 14 [2023-11-19 05:13:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:21,317 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2023-11-19 05:13:21,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2023-11-19 05:13:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:13:21,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:21,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:21,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 05:13:21,318 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:21,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:21,319 INFO L85 PathProgramCache]: Analyzing trace with hash 331666502, now seen corresponding path program 1 times [2023-11-19 05:13:21,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:21,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346840288] [2023-11-19 05:13:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:21,845 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-19 05:13:21,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:21,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346840288] [2023-11-19 05:13:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346840288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:21,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:21,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 05:13:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917731931] [2023-11-19 05:13:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:21,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 05:13:21,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:21,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 05:13:21,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-19 05:13:21,848 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:22,166 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2023-11-19 05:13:22,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 05:13:22,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 05:13:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:22,167 INFO L225 Difference]: With dead ends: 119 [2023-11-19 05:13:22,167 INFO L226 Difference]: Without dead ends: 119 [2023-11-19 05:13:22,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-19 05:13:22,169 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 15 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:22,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:13:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-19 05:13:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-19 05:13:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 118 states have internal predecessors, (125), 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-19 05:13:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2023-11-19 05:13:22,173 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 14 [2023-11-19 05:13:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:22,173 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2023-11-19 05:13:22,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2023-11-19 05:13:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:13:22,174 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:22,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:22,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 05:13:22,174 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:22,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:22,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1691726954, now seen corresponding path program 1 times [2023-11-19 05:13:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:22,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903222435] [2023-11-19 05:13:22,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:22,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:22,250 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-19 05:13:22,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:22,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903222435] [2023-11-19 05:13:22,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903222435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:22,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:13:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635981454] [2023-11-19 05:13:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:22,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:13:22,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:22,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:13:22,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:13:22,252 INFO L87 Difference]: Start difference. First operand 119 states and 125 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-19 05:13:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:22,409 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2023-11-19 05:13:22,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:13:22,410 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-19 05:13:22,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:22,411 INFO L225 Difference]: With dead ends: 118 [2023-11-19 05:13:22,411 INFO L226 Difference]: Without dead ends: 118 [2023-11-19 05:13:22,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:13:22,412 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 10 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:22,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 328 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:13:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-19 05:13:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-19 05:13:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 60 states have (on average 2.066666666666667) internal successors, (124), 117 states have internal predecessors, (124), 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-19 05:13:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2023-11-19 05:13:22,416 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 15 [2023-11-19 05:13:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:22,416 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2023-11-19 05:13:22,416 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-19 05:13:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2023-11-19 05:13:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:13:22,417 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:22,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:22,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 05:13:22,417 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:22,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:22,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1691726955, now seen corresponding path program 1 times [2023-11-19 05:13:22,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:22,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426145599] [2023-11-19 05:13:22,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:22,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:22,953 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-19 05:13:22,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:22,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426145599] [2023-11-19 05:13:22,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426145599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:22,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:22,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 05:13:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571695108] [2023-11-19 05:13:22,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:22,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 05:13:22,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:22,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 05:13:22,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-19 05:13:22,958 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-19 05:13:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:23,233 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2023-11-19 05:13:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 05:13:23,234 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-19 05:13:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:23,235 INFO L225 Difference]: With dead ends: 117 [2023-11-19 05:13:23,235 INFO L226 Difference]: Without dead ends: 117 [2023-11-19 05:13:23,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-19 05:13:23,236 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 14 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:23,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 349 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:13:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-19 05:13:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-11-19 05:13:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 60 states have (on average 2.05) internal successors, (123), 116 states have internal predecessors, (123), 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-19 05:13:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2023-11-19 05:13:23,240 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 15 [2023-11-19 05:13:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:23,240 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2023-11-19 05:13:23,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-19 05:13:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2023-11-19 05:13:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:13:23,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:23,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:23,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 05:13:23,241 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:23,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 903928040, now seen corresponding path program 1 times [2023-11-19 05:13:23,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:23,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851717964] [2023-11-19 05:13:23,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:23,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:23,317 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-19 05:13:23,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:23,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851717964] [2023-11-19 05:13:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851717964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:23,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:23,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:13:23,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678005128] [2023-11-19 05:13:23,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:23,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:13:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:13:23,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:13:23,319 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:23,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:23,473 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2023-11-19 05:13:23,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:13:23,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-19 05:13:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:23,474 INFO L225 Difference]: With dead ends: 116 [2023-11-19 05:13:23,474 INFO L226 Difference]: Without dead ends: 116 [2023-11-19 05:13:23,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:13:23,475 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:23,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 324 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:13:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-19 05:13:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-11-19 05:13:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 2.033333333333333) internal successors, (122), 115 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2023-11-19 05:13:23,481 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 16 [2023-11-19 05:13:23,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:23,481 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2023-11-19 05:13:23,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2023-11-19 05:13:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:13:23,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:23,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:23,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 05:13:23,483 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:23,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash 903928041, now seen corresponding path program 1 times [2023-11-19 05:13:23,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:23,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753784044] [2023-11-19 05:13:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:23,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:24,144 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-19 05:13:24,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753784044] [2023-11-19 05:13:24,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753784044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:24,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:24,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-19 05:13:24,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527120010] [2023-11-19 05:13:24,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:24,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 05:13:24,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:24,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 05:13:24,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-11-19 05:13:24,147 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:24,584 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2023-11-19 05:13:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 05:13:24,585 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-19 05:13:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:24,586 INFO L225 Difference]: With dead ends: 115 [2023-11-19 05:13:24,586 INFO L226 Difference]: Without dead ends: 115 [2023-11-19 05:13:24,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-11-19 05:13:24,587 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 8 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:24,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 510 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:13:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-19 05:13:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-19 05:13:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 60 states have (on average 2.0166666666666666) internal successors, (121), 114 states have internal predecessors, (121), 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-19 05:13:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2023-11-19 05:13:24,591 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 16 [2023-11-19 05:13:24,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:24,591 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2023-11-19 05:13:24,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2023-11-19 05:13:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:13:24,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:24,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:24,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 05:13:24,593 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:24,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:24,593 INFO L85 PathProgramCache]: Analyzing trace with hash -518124295, now seen corresponding path program 1 times [2023-11-19 05:13:24,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:24,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192329717] [2023-11-19 05:13:24,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:24,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:24,694 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-19 05:13:24,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192329717] [2023-11-19 05:13:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192329717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:24,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:24,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:13:24,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145854702] [2023-11-19 05:13:24,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:24,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:13:24,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:24,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:13:24,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:13:24,697 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-19 05:13:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:24,873 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2023-11-19 05:13:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:13:24,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-19 05:13:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:24,875 INFO L225 Difference]: With dead ends: 141 [2023-11-19 05:13:24,875 INFO L226 Difference]: Without dead ends: 141 [2023-11-19 05:13:24,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:13:24,877 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 165 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:24,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 127 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:13:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-19 05:13:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 113. [2023-11-19 05:13:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 112 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2023-11-19 05:13:24,883 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 19 [2023-11-19 05:13:24,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:24,883 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2023-11-19 05:13:24,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-19 05:13:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2023-11-19 05:13:24,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:13:24,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:24,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:24,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 05:13:24,885 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:24,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash -518124294, now seen corresponding path program 1 times [2023-11-19 05:13:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:24,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911258491] [2023-11-19 05:13:24,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:24,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:25,076 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-19 05:13:25,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:25,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911258491] [2023-11-19 05:13:25,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911258491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:25,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:25,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:13:25,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588052205] [2023-11-19 05:13:25,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:25,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:13:25,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:25,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:13:25,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:13:25,082 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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-19 05:13:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:25,251 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2023-11-19 05:13:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:13:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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-19 05:13:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:25,252 INFO L225 Difference]: With dead ends: 111 [2023-11-19 05:13:25,252 INFO L226 Difference]: Without dead ends: 111 [2023-11-19 05:13:25,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:13:25,253 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 164 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 123 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.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:25,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 123 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:13:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-19 05:13:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-19 05:13:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 60 states have (on average 1.95) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2023-11-19 05:13:25,275 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 19 [2023-11-19 05:13:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:25,276 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2023-11-19 05:13:25,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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-19 05:13:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2023-11-19 05:13:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 05:13:25,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:25,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:25,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 05:13:25,277 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:25,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1118018700, now seen corresponding path program 1 times [2023-11-19 05:13:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074087537] [2023-11-19 05:13:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:25,388 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-19 05:13:25,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074087537] [2023-11-19 05:13:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074087537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:25,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:25,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:13:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044171308] [2023-11-19 05:13:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:25,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:13:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:25,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:13:25,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:13:25,391 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-19 05:13:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:25,593 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2023-11-19 05:13:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:13:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-19 05:13:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:25,594 INFO L225 Difference]: With dead ends: 130 [2023-11-19 05:13:25,595 INFO L226 Difference]: Without dead ends: 130 [2023-11-19 05:13:25,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:13:25,595 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 132 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:25,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 126 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:13:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-19 05:13:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2023-11-19 05:13:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 107 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2023-11-19 05:13:25,599 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 20 [2023-11-19 05:13:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:25,600 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2023-11-19 05:13:25,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-19 05:13:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2023-11-19 05:13:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 05:13:25,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:25,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:25,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 05:13:25,601 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:25,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1118018701, now seen corresponding path program 1 times [2023-11-19 05:13:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269078029] [2023-11-19 05:13:25,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:25,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:25,766 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-19 05:13:25,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:25,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269078029] [2023-11-19 05:13:25,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269078029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:25,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:25,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:13:25,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892405357] [2023-11-19 05:13:25,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:25,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:13:25,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:25,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:13:25,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:13:25,769 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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-19 05:13:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:25,968 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2023-11-19 05:13:25,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:13:25,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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-19 05:13:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:25,970 INFO L225 Difference]: With dead ends: 103 [2023-11-19 05:13:25,970 INFO L226 Difference]: Without dead ends: 103 [2023-11-19 05:13:25,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:13:25,970 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 108 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:25,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 159 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:13:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-19 05:13:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-19 05:13:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2023-11-19 05:13:25,974 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 20 [2023-11-19 05:13:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:25,974 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2023-11-19 05:13:25,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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-19 05:13:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2023-11-19 05:13:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 05:13:25,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:25,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:25,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 05:13:25,975 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:25,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:25,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1118022343, now seen corresponding path program 1 times [2023-11-19 05:13:25,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:25,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232071630] [2023-11-19 05:13:25,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:25,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:26,705 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-19 05:13:26,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232071630] [2023-11-19 05:13:26,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232071630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:26,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:26,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-19 05:13:26,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846645715] [2023-11-19 05:13:26,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:26,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-19 05:13:26,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:26,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 05:13:26,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-19 05:13:26,708 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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-19 05:13:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:27,284 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2023-11-19 05:13:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 05:13:27,285 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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-19 05:13:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:27,286 INFO L225 Difference]: With dead ends: 152 [2023-11-19 05:13:27,286 INFO L226 Difference]: Without dead ends: 152 [2023-11-19 05:13:27,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2023-11-19 05:13:27,288 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 187 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:27,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 317 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 05:13:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-19 05:13:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 103. [2023-11-19 05:13:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 102 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2023-11-19 05:13:27,294 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 20 [2023-11-19 05:13:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:27,294 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2023-11-19 05:13:27,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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-19 05:13:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2023-11-19 05:13:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 05:13:27,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:27,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:27,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 05:13:27,299 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:27,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1118022344, now seen corresponding path program 1 times [2023-11-19 05:13:27,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:27,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93017006] [2023-11-19 05:13:27,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:28,858 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-19 05:13:28,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:28,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93017006] [2023-11-19 05:13:28,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93017006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:28,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:28,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-19 05:13:28,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667028194] [2023-11-19 05:13:28,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:28,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-19 05:13:28,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:28,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 05:13:28,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-11-19 05:13:28,861 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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-19 05:13:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:29,966 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2023-11-19 05:13:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 05:13:29,966 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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-19 05:13:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:29,968 INFO L225 Difference]: With dead ends: 203 [2023-11-19 05:13:29,968 INFO L226 Difference]: Without dead ends: 203 [2023-11-19 05:13:29,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2023-11-19 05:13:29,969 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 215 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:29,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 540 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 05:13:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-19 05:13:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 128. [2023-11-19 05:13:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.8222222222222222) internal successors, (164), 127 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 164 transitions. [2023-11-19 05:13:29,973 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 164 transitions. Word has length 20 [2023-11-19 05:13:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:29,974 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 164 transitions. [2023-11-19 05:13:29,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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-19 05:13:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 164 transitions. [2023-11-19 05:13:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 05:13:29,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:29,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:29,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 05:13:29,977 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:29,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:29,978 INFO L85 PathProgramCache]: Analyzing trace with hash -576103218, now seen corresponding path program 1 times [2023-11-19 05:13:29,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:29,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504737993] [2023-11-19 05:13:29,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:29,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:30,096 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-19 05:13:30,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:30,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504737993] [2023-11-19 05:13:30,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504737993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:30,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:30,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:13:30,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800791] [2023-11-19 05:13:30,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:30,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:13:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:13:30,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:13:30,100 INFO L87 Difference]: Start difference. First operand 128 states and 164 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-19 05:13:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:30,237 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2023-11-19 05:13:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:13:30,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2023-11-19 05:13:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:30,240 INFO L225 Difference]: With dead ends: 127 [2023-11-19 05:13:30,241 INFO L226 Difference]: Without dead ends: 127 [2023-11-19 05:13:30,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:13:30,242 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 100 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:30,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 191 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:13:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-19 05:13:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-19 05:13:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 90 states have (on average 1.8111111111111111) internal successors, (163), 126 states have internal predecessors, (163), 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-19 05:13:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2023-11-19 05:13:30,250 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 23 [2023-11-19 05:13:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:30,251 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2023-11-19 05:13:30,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-19 05:13:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2023-11-19 05:13:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 05:13:30,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:30,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:30,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 05:13:30,254 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:30,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash -679257962, now seen corresponding path program 1 times [2023-11-19 05:13:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:30,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285707384] [2023-11-19 05:13:30,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:30,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:31,120 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-19 05:13:31,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:31,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285707384] [2023-11-19 05:13:31,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285707384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:31,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:31,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-19 05:13:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008226400] [2023-11-19 05:13:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:31,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-19 05:13:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:31,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 05:13:31,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-19 05:13:31,123 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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-19 05:13:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:31,796 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2023-11-19 05:13:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 05:13:31,803 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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 24 [2023-11-19 05:13:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:31,805 INFO L225 Difference]: With dead ends: 173 [2023-11-19 05:13:31,805 INFO L226 Difference]: Without dead ends: 173 [2023-11-19 05:13:31,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2023-11-19 05:13:31,808 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 61 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:31,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 564 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 05:13:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-19 05:13:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 133. [2023-11-19 05:13:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 96 states have (on average 1.78125) internal successors, (171), 132 states have internal predecessors, (171), 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-19 05:13:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 171 transitions. [2023-11-19 05:13:31,814 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 171 transitions. Word has length 24 [2023-11-19 05:13:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:31,815 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 171 transitions. [2023-11-19 05:13:31,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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-19 05:13:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 171 transitions. [2023-11-19 05:13:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 05:13:31,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:31,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:31,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-19 05:13:31,818 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:31,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:31,818 INFO L85 PathProgramCache]: Analyzing trace with hash -679257961, now seen corresponding path program 1 times [2023-11-19 05:13:31,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:31,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575058510] [2023-11-19 05:13:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:31,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:33,082 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-19 05:13:33,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:33,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575058510] [2023-11-19 05:13:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575058510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:33,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-19 05:13:33,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115660933] [2023-11-19 05:13:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:33,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-19 05:13:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:33,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 05:13:33,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-11-19 05:13:33,085 INFO L87 Difference]: Start difference. First operand 133 states and 171 transitions. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-19 05:13:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:34,003 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2023-11-19 05:13:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 05:13:34,004 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 24 [2023-11-19 05:13:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:34,005 INFO L225 Difference]: With dead ends: 174 [2023-11-19 05:13:34,005 INFO L226 Difference]: Without dead ends: 174 [2023-11-19 05:13:34,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2023-11-19 05:13:34,006 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 63 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:34,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 545 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 05:13:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-19 05:13:34,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 133. [2023-11-19 05:13:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 96 states have (on average 1.7708333333333333) internal successors, (170), 132 states have internal predecessors, (170), 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-19 05:13:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 170 transitions. [2023-11-19 05:13:34,014 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 170 transitions. Word has length 24 [2023-11-19 05:13:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:34,014 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 170 transitions. [2023-11-19 05:13:34,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-19 05:13:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2023-11-19 05:13:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 05:13:34,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:34,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:34,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-19 05:13:34,016 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:34,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1608128822, now seen corresponding path program 1 times [2023-11-19 05:13:34,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:34,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941241854] [2023-11-19 05:13:34,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:34,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:34,098 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-19 05:13:34,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:34,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941241854] [2023-11-19 05:13:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941241854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:34,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:34,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:13:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115108868] [2023-11-19 05:13:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:34,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:13:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:34,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:13:34,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:13:34,104 INFO L87 Difference]: Start difference. First operand 133 states and 170 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-19 05:13:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:34,244 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2023-11-19 05:13:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:13:34,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2023-11-19 05:13:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:34,246 INFO L225 Difference]: With dead ends: 132 [2023-11-19 05:13:34,246 INFO L226 Difference]: Without dead ends: 132 [2023-11-19 05:13:34,246 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-19 05:13:34,247 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:34,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 80 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:13:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-19 05:13:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2023-11-19 05:13:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 98 states have (on average 1.6938775510204083) internal successors, (166), 130 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:13:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 166 transitions. [2023-11-19 05:13:34,252 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 166 transitions. Word has length 24 [2023-11-19 05:13:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:34,253 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 166 transitions. [2023-11-19 05:13:34,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-19 05:13:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 166 transitions. [2023-11-19 05:13:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 05:13:34,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:34,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:34,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-19 05:13:34,255 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:34,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:34,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1608128821, now seen corresponding path program 1 times [2023-11-19 05:13:34,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:34,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500566905] [2023-11-19 05:13:34,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:34,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:35,241 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-19 05:13:35,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:35,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500566905] [2023-11-19 05:13:35,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500566905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:13:35,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:13:35,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-19 05:13:35,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377326255] [2023-11-19 05:13:35,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:13:35,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-19 05:13:35,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:13:35,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-19 05:13:35,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2023-11-19 05:13:35,243 INFO L87 Difference]: Start difference. First operand 131 states and 166 transitions. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-19 05:13:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:13:35,963 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2023-11-19 05:13:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 05:13:35,964 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 24 [2023-11-19 05:13:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:13:35,965 INFO L225 Difference]: With dead ends: 205 [2023-11-19 05:13:35,965 INFO L226 Difference]: Without dead ends: 205 [2023-11-19 05:13:35,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2023-11-19 05:13:35,966 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 327 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 05:13:35,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 512 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 05:13:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-19 05:13:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 139. [2023-11-19 05:13:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 138 states have internal predecessors, (179), 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-19 05:13:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 179 transitions. [2023-11-19 05:13:35,975 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 179 transitions. Word has length 24 [2023-11-19 05:13:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:13:35,976 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 179 transitions. [2023-11-19 05:13:35,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-19 05:13:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 179 transitions. [2023-11-19 05:13:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 05:13:35,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:13:35,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:13:35,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-19 05:13:35,977 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-19 05:13:35,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:13:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1608121443, now seen corresponding path program 1 times [2023-11-19 05:13:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:13:35,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563514781] [2023-11-19 05:13:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:13:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:37,856 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-19 05:13:37,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:13:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563514781] [2023-11-19 05:13:37,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563514781] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:13:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11900075] [2023-11-19 05:13:37,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:13:37,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:13:37,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:13:37,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:13:37,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3de3a1f2-6fa0-4104-be05-d2ffa683ba44/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:13:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:13:38,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-19 05:13:38,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:13:38,180 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 05:13:38,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-19 05:13:38,262 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-11-19 05:13:38,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-11-19 05:13:38,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-19 05:13:38,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2023-11-19 05:13:38,832 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 05:13:38,832 INFO L378 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 108 treesize of output 89 [2023-11-19 05:13:38,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-19 05:13:38,973 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 05:13:38,973 INFO L378 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 101 treesize of output 84 [2023-11-19 05:13:38,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-19 05:13:39,131 INFO L349 Elim1Store]: treesize reduction 74, result has 18.7 percent of original size [2023-11-19 05:13:39,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 63 [2023-11-19 05:13:39,141 INFO L378 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 99 treesize of output 80 [2023-11-19 05:13:39,607 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-11-19 05:13:39,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 131 [2023-11-19 05:13:39,628 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2023-11-19 05:13:39,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 80 [2023-11-19 05:13:39,711 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-11-19 05:13:39,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 124 [2023-11-19 05:13:39,730 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2023-11-19 05:13:39,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 80 [2023-11-19 05:13:39,811 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-11-19 05:13:39,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 117 [2023-11-19 05:13:39,842 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2023-11-19 05:13:39,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 80 [2023-11-19 05:13:40,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 70 [2023-11-19 05:13:40,417 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-19 05:13:40,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 32 [2023-11-19 05:13:40,551 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-19 05:13:40,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:13:40,753 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))) 1)) is different from false [2023-11-19 05:13:40,765 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1120 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1121) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1120) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) 1)) is different from false [2023-11-19 05:13:40,780 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1120 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.base| v_ArrVal_1118) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1121) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.base| v_ArrVal_1119) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1120) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))) 1)) is different from false [2023-11-19 05:13:40,798 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1120 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1118) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1121) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1119) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1120) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) 1)) is different from false [2023-11-19 05:13:40,811 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1120 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1121) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1120) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))) 1)) is different from false [2023-11-19 05:13:40,824 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))))) is different from false [2023-11-19 05:13:40,841 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1116) .cse2 v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))) 1)) is different from false [2023-11-19 05:13:40,856 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1115))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1114) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1116) .cse2 v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))) 1)) is different from false [2023-11-19 05:13:40,876 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1112) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1115))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1113) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1114) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1116) .cse2 v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))) 1)) is different from false [2023-11-19 05:13:40,896 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1112) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1115))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1113) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1114) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1116) .cse2 v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))))) 1)) is different from false [2023-11-19 05:13:40,916 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1112) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1115))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1113) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1114) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1116) .cse2 v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))))) 1)) is different from false [2023-11-19 05:13:40,939 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1115))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1122))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1114) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1116) .cse2 v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))))) 1)) is different from false [2023-11-19 05:13:40,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 644 treesize of output 560 [2023-11-19 05:13:40,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:13:40,961 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 560 treesize of output 354 [2023-11-19 05:13:40,968 INFO L378 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 340 treesize of output 336 [2023-11-19 05:13:40,979 INFO L378 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 168 treesize of output 166 [2023-11-19 05:13:41,315 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse5 (select .cse34 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse16 (= .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse3 (select .cse34 .cse4))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (not (= .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_27 Int)) (= (select |c_#valid| (select (let ((.cse1 (store .cse2 .cse0 v_ArrVal_1122))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_27))) 1)) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) .cse3)))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse7 (+ 8 v_arrayElimCell_26))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse6 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_1122)))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse6 (+ 8 v_arrayElimCell_28))) 1) (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select .cse6 (+ 8 v_arrayElimCell_27))) 1)) (= (select |c_#valid| (select .cse6 .cse7)) 1)))) (not (= (select v_arrayElimArr_1 .cse7) .cse3))))) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_1122)))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse10 (+ 8 v_arrayElimCell_28))) 1) (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select .cse10 (+ 8 v_arrayElimCell_27))) 1))))) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) .cse3)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_1122))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_28))) 1)) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) .cse3)) (= .cse15 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)))))) (not .cse16)) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse20 (+ 8 v_arrayElimCell_26)) (.cse19 (select (select .cse18 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse17 (store .cse18 .cse19 v_ArrVal_1122))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) .cse20)) 1)) (not (= (select v_arrayElimArr_1 .cse20) .cse3)) (= .cse19 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse22 (+ 8 v_arrayElimCell_26))) (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse21 (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_1122)))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select .cse21 (+ 8 v_arrayElimCell_27))) 1)) (= (select |c_#valid| (select .cse21 .cse22)) 1)))) (not (= (select v_arrayElimArr_1 .cse22) .cse3)))))) .cse16) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse28 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse26 (+ 8 v_arrayElimCell_26)) (.cse29 (select (select .cse28 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse25 (let ((.cse27 (store .cse28 .cse29 v_ArrVal_1122))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse25 (+ 8 v_arrayElimCell_28))) 1) (= (select |c_#valid| (select .cse25 .cse26)) 1)))) (not (= (select v_arrayElimArr_1 .cse26) .cse3)) (= .cse29 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse30 (select (select .cse33 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (not (= .cse30 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse31 (let ((.cse32 (store .cse33 .cse30 v_ArrVal_1122))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse31 (+ 8 v_arrayElimCell_28))) 1) (= (select |c_#valid| (select .cse31 (+ 8 v_arrayElimCell_27))) 1)))) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) .cse3)))))))))) is different from false [2023-11-19 05:13:41,533 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse5 (select .cse34 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse9 (= .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (store .cse34 .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (and (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse2 (store .cse4 .cse5 v_arrayElimArr_1))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (or (= .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse1 (store .cse2 .cse0 v_ArrVal_1122))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_28))) 1)))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (or (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse6 (let ((.cse7 (let ((.cse8 (store .cse4 .cse5 v_arrayElimArr_1))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3) v_ArrVal_1122)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select .cse6 (+ 8 v_arrayElimCell_27))) 1)) (= (select |c_#valid| (select .cse6 (+ 8 v_arrayElimCell_28))) 1))))))) (not .cse9)) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse14 (store .cse4 .cse5 v_arrayElimArr_1))) (let ((.cse10 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3)) (.cse12 (+ 8 v_arrayElimCell_26))) (or (= .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse11 (let ((.cse13 (store .cse14 .cse10 v_ArrVal_1122))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse11 (+ 8 v_arrayElimCell_28))) 1) (= (select |c_#valid| (select .cse11 .cse12)) 1)))) (not (= (select v_arrayElimArr_1 .cse12) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse16 (+ 8 v_arrayElimCell_26))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse15 (let ((.cse17 (let ((.cse18 (store .cse4 .cse5 v_arrayElimArr_1))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3) v_ArrVal_1122)))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select .cse15 (+ 8 v_arrayElimCell_27))) 1)) (= (select |c_#valid| (select .cse15 (+ 8 v_arrayElimCell_28))) 1) (= (select |c_#valid| (select .cse15 .cse16)) 1)))) (not (= (select v_arrayElimArr_1 .cse16) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse22 (store .cse4 .cse5 v_arrayElimArr_1))) (let ((.cse19 (select (select .cse22 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (or (not (= .cse19 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse20 (let ((.cse21 (store .cse22 .cse19 v_ArrVal_1122))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse20 (+ 8 v_arrayElimCell_27))) 1) (= (select |c_#valid| (select .cse20 (+ 8 v_arrayElimCell_28))) 1)))) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse26 (store .cse4 .cse5 v_arrayElimArr_1))) (let ((.cse23 (select (select .cse26 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3)) (.cse24 (+ 8 v_arrayElimCell_26))) (or (= .cse23 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (not (= (select v_arrayElimArr_1 .cse24) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (forall ((v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse25 (store .cse26 .cse23 v_ArrVal_1122))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) .cse24)) 1)))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse27 (+ 8 v_arrayElimCell_26))) (or (not (= (select v_arrayElimArr_1 .cse27) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse28 (let ((.cse29 (let ((.cse30 (store .cse4 .cse5 v_arrayElimArr_1))) (store .cse30 (select (select .cse30 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3) v_ArrVal_1122)))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select .cse28 (+ 8 v_arrayElimCell_27))) 1)) (= (select |c_#valid| (select .cse28 .cse27)) 1)))))))) .cse9) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse33 (store .cse4 .cse5 v_arrayElimArr_1))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (or (not (= .cse31 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_27 Int)) (= (select |c_#valid| (select (let ((.cse32 (store .cse33 .cse31 v_ArrVal_1122))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_27))) 1)))))))))) is different from false [2023-11-19 05:13:41,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:13:41,756 INFO L378 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 2 case distinctions, treesize of input 1611 treesize of output 837