./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje --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 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:27:18,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:27:18,927 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:27:18,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:27:18,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:27:18,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:27:18,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:27:18,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:27:18,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:27:18,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:27:18,988 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:27:18,988 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:27:18,990 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:27:18,991 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:27:18,994 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:27:18,994 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:27:18,995 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:27:18,995 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:27:18,997 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:27:18,997 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:27:19,002 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:27:19,002 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:27:19,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:27:19,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:27:19,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:27:19,004 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:27:19,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:27:19,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:27:19,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:27:19,005 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:27:19,008 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:27:19,008 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:27:19,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:27:19,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:27:19,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:27:19,010 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:27:19,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:27:19,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:27:19,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:27:19,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:27:19,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:27:19,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:27:19,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:27:19,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:27:19,014 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:27:19,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:27:19,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:27:19,016 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:27:19,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:27:19,016 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_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/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_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje 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 -> 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 [2024-11-09 06:27:19,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:27:19,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:27:19,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:27:19,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:27:19,369 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:27:19,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/memsafety/test-0232-3.i Unable to find full path for "g++" [2024-11-09 06:27:21,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:27:22,180 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:27:22,181 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/sv-benchmarks/c/memsafety/test-0232-3.i [2024-11-09 06:27:22,197 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/data/adcfabe3f/6c5ed2c09f2248599a1338bc7f5d2dcc/FLAG19376f0bb [2024-11-09 06:27:22,215 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/data/adcfabe3f/6c5ed2c09f2248599a1338bc7f5d2dcc [2024-11-09 06:27:22,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:27:22,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:27:22,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:27:22,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:27:22,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:27:22,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:22,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b93821e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22, skipping insertion in model container [2024-11-09 06:27:22,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:22,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:27:22,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:27:22,816 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:27:22,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:27:22,936 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:27:22,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22 WrapperNode [2024-11-09 06:27:22,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:27:22,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:27:22,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:27:22,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:27:22,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:22,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:23,003 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2024-11-09 06:27:23,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:27:23,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:27:23,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:27:23,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:27:23,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:23,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:23,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:23,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:23,038 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:23,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:23,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:23,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:23,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:27:23,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:27:23,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:27:23,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:27:23,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (1/1) ... [2024-11-09 06:27:23,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:27:23,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:27:23,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:27:23,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:27:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:27:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:27:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:27:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:27:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:27:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:27:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 06:27:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:27:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:27:23,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:27:23,288 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:27:23,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:27:23,840 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-09 06:27:23,840 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:27:23,941 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:27:23,942 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 06:27:23,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:27:23 BoogieIcfgContainer [2024-11-09 06:27:23,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:27:23,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:27:23,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:27:23,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:27:23,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:27:22" (1/3) ... [2024-11-09 06:27:23,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6888c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:27:23, skipping insertion in model container [2024-11-09 06:27:23,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:22" (2/3) ... [2024-11-09 06:27:23,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6888c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:27:23, skipping insertion in model container [2024-11-09 06:27:23,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:27:23" (3/3) ... [2024-11-09 06:27:23,957 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232-3.i [2024-11-09 06:27:23,977 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:27:23,977 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-11-09 06:27:24,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:27:24,041 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@4f95f169, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:27:24,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-09 06:27:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 97 states have internal predecessors, (104), 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) [2024-11-09 06:27:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:27:24,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:24,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:27:24,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:24,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:24,063 INFO L85 PathProgramCache]: Analyzing trace with hash 174135, now seen corresponding path program 1 times [2024-11-09 06:27:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:24,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002965292] [2024-11-09 06:27:24,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:24,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:24,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002965292] [2024-11-09 06:27:24,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002965292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:24,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:24,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:24,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790776901] [2024-11-09 06:27:24,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:24,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:27:24,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:24,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:27:24,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:27:24,629 INFO L87 Difference]: Start difference. First operand has 98 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 97 states have internal predecessors, (104), 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 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 06:27:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:24,920 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-09 06:27:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:27:24,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 06:27:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:24,933 INFO L225 Difference]: With dead ends: 91 [2024-11-09 06:27:24,933 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 06:27:24,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:27:24,943 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 84 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:24,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 74 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:27:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 06:27:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 06:27:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 89 states have internal predecessors, (95), 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) [2024-11-09 06:27:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-09 06:27:24,999 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 3 [2024-11-09 06:27:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:25,000 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-09 06:27:25,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 06:27:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-09 06:27:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:27:25,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:25,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:27:25,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:27:25,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:25,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash 174136, now seen corresponding path program 1 times [2024-11-09 06:27:25,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:25,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978209550] [2024-11-09 06:27:25,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:25,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:25,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:25,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978209550] [2024-11-09 06:27:25,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978209550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:25,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:25,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:25,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759752850] [2024-11-09 06:27:25,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:25,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:27:25,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:25,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:27:25,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:27:25,283 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 06:27:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:25,572 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2024-11-09 06:27:25,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:27:25,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 06:27:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:25,574 INFO L225 Difference]: With dead ends: 110 [2024-11-09 06:27:25,574 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 06:27:25,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:27:25,576 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 77 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:25,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 87 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:27:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 06:27:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2024-11-09 06:27:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 2.02) internal successors, (101), 91 states have internal predecessors, (101), 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) [2024-11-09 06:27:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-11-09 06:27:25,585 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 3 [2024-11-09 06:27:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:25,586 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-11-09 06:27:25,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 06:27:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-11-09 06:27:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:27:25,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:25,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:27:25,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:27:25,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:25,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash 5398165, now seen corresponding path program 1 times [2024-11-09 06:27:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:25,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951135217] [2024-11-09 06:27:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:25,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:25,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951135217] [2024-11-09 06:27:25,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951135217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:25,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:25,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:25,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832173507] [2024-11-09 06:27:25,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:25,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:25,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:25,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:25,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:25,638 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-09 06:27:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:25,751 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-11-09 06:27:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:25,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-09 06:27:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:25,753 INFO L225 Difference]: With dead ends: 88 [2024-11-09 06:27:25,753 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 06:27:25,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:25,755 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:25,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 101 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:27:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 06:27:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 06:27:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.94) internal successors, (97), 87 states have internal predecessors, (97), 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) [2024-11-09 06:27:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-11-09 06:27:25,763 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 4 [2024-11-09 06:27:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:25,764 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-11-09 06:27:25,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-09 06:27:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-11-09 06:27:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:27:25,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:25,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:27:25,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:27:25,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:25,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash 5398166, now seen corresponding path program 1 times [2024-11-09 06:27:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:25,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825261469] [2024-11-09 06:27:25,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:25,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:25,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825261469] [2024-11-09 06:27:25,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825261469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:25,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:25,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:25,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514973787] [2024-11-09 06:27:25,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:25,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:25,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:25,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:25,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:25,860 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-09 06:27:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:25,951 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-11-09 06:27:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:25,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-09 06:27:25,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:25,952 INFO L225 Difference]: With dead ends: 84 [2024-11-09 06:27:25,952 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 06:27:25,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:25,954 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:25,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:27:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 06:27:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 06:27:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.86) internal successors, (93), 83 states have internal predecessors, (93), 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) [2024-11-09 06:27:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-11-09 06:27:25,966 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 4 [2024-11-09 06:27:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:25,966 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-11-09 06:27:25,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-09 06:27:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-11-09 06:27:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:27:25,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:25,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:25,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:27:25,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:25,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1015027421, now seen corresponding path program 1 times [2024-11-09 06:27:25,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:25,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899116037] [2024-11-09 06:27:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:25,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:26,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:26,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899116037] [2024-11-09 06:27:26,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899116037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:26,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:26,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:27:26,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255568571] [2024-11-09 06:27:26,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:26,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:27:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:26,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:27:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:27:26,289 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2024-11-09 06:27:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:26,632 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-11-09 06:27:26,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:27:26,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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 [2024-11-09 06:27:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:26,634 INFO L225 Difference]: With dead ends: 91 [2024-11-09 06:27:26,634 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 06:27:26,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:27:26,636 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 9 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:26,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 359 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:27:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 06:27:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-09 06:27:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 88 states have internal predecessors, (98), 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) [2024-11-09 06:27:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-11-09 06:27:26,652 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 8 [2024-11-09 06:27:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:26,656 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-11-09 06:27:26,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2024-11-09 06:27:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-11-09 06:27:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:27:26,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:26,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:26,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:27:26,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:26,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:26,659 INFO L85 PathProgramCache]: Analyzing trace with hash -257637593, now seen corresponding path program 1 times [2024-11-09 06:27:26,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:26,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752377877] [2024-11-09 06:27:26,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:26,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:26,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:26,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752377877] [2024-11-09 06:27:26,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752377877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:26,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:26,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:27:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309641678] [2024-11-09 06:27:26,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:26,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:27:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:26,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:27:26,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:27:26,908 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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) [2024-11-09 06:27:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:27,189 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2024-11-09 06:27:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:27:27,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2024-11-09 06:27:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:27,191 INFO L225 Difference]: With dead ends: 106 [2024-11-09 06:27:27,191 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 06:27:27,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:27:27,193 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 47 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:27,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 158 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:27:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 06:27:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2024-11-09 06:27:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 87 states have internal predecessors, (97), 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) [2024-11-09 06:27:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-11-09 06:27:27,200 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 13 [2024-11-09 06:27:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:27,201 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-11-09 06:27:27,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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) [2024-11-09 06:27:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-11-09 06:27:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:27:27,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:27,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:27,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:27:27,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:27,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash -257637592, now seen corresponding path program 1 times [2024-11-09 06:27:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:27,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349333467] [2024-11-09 06:27:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:27,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:27,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349333467] [2024-11-09 06:27:27,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349333467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:27,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:27,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:27:27,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227710314] [2024-11-09 06:27:27,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:27,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:27:27,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:27,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:27:27,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:27:27,618 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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) [2024-11-09 06:27:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:27,841 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2024-11-09 06:27:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:27:27,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2024-11-09 06:27:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:27,842 INFO L225 Difference]: With dead ends: 107 [2024-11-09 06:27:27,842 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 06:27:27,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:27:27,844 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 61 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:27,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 137 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:27:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 06:27:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2024-11-09 06:27:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 86 states have internal predecessors, (96), 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) [2024-11-09 06:27:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-09 06:27:27,851 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 13 [2024-11-09 06:27:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:27,851 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-09 06:27:27,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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) [2024-11-09 06:27:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-09 06:27:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 06:27:27,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:27,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:27,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:27:27,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:27,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1518468553, now seen corresponding path program 1 times [2024-11-09 06:27:27,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:27,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419702751] [2024-11-09 06:27:27,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:27,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:27,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419702751] [2024-11-09 06:27:27,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419702751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:27,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:27,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:27:27,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617581139] [2024-11-09 06:27:27,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:27,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:27:27,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:27,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:27:27,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:27:27,966 INFO L87 Difference]: Start difference. First operand 87 states and 96 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) [2024-11-09 06:27:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:28,137 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-09 06:27:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:27:28,138 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 [2024-11-09 06:27:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:28,139 INFO L225 Difference]: With dead ends: 86 [2024-11-09 06:27:28,139 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 06:27:28,139 INFO L431 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 [2024-11-09 06:27:28,140 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:28,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 161 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:27:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 06:27:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 06:27:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 85 states have internal predecessors, (95), 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) [2024-11-09 06:27:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-11-09 06:27:28,150 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 15 [2024-11-09 06:27:28,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:28,150 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-11-09 06:27:28,150 INFO L472 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) [2024-11-09 06:27:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-09 06:27:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 06:27:28,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:28,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:28,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:27:28,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:28,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1518468554, now seen corresponding path program 1 times [2024-11-09 06:27:28,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:28,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783891649] [2024-11-09 06:27:28,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:28,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:28,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783891649] [2024-11-09 06:27:28,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783891649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:28,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:28,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:27:28,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234949792] [2024-11-09 06:27:28,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:28,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:27:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:28,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:27:28,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:27:28,665 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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) [2024-11-09 06:27:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:28,974 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2024-11-09 06:27:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:27:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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 [2024-11-09 06:27:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:28,975 INFO L225 Difference]: With dead ends: 105 [2024-11-09 06:27:28,975 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 06:27:28,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:27:28,976 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 53 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:28,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 223 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:27:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 06:27:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2024-11-09 06:27:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.709090909090909) internal successors, (94), 84 states have internal predecessors, (94), 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) [2024-11-09 06:27:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-11-09 06:27:28,981 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 15 [2024-11-09 06:27:28,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:28,982 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-11-09 06:27:28,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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) [2024-11-09 06:27:28,982 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2024-11-09 06:27:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 06:27:28,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:28,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:28,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:27:28,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:28,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1550919856, now seen corresponding path program 1 times [2024-11-09 06:27:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:28,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603696658] [2024-11-09 06:27:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:28,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:29,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:29,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603696658] [2024-11-09 06:27:29,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603696658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:29,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:29,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:27:29,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26612481] [2024-11-09 06:27:29,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:29,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:27:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:29,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:27:29,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:27:29,140 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 5 states, 5 states have (on average 3.0) 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) [2024-11-09 06:27:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:29,293 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-11-09 06:27:29,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:27:29,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 [2024-11-09 06:27:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:29,295 INFO L225 Difference]: With dead ends: 81 [2024-11-09 06:27:29,295 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 06:27:29,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:27:29,296 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:29,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 196 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:27:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 06:27:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-09 06:27:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.7) internal successors, (85), 79 states have internal predecessors, (85), 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) [2024-11-09 06:27:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-09 06:27:29,304 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 15 [2024-11-09 06:27:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:29,308 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-09 06:27:29,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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) [2024-11-09 06:27:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-09 06:27:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 06:27:29,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:29,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:29,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:27:29,310 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:29,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:29,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1550919244, now seen corresponding path program 1 times [2024-11-09 06:27:29,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:29,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302329069] [2024-11-09 06:27:29,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:29,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:29,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:29,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302329069] [2024-11-09 06:27:29,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302329069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:29,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:29,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:27:29,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442203476] [2024-11-09 06:27:29,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:29,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:27:29,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:29,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:27:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:27:29,476 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 5 states, 5 states have (on average 3.0) 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) [2024-11-09 06:27:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:29,643 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-09 06:27:29,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:27:29,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 [2024-11-09 06:27:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:29,645 INFO L225 Difference]: With dead ends: 78 [2024-11-09 06:27:29,645 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 06:27:29,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:27:29,646 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 27 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:29,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 167 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:27:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 06:27:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 06:27:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 77 states have internal predecessors, (82), 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) [2024-11-09 06:27:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-09 06:27:29,653 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 15 [2024-11-09 06:27:29,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:29,653 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-09 06:27:29,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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) [2024-11-09 06:27:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-09 06:27:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 06:27:29,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:29,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:29,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:27:29,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:29,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:29,655 INFO L85 PathProgramCache]: Analyzing trace with hash -172115078, now seen corresponding path program 1 times [2024-11-09 06:27:29,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:29,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967751060] [2024-11-09 06:27:29,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:30,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:30,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967751060] [2024-11-09 06:27:30,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967751060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:30,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:30,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:27:30,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462079122] [2024-11-09 06:27:30,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:30,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:27:30,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:30,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:27:30,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:27:30,443 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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) [2024-11-09 06:27:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:31,044 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-11-09 06:27:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:27:31,045 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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 [2024-11-09 06:27:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:31,046 INFO L225 Difference]: With dead ends: 112 [2024-11-09 06:27:31,046 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 06:27:31,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-09 06:27:31,048 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 113 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:31,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 157 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:27:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 06:27:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2024-11-09 06:27:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 87 states have internal predecessors, (93), 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) [2024-11-09 06:27:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-09 06:27:31,056 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 16 [2024-11-09 06:27:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:31,057 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-09 06:27:31,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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) [2024-11-09 06:27:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-09 06:27:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 06:27:31,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:31,058 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:31,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:27:31,058 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:27:31,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:31,059 INFO L85 PathProgramCache]: Analyzing trace with hash 77199512, now seen corresponding path program 1 times [2024-11-09 06:27:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:31,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817218768] [2024-11-09 06:27:31,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:31,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817218768] [2024-11-09 06:27:31,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817218768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:27:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720404120] [2024-11-09 06:27:31,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:31,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:27:31,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:27:31,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:27:31,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:27:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:31,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 06:27:31,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:27:31,824 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:27:31,880 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 06:27:31,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 06:27:32,007 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 06:27:32,008 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 33 treesize of output 24 [2024-11-09 06:27:32,133 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:27:32,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 06:27:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:32,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:27:32,312 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 38 treesize of output 34 [2024-11-09 06:27:32,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:27:32,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-11-09 06:27:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:33,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720404120] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:27:33,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [262183307] [2024-11-09 06:27:33,758 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 06:27:33,758 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:27:33,762 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:27:33,768 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:27:33,768 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:27:35,393 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:28:02,591 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2499#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 2 |ULTIMATE.start_append_~plist#1.base|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) 0)) (= |ULTIMATE.start_append_~plist#1.offset| 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) 0)) 1)))' at error location [2024-11-09 06:28:02,592 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:28:02,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:28:02,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-09 06:28:02,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392029753] [2024-11-09 06:28:02,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:28:02,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 06:28:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:28:02,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 06:28:02,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=606, Unknown=5, NotChecked=0, Total=702 [2024-11-09 06:28:02,595 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 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) [2024-11-09 06:28:09,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:28:09,115 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-09 06:28:09,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:28:09,115 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 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 [2024-11-09 06:28:09,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:28:09,116 INFO L225 Difference]: With dead ends: 89 [2024-11-09 06:28:09,116 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 06:28:09,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=152, Invalid=835, Unknown=5, NotChecked=0, Total=992 [2024-11-09 06:28:09,118 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 56 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:28:09,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 346 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 06:28:09,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 06:28:09,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-09 06:28:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 86 states have internal predecessors, (92), 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) [2024-11-09 06:28:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-09 06:28:09,122 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 16 [2024-11-09 06:28:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:28:09,123 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-09 06:28:09,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 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) [2024-11-09 06:28:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-09 06:28:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 06:28:09,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:28:09,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:28:09,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:28:09,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 06:28:09,328 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:28:09,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:28:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash 77199513, now seen corresponding path program 1 times [2024-11-09 06:28:09,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:28:09,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488800743] [2024-11-09 06:28:09,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:28:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:28:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:28:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:28:10,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:28:10,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488800743] [2024-11-09 06:28:10,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488800743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:28:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616077517] [2024-11-09 06:28:10,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:28:10,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:28:10,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:28:10,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:28:10,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:28:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:28:10,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 06:28:10,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:28:10,794 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:28:10,806 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:28:11,008 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 06:28:11,009 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 24 treesize of output 27 [2024-11-09 06:28:11,078 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 06:28:11,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 06:28:11,392 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 06:28:11,393 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 39 treesize of output 30 [2024-11-09 06:28:11,463 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 06:28:11,463 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 1 case distinctions, treesize of input 38 treesize of output 29 [2024-11-09 06:28:11,758 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:28:11,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-11-09 06:28:11,774 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:28:11,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2024-11-09 06:28:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:28:11,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:28:12,722 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 32 treesize of output 28 [2024-11-09 06:28:12,790 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 66 treesize of output 62 [2024-11-09 06:28:12,806 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 102 treesize of output 94 [2024-11-09 06:28:13,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:28:13,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-11-09 06:28:13,431 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 68 treesize of output 64 [2024-11-09 06:28:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:28:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616077517] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:28:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [875302934] [2024-11-09 06:28:13,865 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 06:28:13,865 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:28:13,866 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:28:13,866 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:28:13,866 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:28:15,050 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:28:54,473 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2809#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 2 |ULTIMATE.start_append_~plist#1.base|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) 0) 8)) (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) 0) 4) 0)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| 0))' at error location [2024-11-09 06:28:54,473 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:28:54,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:28:54,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-11-09 06:28:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265454262] [2024-11-09 06:28:54,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:28:54,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 06:28:54,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:28:54,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 06:28:54,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=977, Unknown=8, NotChecked=0, Total=1122 [2024-11-09 06:28:54,476 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 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) [2024-11-09 06:28:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:28:57,859 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-09 06:28:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:28:57,860 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 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 [2024-11-09 06:28:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:28:57,861 INFO L225 Difference]: With dead ends: 88 [2024-11-09 06:28:57,861 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 06:28:57,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=214, Invalid=1260, Unknown=8, NotChecked=0, Total=1482 [2024-11-09 06:28:57,862 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 62 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:28:57,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 498 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 06:28:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 06:28:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-11-09 06:28:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 85 states have internal predecessors, (91), 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) [2024-11-09 06:28:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-09 06:28:57,866 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 16 [2024-11-09 06:28:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:28:57,867 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-09 06:28:57,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 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) [2024-11-09 06:28:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-09 06:28:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 06:28:57,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:28:57,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:28:57,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:28:58,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 06:28:58,070 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:28:58,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:28:58,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1040600023, now seen corresponding path program 1 times [2024-11-09 06:28:58,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:28:58,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995030902] [2024-11-09 06:28:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:28:58,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:28:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:28:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:28:59,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:28:59,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995030902] [2024-11-09 06:28:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995030902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:28:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:28:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:28:59,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871371435] [2024-11-09 06:28:59,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:28:59,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:28:59,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:28:59,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:28:59,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:28:59,160 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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) [2024-11-09 06:29:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:01,097 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2024-11-09 06:29:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:29:01,098 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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 17 [2024-11-09 06:29:01,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:01,099 INFO L225 Difference]: With dead ends: 107 [2024-11-09 06:29:01,099 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 06:29:01,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2024-11-09 06:29:01,100 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 102 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:01,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 122 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 06:29:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 06:29:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2024-11-09 06:29:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 86 states have internal predecessors, (92), 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) [2024-11-09 06:29:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-09 06:29:01,104 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 17 [2024-11-09 06:29:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:01,105 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-09 06:29:01,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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) [2024-11-09 06:29:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-09 06:29:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:29:01,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:01,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:01,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:29:01,107 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:29:01,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:01,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2101137756, now seen corresponding path program 1 times [2024-11-09 06:29:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:01,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039964915] [2024-11-09 06:29:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:02,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:02,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039964915] [2024-11-09 06:29:02,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039964915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:02,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:02,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:29:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966296729] [2024-11-09 06:29:02,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:02,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:29:02,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:02,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:29:02,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:29:02,035 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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) [2024-11-09 06:29:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:03,982 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-09 06:29:03,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:29:03,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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 18 [2024-11-09 06:29:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:03,983 INFO L225 Difference]: With dead ends: 98 [2024-11-09 06:29:03,984 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 06:29:03,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-09 06:29:03,984 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 84 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:03,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 167 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 06:29:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 06:29:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-11-09 06:29:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.55) internal successors, (93), 87 states have internal predecessors, (93), 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) [2024-11-09 06:29:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-09 06:29:03,989 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 18 [2024-11-09 06:29:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:03,990 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-09 06:29:03,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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) [2024-11-09 06:29:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-09 06:29:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:29:03,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:03,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:03,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:29:03,991 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:29:03,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:03,994 INFO L85 PathProgramCache]: Analyzing trace with hash 710761100, now seen corresponding path program 1 times [2024-11-09 06:29:03,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:03,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691301194] [2024-11-09 06:29:03,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:04,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:04,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691301194] [2024-11-09 06:29:04,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691301194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:04,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:04,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:29:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058404997] [2024-11-09 06:29:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:04,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:29:04,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:04,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:29:04,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:29:04,448 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:29:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:05,273 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-09 06:29:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:29:05,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 06:29:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:05,274 INFO L225 Difference]: With dead ends: 87 [2024-11-09 06:29:05,275 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 06:29:05,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:29:05,275 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 134 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:05,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 55 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:29:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 06:29:05,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 06:29:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 86 states have internal predecessors, (92), 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) [2024-11-09 06:29:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-09 06:29:05,279 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2024-11-09 06:29:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:05,280 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-09 06:29:05,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:29:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-09 06:29:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:29:05,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:05,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:05,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:29:05,282 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:29:05,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash 710761101, now seen corresponding path program 1 times [2024-11-09 06:29:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:05,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384728868] [2024-11-09 06:29:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:05,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:05,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:05,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384728868] [2024-11-09 06:29:05,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384728868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:05,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:05,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:29:05,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221287269] [2024-11-09 06:29:05,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:05,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:29:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:29:05,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:29:05,414 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2024-11-09 06:29:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:05,581 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-09 06:29:05,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:29:05,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 [2024-11-09 06:29:05,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:05,582 INFO L225 Difference]: With dead ends: 80 [2024-11-09 06:29:05,582 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 06:29:05,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:29:05,583 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:05,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 37 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:29:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 06:29:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 06:29:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.4) internal successors, (84), 79 states have internal predecessors, (84), 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) [2024-11-09 06:29:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-09 06:29:05,587 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 19 [2024-11-09 06:29:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:05,587 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-09 06:29:05,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2024-11-09 06:29:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-09 06:29:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:29:05,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:05,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:05,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:29:05,589 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:29:05,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:05,590 INFO L85 PathProgramCache]: Analyzing trace with hash 558757664, now seen corresponding path program 1 times [2024-11-09 06:29:05,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:05,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157746553] [2024-11-09 06:29:05,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:05,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:05,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:05,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157746553] [2024-11-09 06:29:05,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157746553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:05,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:05,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:29:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450145155] [2024-11-09 06:29:05,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:05,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:29:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:05,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:29:05,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:29:05,847 INFO L87 Difference]: Start difference. First operand 80 states and 84 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) [2024-11-09 06:29:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:06,277 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-09 06:29:06,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:29:06,277 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 [2024-11-09 06:29:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:06,278 INFO L225 Difference]: With dead ends: 79 [2024-11-09 06:29:06,278 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 06:29:06,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:29:06,279 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:06,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 145 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:29:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 06:29:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 06:29:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 78 states have internal predecessors, (83), 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) [2024-11-09 06:29:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-09 06:29:06,283 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 20 [2024-11-09 06:29:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:06,284 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-09 06:29:06,284 INFO L472 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) [2024-11-09 06:29:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-09 06:29:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:29:06,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:06,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:06,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:29:06,285 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:29:06,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash 141618508, now seen corresponding path program 1 times [2024-11-09 06:29:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:06,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130703128] [2024-11-09 06:29:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:06,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:06,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130703128] [2024-11-09 06:29:06,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130703128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:06,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:06,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:29:06,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084622768] [2024-11-09 06:29:06,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:06,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:29:06,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:06,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:29:06,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:29:06,583 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:29:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:07,201 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-09 06:29:07,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:29:07,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 06:29:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:07,202 INFO L225 Difference]: With dead ends: 78 [2024-11-09 06:29:07,203 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 06:29:07,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:29:07,205 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:07,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 115 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:29:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 06:29:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 06:29:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 77 states have internal predecessors, (82), 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) [2024-11-09 06:29:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-09 06:29:07,209 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 21 [2024-11-09 06:29:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:07,210 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-09 06:29:07,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:29:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-09 06:29:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:29:07,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:07,210 INFO L215 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] [2024-11-09 06:29:07,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:29:07,215 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:29:07,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:07,215 INFO L85 PathProgramCache]: Analyzing trace with hash 95206562, now seen corresponding path program 1 times [2024-11-09 06:29:07,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:07,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739267765] [2024-11-09 06:29:07,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:08,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:08,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739267765] [2024-11-09 06:29:08,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739267765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:08,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:08,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 06:29:08,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565053955] [2024-11-09 06:29:08,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:08,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:29:08,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:08,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:29:08,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:29:08,738 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:29:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:10,372 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-11-09 06:29:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:29:10,373 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 06:29:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:10,374 INFO L225 Difference]: With dead ends: 85 [2024-11-09 06:29:10,374 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 06:29:10,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:29:10,375 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 32 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:10,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 166 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 06:29:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 06:29:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-09 06:29:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.34375) internal successors, (86), 81 states have internal predecessors, (86), 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) [2024-11-09 06:29:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-11-09 06:29:10,379 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 22 [2024-11-09 06:29:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:10,380 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-11-09 06:29:10,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:29:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-11-09 06:29:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 06:29:10,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:10,381 INFO L215 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] [2024-11-09 06:29:10,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:29:10,381 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:29:10,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:10,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1343563761, now seen corresponding path program 1 times [2024-11-09 06:29:10,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:10,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605702668] [2024-11-09 06:29:10,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:10,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:10,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605702668] [2024-11-09 06:29:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605702668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:29:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172614073] [2024-11-09 06:29:10,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:10,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:29:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:10,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:29:10,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:29:10,768 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 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) [2024-11-09 06:29:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:11,525 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-11-09 06:29:11,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:29:11,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 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 [2024-11-09 06:29:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:11,527 INFO L225 Difference]: With dead ends: 81 [2024-11-09 06:29:11,527 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 06:29:11,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:29:11,528 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 66 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:11,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 86 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:29:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 06:29:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 06:29:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.328125) internal successors, (85), 80 states have internal predecessors, (85), 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) [2024-11-09 06:29:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-09 06:29:11,532 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 23 [2024-11-09 06:29:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:11,532 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-09 06:29:11,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 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) [2024-11-09 06:29:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-09 06:29:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:29:11,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:11,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:11,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:29:11,534 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 06:29:11,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:11,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1423402907, now seen corresponding path program 1 times [2024-11-09 06:29:11,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:11,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591383049] [2024-11-09 06:29:11,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:14,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:14,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591383049] [2024-11-09 06:29:14,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591383049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:29:14,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244073496] [2024-11-09 06:29:14,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:14,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:29:14,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:29:14,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:29:14,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526e5bb8-69b3-46c4-b746-971fb6f70518/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:29:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:14,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-09 06:29:14,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:29:14,502 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:29:14,641 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:29:14,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:29:15,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:29:15,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:29:15,488 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 23 treesize of output 22 [2024-11-09 06:29:15,803 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 06:29:15,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 06:29:16,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:29:16,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:29:16,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2024-11-09 06:29:16,418 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:29:16,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:29:16,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2024-11-09 06:29:16,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:29:16,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2024-11-09 06:29:17,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:29:17,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-09 06:29:18,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:29:18,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2024-11-09 06:29:18,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:29:18,908 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:29:18,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2024-11-09 06:29:19,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:29:19,327 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:29:19,355 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-11-09 06:29:19,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 24 [2024-11-09 06:29:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:19,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:29:19,661 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 80 treesize of output 76 [2024-11-09 06:29:22,128 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|) |c_ULTIMATE.start_append_#t~ite9#1.offset|)))) (store .cse4 |c_ULTIMATE.start_append_~plist#1.base| (store (select .cse4 |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|))))) (let ((.cse3 (+ (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4)) (.cse0 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse1 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|))) (or (and .cse0 .cse1 (= (select (select .cse2 |c_ULTIMATE.start_append_~item~0#1.base|) .cse3) 0)) (and (forall ((v_arrayElimCell_56 Int)) (= (select (select .cse2 v_arrayElimCell_56) .cse3) 0)) (or (not .cse0) (not .cse1)))))) is different from false [2024-11-09 06:29:24,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_#t~mem6#1.base|) (+ |c_ULTIMATE.start_append_#t~mem6#1.offset| 4)))))) (store .cse4 |c_ULTIMATE.start_append_~plist#1.base| (store (select .cse4 |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|))))) (let ((.cse1 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4)) (.cse2 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse3 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|))) (or (and (forall ((v_arrayElimCell_56 Int)) (= (select (select .cse0 v_arrayElimCell_56) .cse1) 0)) (or (not .cse2) (not .cse3))) (and (= (select (select .cse0 |c_ULTIMATE.start_append_~item~0#1.base|) .cse1) 0) .cse2 .cse3)))) is different from false [2024-11-09 06:29:34,834 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 428 treesize of output 420 [2024-11-09 06:29:35,080 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 1271 treesize of output 1247 [2024-11-09 06:29:36,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 636 treesize of output 624 [2024-11-09 06:29:39,010 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (let ((.cse5 (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse6 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|)) (.cse39 (select .cse5 |c_ULTIMATE.start_append_~plist#1.offset|))) (let ((.cse31 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse38 (+ .cse39 4)) (.cse32 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse74 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse40 (not .cse6))) (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (forall ((|v_ULTIMATE.start_append_~plist#1.offset_24| Int)) (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~plist#1.offset_24|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~plist#1.offset_24|) (< |v_ULTIMATE.start_append_~plist#1.offset_24| 0) (= |v_ULTIMATE.start_append_~plist#1.offset_24| |c_ULTIMATE.start_append_~plist#1.offset|) (forall ((v_arrayElimCell_59 Int) (v_arrayElimCell_56 Int)) (= (let ((.cse0 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (let ((.cse4 (select .cse5 |v_ULTIMATE.start_append_~plist#1.offset_24|))) (let ((.cse3 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse4))) (store .cse3 4 (select (select (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse3) v_arrayElimCell_59) (+ .cse4 4)))))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| .cse1) v_arrayElimCell_56) (+ (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4)))) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1)))) (or .cse6 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~plist#1.offset_24| Int) (v_arrayElimCell_56 Int)) (let ((.cse16 (select .cse5 |v_ULTIMATE.start_append_~plist#1.offset_24|))) (let ((.cse11 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse16))) (let ((.cse12 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse11)) (.cse13 (+ .cse16 4))) (let ((.cse15 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (store .cse11 4 (select (select .cse12 v_arrayElimCell_58) .cse13))))) (let ((.cse14 (store (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (let ((.cse7 (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.base| .cse14)) (.cse8 (+ (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (< |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~plist#1.offset_24|) (= (select (select .cse7 |v_ULTIMATE.start_append_~item~0#1.base_37|) .cse8) 0) (= (let ((.cse9 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (store .cse11 4 (select (select .cse12 |c_ULTIMATE.start_append_~item~0#1.base|) .cse13))))) (let ((.cse10 (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (select (select (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| .cse10) v_arrayElimCell_56) (+ (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4)))) 0) (= (select (select .cse7 v_arrayElimCell_56) .cse8) 0) (< |v_ULTIMATE.start_append_~plist#1.offset_24| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1))))))))))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int) (|v_ULTIMATE.start_append_~plist#1.offset_24| Int) (v_arrayElimCell_59 Int) (v_arrayElimCell_56 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (< |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~plist#1.offset_24|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~plist#1.offset_24|) (< |v_ULTIMATE.start_append_~plist#1.offset_24| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1)) (= (let ((.cse17 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (let ((.cse20 (select .cse5 |v_ULTIMATE.start_append_~plist#1.offset_24|))) (let ((.cse19 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse20))) (store .cse19 4 (select (select (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse19) v_arrayElimCell_59) (+ .cse20 4)))))))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (select (select (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| .cse18) v_arrayElimCell_56) (+ (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4)))) 0))) .cse6) (forall ((|v_ULTIMATE.start_append_~plist#1.offset_24| Int)) (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~plist#1.offset_24|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_56 Int)) (let ((.cse30 (select .cse5 |v_ULTIMATE.start_append_~plist#1.offset_24|))) (let ((.cse25 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse30))) (let ((.cse26 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse25)) (.cse27 (+ .cse30 4))) (let ((.cse29 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (store .cse25 4 (select (select .cse26 v_arrayElimCell_58) .cse27))))) (let ((.cse28 (store (select .cse29 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (let ((.cse21 (store .cse29 |c_ULTIMATE.start_main_~#list~0#1.base| .cse28)) (.cse22 (+ (select .cse28 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (= (select (select .cse21 |v_ULTIMATE.start_append_~item~0#1.base_37|) .cse22) 0) (= (let ((.cse23 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (store .cse25 4 (select (select .cse26 |c_ULTIMATE.start_append_~item~0#1.base|) .cse27))))) (let ((.cse24 (store (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (select (select (store .cse23 |c_ULTIMATE.start_main_~#list~0#1.base| .cse24) v_arrayElimCell_56) (+ (select .cse24 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4)))) 0) (= (select (select .cse21 v_arrayElimCell_56) .cse22) 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1)))))))))) (< |v_ULTIMATE.start_append_~plist#1.offset_24| 0) (= |v_ULTIMATE.start_append_~plist#1.offset_24| |c_ULTIMATE.start_append_~plist#1.offset|))) (or .cse31 .cse32 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int) (v_arrayElimCell_56 Int)) (let ((.cse36 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (let ((.cse37 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse39))) (store .cse37 4 (select (select (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse37) |c_ULTIMATE.start_append_~item~0#1.base|) .cse38)))))) (let ((.cse35 (store (select .cse36 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| 0))) (let ((.cse33 (store .cse36 |c_ULTIMATE.start_main_~#list~0#1.base| .cse35)) (.cse34 (+ (select .cse35 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (= (select (select .cse33 v_arrayElimCell_56) .cse34) 0) (= (select (select .cse33 |v_ULTIMATE.start_append_~item~0#1.base_37|) .cse34) 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1))))))) .cse40) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (forall ((|v_ULTIMATE.start_append_~plist#1.offset_24| Int)) (or (forall ((v_arrayElimCell_56 Int)) (let ((.cse48 (select .cse5 |v_ULTIMATE.start_append_~plist#1.offset_24|))) (let ((.cse43 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse48))) (let ((.cse44 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse43)) (.cse45 (+ .cse48 4))) (or (forall ((v_arrayElimCell_59 Int)) (= (let ((.cse41 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (store .cse43 4 (select (select .cse44 v_arrayElimCell_59) .cse45))))) (let ((.cse42 (store (select .cse41 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (select (select (store .cse41 |c_ULTIMATE.start_main_~#list~0#1.base| .cse42) v_arrayElimCell_56) (+ (select .cse42 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4)))) 0)) (= (let ((.cse46 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (store .cse43 4 (select (select .cse44 |c_ULTIMATE.start_append_~item~0#1.base|) .cse45))))) (let ((.cse47 (store (select .cse46 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (select (select (store .cse46 |c_ULTIMATE.start_main_~#list~0#1.base| .cse47) v_arrayElimCell_56) (+ (select .cse47 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4)))) 0)))))) (< |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~plist#1.offset_24|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~plist#1.offset_24|) (< |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1)))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~plist#1.offset_24| Int) (v_arrayElimCell_56 Int)) (let ((.cse52 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (let ((.cse54 (select .cse5 |v_ULTIMATE.start_append_~plist#1.offset_24|))) (let ((.cse53 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse54))) (store .cse53 4 (select (select (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse53) v_arrayElimCell_58) (+ .cse54 4)))))))) (let ((.cse51 (store (select .cse52 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (let ((.cse49 (store .cse52 |c_ULTIMATE.start_main_~#list~0#1.base| .cse51)) (.cse50 (+ (select .cse51 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (< |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~plist#1.offset_24|) (= (select (select .cse49 |v_ULTIMATE.start_append_~item~0#1.base_37|) .cse50) 0) (= (select (select .cse49 v_arrayElimCell_56) .cse50) 0) (< |v_ULTIMATE.start_append_~plist#1.offset_24| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1))))))) .cse6) (forall ((|v_ULTIMATE.start_append_~plist#1.offset_24| Int)) (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~plist#1.offset_24|) (< |v_ULTIMATE.start_append_~plist#1.offset_24| 0) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_56 Int)) (let ((.cse66 (select .cse5 |v_ULTIMATE.start_append_~plist#1.offset_24|))) (let ((.cse63 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse66))) (let ((.cse64 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse63)) (.cse65 (+ .cse66 4))) (let ((.cse62 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (store .cse63 4 (select (select .cse64 |c_ULTIMATE.start_append_~item~0#1.base|) .cse65)))) (.cse60 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (store .cse63 4 (select (select .cse64 v_arrayElimCell_58) .cse65))))) (let ((.cse59 (store (select .cse60 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0)) (.cse61 (store (select .cse62 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (let ((.cse55 (store .cse62 |c_ULTIMATE.start_main_~#list~0#1.base| .cse61)) (.cse56 (+ (select .cse61 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4)) (.cse57 (store .cse60 |c_ULTIMATE.start_main_~#list~0#1.base| .cse59)) (.cse58 (+ (select .cse59 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (= (select (select .cse55 |v_ULTIMATE.start_append_~item~0#1.base_37|) .cse56) 0) (= (select (select .cse57 |v_ULTIMATE.start_append_~item~0#1.base_37|) .cse58) 0) (= (select (select .cse55 v_arrayElimCell_56) .cse56) 0) (= (select (select .cse57 v_arrayElimCell_56) .cse58) 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1)))))))))))) (forall ((|v_ULTIMATE.start_append_~plist#1.offset_24| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_56 Int)) (let ((.cse70 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (let ((.cse72 (select .cse5 |v_ULTIMATE.start_append_~plist#1.offset_24|))) (let ((.cse71 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse72))) (store .cse71 4 (select (select (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse71) v_arrayElimCell_58) (+ .cse72 4)))))))) (let ((.cse69 (store (select .cse70 |c_ULTIMATE.start_main_~#list~0#1.base|) |v_ULTIMATE.start_append_~plist#1.offset_24| 0))) (let ((.cse67 (store .cse70 |c_ULTIMATE.start_main_~#list~0#1.base| .cse69)) (.cse68 (+ (select .cse69 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (= (select (select .cse67 |v_ULTIMATE.start_append_~item~0#1.base_37|) .cse68) 0) (= (select (select .cse67 v_arrayElimCell_56) .cse68) 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1))))))) (< |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~plist#1.offset_24|) (< |v_ULTIMATE.start_append_~plist#1.offset_24| 0) (= |v_ULTIMATE.start_append_~plist#1.offset_24| |c_ULTIMATE.start_append_~plist#1.offset|))) (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (let ((.cse78 (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse77 (+ 4 .cse78))) (let ((.cse73 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int) (v_arrayElimCell_57 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (= (select (select (let ((.cse83 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (let ((.cse84 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse78))) (store .cse84 4 (select (select (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse84) v_arrayElimCell_57) .cse77)))))) (store .cse83 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse83 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) |v_ULTIMATE.start_append_~item~0#1.base_37|) 4) 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1)))))) (and (or .cse73 .cse74) (or .cse73 .cse6) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (= (select (select (let ((.cse75 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (let ((.cse76 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse78))) (store .cse76 4 (select (select (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse76) |c_ULTIMATE.start_append_~item~0#1.base|) .cse77)))))) (store .cse75 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse75 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) |v_ULTIMATE.start_append_~item~0#1.base_37|) 4) 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1)))) (not .cse74) .cse40) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int) (v_arrayElimCell_57 Int)) (let ((.cse80 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse78))) (let ((.cse81 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse80))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (= (select (select (let ((.cse79 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (store .cse80 4 (select (select .cse81 |c_ULTIMATE.start_append_~item~0#1.base|) .cse77))))) (store .cse79 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse79 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) |v_ULTIMATE.start_append_~item~0#1.base_37|) 4) 0) (= (select (select (let ((.cse82 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (store .cse80 4 (select (select .cse81 v_arrayElimCell_57) .cse77))))) (store .cse82 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse82 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) |v_ULTIMATE.start_append_~item~0#1.base_37|) 4) 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1))))))))))) (or .cse31 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_37| Int) (v_arrayElimCell_56 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_37|) 0)) (= (let ((.cse85 (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| (let ((.cse87 (store (select .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37|) 0 .cse39))) (store .cse87 4 (select (select (store .cse2 |v_ULTIMATE.start_append_~item~0#1.base_37| .cse87) |c_ULTIMATE.start_append_~item~0#1.base|) .cse38)))))) (let ((.cse86 (store (select .cse85 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| 0))) (select (select (store .cse85 |c_ULTIMATE.start_main_~#list~0#1.base| .cse86) v_arrayElimCell_56) (+ (select .cse86 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4)))) 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_~item~0#1.base_37| 1)))) .cse32 .cse74 .cse40)))))) is different from true [2024-11-09 06:29:52,851 INFO L224 Elim1Store]: Index analysis took 123 ms