./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-1.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_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/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_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/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_8baff4f0-af1c-4814-8634-b9f1f490da21/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 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:52:43,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:52:43,938 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:52:43,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:52:43,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:52:43,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:52:43,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:52:43,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:52:43,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:52:43,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:52:43,993 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:52:43,994 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:52:43,994 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:52:43,997 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:52:43,997 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:52:43,997 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:52:43,998 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:52:44,014 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:52:44,018 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:52:44,019 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:52:44,019 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:52:44,019 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:52:44,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:52:44,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:52:44,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:52:44,021 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:52:44,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:52:44,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:52:44,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:52:44,022 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:52:44,022 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:52:44,022 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:52:44,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:52:44,023 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:52:44,023 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:52:44,023 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:52:44,023 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:52:44,023 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:52:44,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:52:44,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:52:44,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:52:44,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:52:44,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:52:44,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:52:44,026 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:52:44,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:52:44,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:52:44,027 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:52:44,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:52:44,027 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_8baff4f0-af1c-4814-8634-b9f1f490da21/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_8baff4f0-af1c-4814-8634-b9f1f490da21/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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2024-11-09 05:52:44,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:52:44,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:52:44,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:52:44,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:52:44,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:52:44,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/forester-heap/dll-optional-1.i Unable to find full path for "g++" [2024-11-09 05:52:46,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:52:46,579 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:52:46,580 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/sv-benchmarks/c/forester-heap/dll-optional-1.i [2024-11-09 05:52:46,597 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/data/747619906/b7d9bf41e0a64ba9b198400eb46888f1/FLAGd0417eef4 [2024-11-09 05:52:46,914 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/data/747619906/b7d9bf41e0a64ba9b198400eb46888f1 [2024-11-09 05:52:46,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:52:46,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:52:46,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:52:46,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:52:46,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:52:46,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:52:46" (1/1) ... [2024-11-09 05:52:46,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be4122a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:46, skipping insertion in model container [2024-11-09 05:52:46,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:52:46" (1/1) ... [2024-11-09 05:52:47,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:52:47,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:52:47,426 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:52:47,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:52:47,509 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:52:47,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47 WrapperNode [2024-11-09 05:52:47,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:52:47,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:52:47,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:52:47,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:52:47,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (1/1) ... [2024-11-09 05:52:47,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (1/1) ... [2024-11-09 05:52:47,563 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2024-11-09 05:52:47,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:52:47,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:52:47,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:52:47,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:52:47,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (1/1) ... [2024-11-09 05:52:47,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (1/1) ... [2024-11-09 05:52:47,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (1/1) ... [2024-11-09 05:52:47,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (1/1) ... [2024-11-09 05:52:47,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (1/1) ... [2024-11-09 05:52:47,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (1/1) ... [2024-11-09 05:52:47,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (1/1) ... [2024-11-09 05:52:47,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (1/1) ... [2024-11-09 05:52:47,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:52:47,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:52:47,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:52:47,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:52:47,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (1/1) ... [2024-11-09 05:52:47,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:52:47,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:52:47,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:52:47,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:52:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:52:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:52:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:52:47,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:52:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:52:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:52:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:52:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:52:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:52:47,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:52:47,814 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:52:47,816 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:52:48,363 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2024-11-09 05:52:48,363 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:52:48,443 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:52:48,443 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 05:52:48,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:52:48 BoogieIcfgContainer [2024-11-09 05:52:48,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:52:48,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:52:48,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:52:48,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:52:48,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:52:46" (1/3) ... [2024-11-09 05:52:48,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6ff721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:52:48, skipping insertion in model container [2024-11-09 05:52:48,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:52:47" (2/3) ... [2024-11-09 05:52:48,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6ff721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:52:48, skipping insertion in model container [2024-11-09 05:52:48,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:52:48" (3/3) ... [2024-11-09 05:52:48,455 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2024-11-09 05:52:48,474 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:52:48,474 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2024-11-09 05:52:48,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:52:48,532 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;@2b26b339, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:52:48,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2024-11-09 05:52:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 65 states have (on average 2.3846153846153846) internal successors, (155), 137 states have internal predecessors, (155), 0 states have call successors, (0), 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 05:52:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:52:48,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:48,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:52:48,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:48,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash 9025, now seen corresponding path program 1 times [2024-11-09 05:52:48,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:48,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656603902] [2024-11-09 05:52:48,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:48,843 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 05:52:48,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:48,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656603902] [2024-11-09 05:52:48,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656603902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:48,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:48,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:52:48,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893610479] [2024-11-09 05:52:48,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:48,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:52:48,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:52:48,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:52:48,882 INFO L87 Difference]: Start difference. First operand has 138 states, 65 states have (on average 2.3846153846153846) internal successors, (155), 137 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:49,086 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2024-11-09 05:52:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:52:49,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-09 05:52:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:49,099 INFO L225 Difference]: With dead ends: 131 [2024-11-09 05:52:49,099 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 05:52:49,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:52:49,105 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:49,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 74 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 05:52:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-09 05:52:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 128 states have internal predecessors, (143), 0 states have call successors, (0), 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 05:52:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2024-11-09 05:52:49,151 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 2 [2024-11-09 05:52:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:49,152 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2024-11-09 05:52:49,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2024-11-09 05:52:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:52:49,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:49,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:52:49,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:52:49,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:49,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:49,154 INFO L85 PathProgramCache]: Analyzing trace with hash 9026, now seen corresponding path program 1 times [2024-11-09 05:52:49,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:49,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006541968] [2024-11-09 05:52:49,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:49,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:49,263 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 05:52:49,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:49,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006541968] [2024-11-09 05:52:49,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006541968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:49,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:49,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:52:49,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934246305] [2024-11-09 05:52:49,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:49,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:52:49,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:49,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:52:49,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:52:49,268 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:49,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:49,486 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2024-11-09 05:52:49,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:52:49,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-09 05:52:49,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:49,489 INFO L225 Difference]: With dead ends: 120 [2024-11-09 05:52:49,489 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 05:52:49,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:52:49,490 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 96 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:49,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 88 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 05:52:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 05:52:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 2.0) internal successors, (134), 119 states have internal predecessors, (134), 0 states have call successors, (0), 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 05:52:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2024-11-09 05:52:49,508 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 2 [2024-11-09 05:52:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:49,508 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2024-11-09 05:52:49,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2024-11-09 05:52:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 05:52:49,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:49,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:52:49,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:52:49,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:49,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:49,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1514353690, now seen corresponding path program 1 times [2024-11-09 05:52:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:49,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103862995] [2024-11-09 05:52:49,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:49,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:49,835 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 05:52:49,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:49,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103862995] [2024-11-09 05:52:49,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103862995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:49,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:49,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:52:49,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413848698] [2024-11-09 05:52:49,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:49,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:52:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:49,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:52:49,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:52:49,838 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 05:52:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:50,130 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2024-11-09 05:52:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:52:50,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 05:52:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:50,133 INFO L225 Difference]: With dead ends: 157 [2024-11-09 05:52:50,135 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 05:52:50,136 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 05:52:50,137 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 43 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:50,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 281 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:52:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 05:52:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 119. [2024-11-09 05:52:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 118 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2024-11-09 05:52:50,153 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 8 [2024-11-09 05:52:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:50,154 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2024-11-09 05:52:50,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 05:52:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2024-11-09 05:52:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 05:52:50,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:50,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:52:50,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:52:50,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:50,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:50,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1514353691, now seen corresponding path program 1 times [2024-11-09 05:52:50,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:50,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214612781] [2024-11-09 05:52:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:50,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:50,469 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 05:52:50,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:50,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214612781] [2024-11-09 05:52:50,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214612781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:50,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:50,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:52:50,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473101986] [2024-11-09 05:52:50,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:50,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:52:50,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:50,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:52:50,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:52:50,473 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 05:52:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:50,750 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2024-11-09 05:52:50,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:52:50,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 05:52:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:50,751 INFO L225 Difference]: With dead ends: 118 [2024-11-09 05:52:50,752 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 05:52:50,752 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 05:52:50,753 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:50,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 310 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 05:52:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 05:52:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 117 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2024-11-09 05:52:50,761 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 8 [2024-11-09 05:52:50,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:50,761 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2024-11-09 05:52:50,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 05:52:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2024-11-09 05:52:50,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:52:50,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:50,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:52:50,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:52:50,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:50,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash -964300061, now seen corresponding path program 1 times [2024-11-09 05:52:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:50,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740535681] [2024-11-09 05:52:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:50,887 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 05:52:50,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740535681] [2024-11-09 05:52:50,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740535681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:50,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:50,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:52:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78440226] [2024-11-09 05:52:50,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:50,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:52:50,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:50,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:52:50,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:52:50,897 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 05:52:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:51,111 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2024-11-09 05:52:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:52:51,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 05:52:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:51,112 INFO L225 Difference]: With dead ends: 113 [2024-11-09 05:52:51,112 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 05:52:51,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:52:51,114 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 137 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:51,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 57 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 05:52:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2024-11-09 05:52:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 110 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2024-11-09 05:52:51,120 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 11 [2024-11-09 05:52:51,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:51,121 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2024-11-09 05:52:51,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 05:52:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2024-11-09 05:52:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:52:51,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:51,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:52:51,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:52:51,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:51,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:51,123 INFO L85 PathProgramCache]: Analyzing trace with hash -964300060, now seen corresponding path program 1 times [2024-11-09 05:52:51,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:51,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500271444] [2024-11-09 05:52:51,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:51,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:51,301 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 05:52:51,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:51,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500271444] [2024-11-09 05:52:51,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500271444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:51,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:51,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:52:51,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228391916] [2024-11-09 05:52:51,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:51,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:52:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:52:51,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:52:51,304 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 05:52:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:51,517 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2024-11-09 05:52:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:52:51,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 05:52:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:51,519 INFO L225 Difference]: With dead ends: 147 [2024-11-09 05:52:51,523 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 05:52:51,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:52:51,524 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 149 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:51,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 101 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 05:52:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2024-11-09 05:52:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 99 states have (on average 1.6868686868686869) internal successors, (167), 135 states have internal predecessors, (167), 0 states have call successors, (0), 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 05:52:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 167 transitions. [2024-11-09 05:52:51,531 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 167 transitions. Word has length 11 [2024-11-09 05:52:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:51,531 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 167 transitions. [2024-11-09 05:52:51,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 05:52:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2024-11-09 05:52:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:52:51,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:51,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:52:51,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:52:51,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:51,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1020765737, now seen corresponding path program 1 times [2024-11-09 05:52:51,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:51,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283750923] [2024-11-09 05:52:51,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:51,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:51,701 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 05:52:51,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283750923] [2024-11-09 05:52:51,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283750923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:51,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:51,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:52:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772225700] [2024-11-09 05:52:51,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:51,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:52:51,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:51,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:52:51,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:52:51,703 INFO L87 Difference]: Start difference. First operand 136 states and 167 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 05:52:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:51,903 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2024-11-09 05:52:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:52:51,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 05:52:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:51,904 INFO L225 Difference]: With dead ends: 135 [2024-11-09 05:52:51,904 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 05:52:51,905 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 05:52:51,908 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:51,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 255 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 05:52:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 05:52:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 134 states have internal predecessors, (165), 0 states have call successors, (0), 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 05:52:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 165 transitions. [2024-11-09 05:52:51,919 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 165 transitions. Word has length 13 [2024-11-09 05:52:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:51,920 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 165 transitions. [2024-11-09 05:52:51,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 05:52:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 165 transitions. [2024-11-09 05:52:51,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:52:51,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:51,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:52:51,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:52:51,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:51,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:51,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1020765738, now seen corresponding path program 1 times [2024-11-09 05:52:51,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:51,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413840088] [2024-11-09 05:52:51,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:51,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:52,186 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 05:52:52,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:52,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413840088] [2024-11-09 05:52:52,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413840088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:52,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:52,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:52:52,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657842760] [2024-11-09 05:52:52,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:52,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:52:52,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:52,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:52:52,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:52:52,189 INFO L87 Difference]: Start difference. First operand 135 states and 165 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 05:52:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:52,400 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2024-11-09 05:52:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:52:52,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 05:52:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:52,402 INFO L225 Difference]: With dead ends: 134 [2024-11-09 05:52:52,402 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 05:52:52,402 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 05:52:52,403 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:52,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 244 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 05:52:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 05:52:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 99 states have (on average 1.6464646464646464) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2024-11-09 05:52:52,409 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 13 [2024-11-09 05:52:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:52,409 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2024-11-09 05:52:52,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 05:52:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2024-11-09 05:52:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:52:52,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:52,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:52:52,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:52:52,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:52,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1703518416, now seen corresponding path program 1 times [2024-11-09 05:52:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:52,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670619607] [2024-11-09 05:52:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:52,716 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 05:52:52,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:52,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670619607] [2024-11-09 05:52:52,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670619607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:52,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:52,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:52:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534590011] [2024-11-09 05:52:52,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:52,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:52:52,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:52,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:52:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:52:52,724 INFO L87 Difference]: Start difference. First operand 134 states and 163 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 05:52:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:53,142 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2024-11-09 05:52:53,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:52:53,143 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 05:52:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:53,144 INFO L225 Difference]: With dead ends: 134 [2024-11-09 05:52:53,144 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 05:52:53,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 05:52:53,145 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 132 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:53,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 164 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:52:53,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 05:52:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2024-11-09 05:52:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.6363636363636365) internal successors, (162), 132 states have internal predecessors, (162), 0 states have call successors, (0), 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 05:52:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2024-11-09 05:52:53,155 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 15 [2024-11-09 05:52:53,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:53,156 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2024-11-09 05:52:53,156 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 05:52:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2024-11-09 05:52:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:52:53,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:53,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:52:53,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:52:53,160 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:53,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:53,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1703518417, now seen corresponding path program 1 times [2024-11-09 05:52:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:53,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005088071] [2024-11-09 05:52:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:53,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:53,555 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 05:52:53,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:53,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005088071] [2024-11-09 05:52:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005088071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:53,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:53,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:52:53,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468502340] [2024-11-09 05:52:53,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:53,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:52:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:53,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:52:53,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:52:53,558 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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 05:52:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:54,111 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2024-11-09 05:52:54,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:52:54,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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 05:52:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:54,113 INFO L225 Difference]: With dead ends: 124 [2024-11-09 05:52:54,113 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 05:52:54,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-09 05:52:54,114 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 139 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:54,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 202 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:52:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 05:52:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2024-11-09 05:52:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.5483870967741935) internal successors, (144), 115 states have internal predecessors, (144), 0 states have call successors, (0), 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 05:52:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2024-11-09 05:52:54,119 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 15 [2024-11-09 05:52:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:54,120 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2024-11-09 05:52:54,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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 05:52:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2024-11-09 05:52:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:52:54,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:54,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:52:54,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:52:54,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:54,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash 47513774, now seen corresponding path program 1 times [2024-11-09 05:52:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147264619] [2024-11-09 05:52:54,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:54,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:54,178 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 05:52:54,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:54,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147264619] [2024-11-09 05:52:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147264619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:54,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:54,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:52:54,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142597288] [2024-11-09 05:52:54,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:54,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:52:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:54,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:52:54,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:52:54,181 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 05:52:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:54,297 INFO L93 Difference]: Finished difference Result 128 states and 152 transitions. [2024-11-09 05:52:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:52:54,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 05:52:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:54,298 INFO L225 Difference]: With dead ends: 128 [2024-11-09 05:52:54,298 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 05:52:54,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 05:52:54,299 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 115 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:54,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 113 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:52:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 05:52:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2024-11-09 05:52:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 115 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2024-11-09 05:52:54,304 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 16 [2024-11-09 05:52:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:54,304 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2024-11-09 05:52:54,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 05:52:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2024-11-09 05:52:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 05:52:54,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:54,308 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 05:52:54,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:52:54,309 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:54,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:54,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1667235222, now seen corresponding path program 1 times [2024-11-09 05:52:54,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:54,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823312945] [2024-11-09 05:52:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:54,362 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 05:52:54,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:54,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823312945] [2024-11-09 05:52:54,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823312945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:54,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:54,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:52:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749342363] [2024-11-09 05:52:54,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:54,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:52:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:52:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:52:54,364 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 05:52:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:54,434 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2024-11-09 05:52:54,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:52:54,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 05:52:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:54,435 INFO L225 Difference]: With dead ends: 122 [2024-11-09 05:52:54,435 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 05:52:54,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:52:54,436 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:54,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 227 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:52:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 05:52:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-09 05:52:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.5051546391752577) internal successors, (146), 119 states have internal predecessors, (146), 0 states have call successors, (0), 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 05:52:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2024-11-09 05:52:54,441 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 19 [2024-11-09 05:52:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:54,442 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2024-11-09 05:52:54,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 05:52:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2024-11-09 05:52:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:52:54,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:54,443 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 05:52:54,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:52:54,444 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:54,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:54,444 INFO L85 PathProgramCache]: Analyzing trace with hash 80871076, now seen corresponding path program 1 times [2024-11-09 05:52:54,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:54,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530424105] [2024-11-09 05:52:54,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:54,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:54,672 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 05:52:54,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:54,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530424105] [2024-11-09 05:52:54,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530424105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:54,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:54,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:52:54,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400757253] [2024-11-09 05:52:54,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:54,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:52:54,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:54,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:52:54,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:52:54,675 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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 05:52:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:55,004 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2024-11-09 05:52:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:52:55,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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 05:52:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:55,006 INFO L225 Difference]: With dead ends: 196 [2024-11-09 05:52:55,006 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 05:52:55,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:52:55,007 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 202 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:55,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 178 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:52:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 05:52:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 133. [2024-11-09 05:52:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.481818181818182) internal successors, (163), 132 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2024-11-09 05:52:55,012 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 20 [2024-11-09 05:52:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:55,013 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2024-11-09 05:52:55,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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 05:52:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2024-11-09 05:52:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:52:55,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:55,014 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 05:52:55,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:52:55,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:55,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:55,015 INFO L85 PathProgramCache]: Analyzing trace with hash 80871077, now seen corresponding path program 1 times [2024-11-09 05:52:55,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:55,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187887570] [2024-11-09 05:52:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:55,182 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 05:52:55,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:55,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187887570] [2024-11-09 05:52:55,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187887570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:55,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:55,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:52:55,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12100062] [2024-11-09 05:52:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:55,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:52:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:52:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:52:55,184 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 05:52:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:55,507 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2024-11-09 05:52:55,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:52:55,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 05:52:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:55,508 INFO L225 Difference]: With dead ends: 196 [2024-11-09 05:52:55,508 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 05:52:55,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:52:55,509 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 89 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:55,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 301 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 05:52:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 129. [2024-11-09 05:52:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.4811320754716981) internal successors, (157), 128 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 157 transitions. [2024-11-09 05:52:55,513 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 157 transitions. Word has length 20 [2024-11-09 05:52:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:55,513 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 157 transitions. [2024-11-09 05:52:55,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 05:52:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 157 transitions. [2024-11-09 05:52:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:52:55,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:55,514 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 05:52:55,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 05:52:55,515 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:55,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1305364974, now seen corresponding path program 1 times [2024-11-09 05:52:55,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:55,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439288746] [2024-11-09 05:52:55,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:55,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:55,680 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 05:52:55,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:55,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439288746] [2024-11-09 05:52:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439288746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:55,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:55,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:52:55,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101188293] [2024-11-09 05:52:55,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:55,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:52:55,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:55,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:52:55,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:52:55,682 INFO L87 Difference]: Start difference. First operand 129 states and 157 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 05:52:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:55,877 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2024-11-09 05:52:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:52:55,878 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 05:52:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:55,879 INFO L225 Difference]: With dead ends: 135 [2024-11-09 05:52:55,879 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 05:52:55,879 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 05:52:55,879 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:55,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 232 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 05:52:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2024-11-09 05:52:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.471698113207547) internal successors, (156), 127 states have internal predecessors, (156), 0 states have call successors, (0), 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 05:52:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2024-11-09 05:52:55,883 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 20 [2024-11-09 05:52:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:55,883 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2024-11-09 05:52:55,883 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 05:52:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2024-11-09 05:52:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:52:55,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:55,884 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 05:52:55,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 05:52:55,884 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:55,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:55,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1305364975, now seen corresponding path program 1 times [2024-11-09 05:52:55,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:55,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842982946] [2024-11-09 05:52:55,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:55,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:56,115 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 05:52:56,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:56,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842982946] [2024-11-09 05:52:56,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842982946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:56,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:56,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:52:56,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083303490] [2024-11-09 05:52:56,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:56,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:52:56,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:56,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:52:56,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:52:56,117 INFO L87 Difference]: Start difference. First operand 128 states and 156 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 05:52:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:56,293 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2024-11-09 05:52:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:52:56,293 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 05:52:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:56,294 INFO L225 Difference]: With dead ends: 127 [2024-11-09 05:52:56,294 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 05:52:56,294 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 05:52:56,295 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:56,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 227 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 05:52:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-09 05:52:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 126 states have internal predecessors, (155), 0 states have call successors, (0), 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 05:52:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2024-11-09 05:52:56,298 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 20 [2024-11-09 05:52:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:56,298 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2024-11-09 05:52:56,298 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 05:52:56,298 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2024-11-09 05:52:56,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:52:56,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:56,299 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 05:52:56,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 05:52:56,299 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:56,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash 606997414, now seen corresponding path program 1 times [2024-11-09 05:52:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255233421] [2024-11-09 05:52:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:56,548 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 05:52:56,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255233421] [2024-11-09 05:52:56,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255233421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:56,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:56,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:52:56,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9953047] [2024-11-09 05:52:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:56,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:52:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:56,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:52:56,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:52:56,550 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 05:52:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:57,107 INFO L93 Difference]: Finished difference Result 243 states and 289 transitions. [2024-11-09 05:52:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:52:57,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 05:52:57,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:57,109 INFO L225 Difference]: With dead ends: 243 [2024-11-09 05:52:57,109 INFO L226 Difference]: Without dead ends: 243 [2024-11-09 05:52:57,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-09 05:52:57,110 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 284 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:57,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 362 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:52:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-09 05:52:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 139. [2024-11-09 05:52:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 138 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 171 transitions. [2024-11-09 05:52:57,116 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 171 transitions. Word has length 21 [2024-11-09 05:52:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:57,116 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 171 transitions. [2024-11-09 05:52:57,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 05:52:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 171 transitions. [2024-11-09 05:52:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:52:57,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:57,118 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 05:52:57,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 05:52:57,118 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:57,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:57,119 INFO L85 PathProgramCache]: Analyzing trace with hash 606997415, now seen corresponding path program 1 times [2024-11-09 05:52:57,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:57,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157402954] [2024-11-09 05:52:57,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:57,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:57,526 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 05:52:57,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:57,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157402954] [2024-11-09 05:52:57,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157402954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:57,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:57,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:52:57,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008970733] [2024-11-09 05:52:57,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:57,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 05:52:57,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:57,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 05:52:57,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:52:57,529 INFO L87 Difference]: Start difference. First operand 139 states and 171 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 05:52:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:58,061 INFO L93 Difference]: Finished difference Result 196 states and 236 transitions. [2024-11-09 05:52:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:52:58,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 05:52:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:58,063 INFO L225 Difference]: With dead ends: 196 [2024-11-09 05:52:58,063 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 05:52:58,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-09 05:52:58,064 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 273 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:58,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 347 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:52:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 05:52:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 139. [2024-11-09 05:52:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 138 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2024-11-09 05:52:58,069 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 21 [2024-11-09 05:52:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:58,070 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2024-11-09 05:52:58,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 05:52:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2024-11-09 05:52:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 05:52:58,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:58,071 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 05:52:58,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 05:52:58,072 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:58,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1870024303, now seen corresponding path program 1 times [2024-11-09 05:52:58,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:58,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029653552] [2024-11-09 05:52:58,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:58,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:58,109 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 05:52:58,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:58,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029653552] [2024-11-09 05:52:58,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029653552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:58,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:58,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:52:58,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364526657] [2024-11-09 05:52:58,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:58,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:52:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:58,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:52:58,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:52:58,113 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 05:52:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:58,166 INFO L93 Difference]: Finished difference Result 141 states and 172 transitions. [2024-11-09 05:52:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:52:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 05:52:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:58,168 INFO L225 Difference]: With dead ends: 141 [2024-11-09 05:52:58,168 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 05:52:58,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:52:58,169 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:58,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:52:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 05:52:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-09 05:52:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 120 states have (on average 1.4333333333333333) internal successors, (172), 140 states have internal predecessors, (172), 0 states have call successors, (0), 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 05:52:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 172 transitions. [2024-11-09 05:52:58,173 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 172 transitions. Word has length 22 [2024-11-09 05:52:58,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:58,174 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 172 transitions. [2024-11-09 05:52:58,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 05:52:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 172 transitions. [2024-11-09 05:52:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 05:52:58,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:58,175 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 05:52:58,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 05:52:58,176 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:58,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2140195672, now seen corresponding path program 1 times [2024-11-09 05:52:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:58,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923159380] [2024-11-09 05:52:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:58,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:58,369 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 05:52:58,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923159380] [2024-11-09 05:52:58,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923159380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:58,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:58,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:52:58,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349453638] [2024-11-09 05:52:58,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:58,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:52:58,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:58,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:52:58,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:52:58,372 INFO L87 Difference]: Start difference. First operand 141 states and 172 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) 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 05:52:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:58,679 INFO L93 Difference]: Finished difference Result 198 states and 238 transitions. [2024-11-09 05:52:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:52:58,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) 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 05:52:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:58,681 INFO L225 Difference]: With dead ends: 198 [2024-11-09 05:52:58,681 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 05:52:58,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:52:58,683 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 177 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:58,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 228 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 05:52:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 146. [2024-11-09 05:52:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 125 states have (on average 1.424) internal successors, (178), 145 states have internal predecessors, (178), 0 states have call successors, (0), 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 05:52:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 178 transitions. [2024-11-09 05:52:58,693 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 178 transitions. Word has length 23 [2024-11-09 05:52:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:58,694 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 178 transitions. [2024-11-09 05:52:58,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) 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 05:52:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 178 transitions. [2024-11-09 05:52:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 05:52:58,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:58,695 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, 1] [2024-11-09 05:52:58,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 05:52:58,695 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:58,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -660699370, now seen corresponding path program 1 times [2024-11-09 05:52:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:58,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247027790] [2024-11-09 05:52:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:58,980 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 05:52:58,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:58,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247027790] [2024-11-09 05:52:58,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247027790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:58,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:58,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 05:52:58,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518685301] [2024-11-09 05:52:58,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:58,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:52:58,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:58,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:52:58,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:52:58,983 INFO L87 Difference]: Start difference. First operand 146 states and 178 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:59,452 INFO L93 Difference]: Finished difference Result 204 states and 243 transitions. [2024-11-09 05:52:59,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:52:59,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 05:52:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:59,454 INFO L225 Difference]: With dead ends: 204 [2024-11-09 05:52:59,454 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 05:52:59,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 05:52:59,455 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 223 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:59,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 360 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:52:59,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 05:52:59,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 146. [2024-11-09 05:52:59,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 125 states have (on average 1.416) internal successors, (177), 145 states have internal predecessors, (177), 0 states have call successors, (0), 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 05:52:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2024-11-09 05:52:59,460 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 24 [2024-11-09 05:52:59,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:59,460 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2024-11-09 05:52:59,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:52:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2024-11-09 05:52:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:52:59,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:59,461 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, 1, 1] [2024-11-09 05:52:59,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 05:52:59,463 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:59,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:59,464 INFO L85 PathProgramCache]: Analyzing trace with hash -276213400, now seen corresponding path program 1 times [2024-11-09 05:52:59,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:59,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890270003] [2024-11-09 05:52:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:59,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:59,600 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 05:52:59,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:59,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890270003] [2024-11-09 05:52:59,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890270003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:59,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:59,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:52:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410478465] [2024-11-09 05:52:59,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:59,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:52:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:52:59,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:52:59,602 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 05:52:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:59,825 INFO L93 Difference]: Finished difference Result 173 states and 210 transitions. [2024-11-09 05:52:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:52:59,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-09 05:52:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:59,826 INFO L225 Difference]: With dead ends: 173 [2024-11-09 05:52:59,826 INFO L226 Difference]: Without dead ends: 173 [2024-11-09 05:52:59,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:52:59,827 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:59,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 243 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:52:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-09 05:52:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 149. [2024-11-09 05:52:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.421875) internal successors, (182), 148 states have internal predecessors, (182), 0 states have call successors, (0), 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 05:52:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 182 transitions. [2024-11-09 05:52:59,832 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 182 transitions. Word has length 25 [2024-11-09 05:52:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:59,833 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 182 transitions. [2024-11-09 05:52:59,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 05:52:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 182 transitions. [2024-11-09 05:52:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:52:59,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:59,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:52:59,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 05:52:59,834 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:59,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:59,835 INFO L85 PathProgramCache]: Analyzing trace with hash 199517227, now seen corresponding path program 1 times [2024-11-09 05:52:59,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:59,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299715276] [2024-11-09 05:52:59,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:59,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:52:59,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299715276] [2024-11-09 05:52:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299715276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:52:59,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:52:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:52:59,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034465968] [2024-11-09 05:52:59,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:52:59,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:52:59,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:59,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:52:59,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:52:59,899 INFO L87 Difference]: Start difference. First operand 149 states and 182 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 05:52:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:59,980 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2024-11-09 05:52:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:52:59,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-09 05:52:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:59,981 INFO L225 Difference]: With dead ends: 153 [2024-11-09 05:52:59,981 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 05:52:59,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:52:59,982 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:59,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:52:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 05:52:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-09 05:52:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 132 states have (on average 1.393939393939394) internal successors, (184), 152 states have internal predecessors, (184), 0 states have call successors, (0), 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 05:52:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 184 transitions. [2024-11-09 05:52:59,986 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 184 transitions. Word has length 25 [2024-11-09 05:52:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:59,987 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 184 transitions. [2024-11-09 05:52:59,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 05:52:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 184 transitions. [2024-11-09 05:52:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 05:52:59,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:59,988 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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 05:52:59,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 05:52:59,989 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:52:59,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:59,990 INFO L85 PathProgramCache]: Analyzing trace with hash 106058402, now seen corresponding path program 1 times [2024-11-09 05:52:59,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:59,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163298198] [2024-11-09 05:52:59,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:59,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:53:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:53:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:53:00,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:53:00,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163298198] [2024-11-09 05:53:00,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163298198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:53:00,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27318668] [2024-11-09 05:53:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:53:00,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:53:00,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:53:00,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:53:00,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:53:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:53:00,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 05:53:00,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:53:00,446 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 11 treesize of output 7 [2024-11-09 05:53:00,458 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 11 treesize of output 7 [2024-11-09 05:53:00,494 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 11 [2024-11-09 05:53:00,505 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 11 [2024-11-09 05:53:00,545 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 11 [2024-11-09 05:53:00,556 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 11 [2024-11-09 05:53:00,573 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 19 treesize of output 18 [2024-11-09 05:53:00,586 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 11 [2024-11-09 05:53:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:53:00,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:53:01,376 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 10 treesize of output 8 [2024-11-09 05:53:01,385 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 14 treesize of output 12 [2024-11-09 05:53:01,396 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 10 treesize of output 8 [2024-11-09 05:53:01,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:53:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:53:01,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27318668] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:53:01,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1366214588] [2024-11-09 05:53:01,438 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 05:53:01,439 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:53:01,443 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:53:01,448 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:53:01,449 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:53:02,529 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:53:21,184 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7091#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_110| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_110|) 1))) (= |ULTIMATE.start_main_~head~0#1.offset| 0))' at error location [2024-11-09 05:53:21,184 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:53:21,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:53:21,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2024-11-09 05:53:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722403849] [2024-11-09 05:53:21,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:53:21,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 05:53:21,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:53:21,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 05:53:21,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=655, Unknown=7, NotChecked=0, Total=870 [2024-11-09 05:53:21,190 INFO L87 Difference]: Start difference. First operand 153 states and 184 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 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 05:53:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:53:22,685 INFO L93 Difference]: Finished difference Result 213 states and 252 transitions. [2024-11-09 05:53:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 05:53:22,687 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 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 26 [2024-11-09 05:53:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:53:22,688 INFO L225 Difference]: With dead ends: 213 [2024-11-09 05:53:22,689 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 05:53:22,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=306, Invalid=1247, Unknown=7, NotChecked=0, Total=1560 [2024-11-09 05:53:22,691 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 296 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:53:22,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 355 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 05:53:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 05:53:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 181. [2024-11-09 05:53:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.39375) internal successors, (223), 180 states have internal predecessors, (223), 0 states have call successors, (0), 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 05:53:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 223 transitions. [2024-11-09 05:53:22,699 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 223 transitions. Word has length 26 [2024-11-09 05:53:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:53:22,699 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 223 transitions. [2024-11-09 05:53:22,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 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 05:53:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 223 transitions. [2024-11-09 05:53:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:53:22,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:53:22,701 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, 1, 1, 1, 1] [2024-11-09 05:53:22,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:53:22,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:53:22,906 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:53:22,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:53:22,906 INFO L85 PathProgramCache]: Analyzing trace with hash -818069199, now seen corresponding path program 1 times [2024-11-09 05:53:22,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:53:22,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8176425] [2024-11-09 05:53:22,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:53:22,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:53:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:53:23,744 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 05:53:23,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:53:23,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8176425] [2024-11-09 05:53:23,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8176425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:53:23,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:53:23,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 05:53:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041204595] [2024-11-09 05:53:23,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:53:23,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 05:53:23,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:53:23,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 05:53:23,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 05:53:23,747 INFO L87 Difference]: Start difference. First operand 181 states and 223 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 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 05:53:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:53:25,387 INFO L93 Difference]: Finished difference Result 203 states and 246 transitions. [2024-11-09 05:53:25,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:53:25,388 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-09 05:53:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:53:25,389 INFO L225 Difference]: With dead ends: 203 [2024-11-09 05:53:25,389 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 05:53:25,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-11-09 05:53:25,390 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 134 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:53:25,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 513 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 05:53:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 05:53:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 179. [2024-11-09 05:53:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 158 states have (on average 1.3860759493670887) internal successors, (219), 178 states have internal predecessors, (219), 0 states have call successors, (0), 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 05:53:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 219 transitions. [2024-11-09 05:53:25,395 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 219 transitions. Word has length 27 [2024-11-09 05:53:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:53:25,395 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 219 transitions. [2024-11-09 05:53:25,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 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 05:53:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 219 transitions. [2024-11-09 05:53:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 05:53:25,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:53:25,396 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, 1, 1, 1, 1, 1] [2024-11-09 05:53:25,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 05:53:25,396 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:53:25,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:53:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1085572207, now seen corresponding path program 1 times [2024-11-09 05:53:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:53:25,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609404920] [2024-11-09 05:53:25,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:53:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:53:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:53:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:53:25,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:53:25,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609404920] [2024-11-09 05:53:25,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609404920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:53:25,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226705366] [2024-11-09 05:53:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:53:25,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:53:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:53:25,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:53:25,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:53:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:53:25,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 05:53:25,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:53:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:53:25,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:53:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226705366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:53:25,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:53:25,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-09 05:53:25,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729495430] [2024-11-09 05:53:25,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:53:25,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:53:25,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:53:25,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:53:25,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:53:25,817 INFO L87 Difference]: Start difference. First operand 179 states and 219 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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 05:53:26,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:53:26,062 INFO L93 Difference]: Finished difference Result 195 states and 228 transitions. [2024-11-09 05:53:26,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:53:26,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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 28 [2024-11-09 05:53:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:53:26,064 INFO L225 Difference]: With dead ends: 195 [2024-11-09 05:53:26,064 INFO L226 Difference]: Without dead ends: 195 [2024-11-09 05:53:26,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:53:26,066 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 103 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:53:26,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 115 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:53:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-09 05:53:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 179. [2024-11-09 05:53:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 158 states have (on average 1.360759493670886) internal successors, (215), 178 states have internal predecessors, (215), 0 states have call successors, (0), 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 05:53:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 215 transitions. [2024-11-09 05:53:26,072 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 215 transitions. Word has length 28 [2024-11-09 05:53:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:53:26,076 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 215 transitions. [2024-11-09 05:53:26,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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 05:53:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 215 transitions. [2024-11-09 05:53:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:53:26,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:53:26,077 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:53:26,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 05:53:26,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 05:53:26,278 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:53:26,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:53:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash 143677661, now seen corresponding path program 1 times [2024-11-09 05:53:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:53:26,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749156191] [2024-11-09 05:53:26,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:53:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:53:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:53:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:53:27,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:53:27,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749156191] [2024-11-09 05:53:27,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749156191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:53:27,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953806298] [2024-11-09 05:53:27,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:53:27,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:53:27,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:53:27,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:53:27,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:53:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:53:27,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 05:53:27,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:53:27,473 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 05:53:27,532 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 11 treesize of output 7 [2024-11-09 05:53:27,542 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 11 treesize of output 7 [2024-11-09 05:53:27,773 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:53:27,774 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 05:53:27,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:53:27,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 05:53:27,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:53:27,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 05:53:28,146 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:53:28,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 43 [2024-11-09 05:53:28,168 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 31 treesize of output 16 [2024-11-09 05:53:28,398 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:53:28,398 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 31 treesize of output 22 [2024-11-09 05:53:28,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:53:28,411 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 16 [2024-11-09 05:53:28,566 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:53:28,566 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 31 treesize of output 22 [2024-11-09 05:53:28,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:53:28,582 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 16 [2024-11-09 05:53:28,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:53:28,665 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 05:53:28,666 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 40 [2024-11-09 05:53:28,679 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 31 treesize of output 16 [2024-11-09 05:53:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:53:29,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:53:29,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_982 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) is different from false [2024-11-09 05:53:29,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:53:29,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 05:53:29,486 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) |c_ULTIMATE.start_main_~x~0#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_982 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-09 05:53:29,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_982 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_982) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (not (= .cse0 (select v_arrayElimArr_1 (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))))))))) is different from false [2024-11-09 05:53:29,590 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_976) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_982) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_977))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select v_arrayElimArr_1 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_976) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) .cse1)) (= (select (select (store .cse2 .cse1 v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|))))))) is different from false [2024-11-09 05:53:29,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_976) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_977) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_982) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_977))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (= (select (select (store .cse2 .cse3 v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (select v_arrayElimArr_1 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_976) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 8)) .cse3)))))))) is different from false [2024-11-09 05:53:29,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|))) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)))) (and (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_976) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_982) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_977))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= .cse3 (select v_arrayElimArr_1 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_976) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 8)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store .cse4 .cse3 v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) is different from false [2024-11-09 05:53:30,250 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:53:30,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:53:30,266 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2024-11-09 05:53:30,277 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:53:30,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:53:30,291 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 63 [2024-11-09 05:53:30,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:53:30,303 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 308 treesize of output 212 [2024-11-09 05:53:30,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:53:30,332 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 26 treesize of output 26 [2024-11-09 05:53:30,342 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 12 treesize of output 10 [2024-11-09 05:53:30,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:53:30,352 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 0 case distinctions, treesize of input 34 treesize of output 24 [2024-11-09 05:53:30,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:53:30,361 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 19 treesize of output 9 [2024-11-09 05:53:30,381 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:53:30,389 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-09 05:53:30,389 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2024-11-09 05:53:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:53:30,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953806298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:53:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [402645645] [2024-11-09 05:53:30,507 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-09 05:53:30,508 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:53:30,508 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:53:30,509 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:53:30,509 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:53:38,206 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:54:11,216 WARN L286 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 271 DAG size of output: 260 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:54:29,765 WARN L286 SmtUtils]: Spent 7.65s on a formula simplification. DAG size of input: 295 DAG size of output: 282 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:55:09,605 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8612#(and (<= 0 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= (+ 16 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem17#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) 1)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 12 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2024-11-09 05:55:09,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:55:09,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:55:09,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 33 [2024-11-09 05:55:09,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898354848] [2024-11-09 05:55:09,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:55:09,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 05:55:09,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:09,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 05:55:09,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2781, Unknown=42, NotChecked=678, Total=3782 [2024-11-09 05:55:09,607 INFO L87 Difference]: Start difference. First operand 179 states and 215 transitions. Second operand has 34 states, 34 states have (on average 2.5) internal successors, (85), 33 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 05:55:18,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_982 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_982) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_1) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= .cse2 (select v_arrayElimArr_1 (+ 8 (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2024-11-09 05:55:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:26,649 INFO L93 Difference]: Finished difference Result 462 states and 540 transitions. [2024-11-09 05:55:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-09 05:55:26,649 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5) internal successors, (85), 33 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) Word has length 31 [2024-11-09 05:55:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:26,651 INFO L225 Difference]: With dead ends: 462 [2024-11-09 05:55:26,651 INFO L226 Difference]: Without dead ends: 462 [2024-11-09 05:55:26,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2421 ImplicationChecksByTransitivity, 105.0s TimeCoverageRelationStatistics Valid=843, Invalid=6968, Unknown=49, NotChecked=1260, Total=9120 [2024-11-09 05:55:26,653 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 527 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 1846 mSolverCounterSat, 121 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 4280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1846 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 2292 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:26,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1297 Invalid, 4280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1846 Invalid, 21 Unknown, 2292 Unchecked, 5.0s Time] [2024-11-09 05:55:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-09 05:55:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 211. [2024-11-09 05:55:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 190 states have (on average 1.3368421052631578) internal successors, (254), 210 states have internal predecessors, (254), 0 states have call successors, (0), 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 05:55:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 254 transitions. [2024-11-09 05:55:26,659 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 254 transitions. Word has length 31 [2024-11-09 05:55:26,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:26,660 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 254 transitions. [2024-11-09 05:55:26,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5) internal successors, (85), 33 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 05:55:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 254 transitions. [2024-11-09 05:55:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 05:55:26,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:26,661 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:26,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 05:55:26,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 05:55:26,866 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:55:26,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:26,867 INFO L85 PathProgramCache]: Analyzing trace with hash 209548955, now seen corresponding path program 1 times [2024-11-09 05:55:26,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:26,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425809305] [2024-11-09 05:55:26,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:26,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:28,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:28,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425809305] [2024-11-09 05:55:28,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425809305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:55:28,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059439180] [2024-11-09 05:55:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:28,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:55:28,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:55:28,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:55:28,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:55:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:28,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 05:55:28,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:55:28,328 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 05:55:28,429 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 05:55:28,429 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 17 treesize of output 21 [2024-11-09 05:55:28,526 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 05:55:28,648 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:55:28,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 05:55:28,973 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-09 05:55:28,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-09 05:55:29,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:55:29,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-09 05:55:29,509 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:55:29,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 54 [2024-11-09 05:55:29,843 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:55:29,844 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 62 treesize of output 45 [2024-11-09 05:55:30,068 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:55:30,068 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 62 treesize of output 45 [2024-11-09 05:55:30,145 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:55:30,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 54 [2024-11-09 05:55:30,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:55:30,823 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 54 treesize of output 26 [2024-11-09 05:55:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:30,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:55:31,027 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1126 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2024-11-09 05:55:31,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1126 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1126) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2024-11-09 05:55:31,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1123 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1123))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1126)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2024-11-09 05:55:31,297 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_21| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1123 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1123))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1126)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) 0)))) is different from false [2024-11-09 05:55:31,340 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_21| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_103|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1123))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|) v_ArrVal_1126)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2024-11-09 05:55:31,377 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_21| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_103|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| 1) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1120))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1123))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|) v_ArrVal_1126)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2024-11-09 05:55:31,519 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:55:31,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:55:31,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 52 [2024-11-09 05:55:31,535 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 58 treesize of output 54 [2024-11-09 05:55:31,540 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:55:31,543 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 51 treesize of output 43 [2024-11-09 05:55:31,552 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:55:31,557 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 35 treesize of output 31 [2024-11-09 05:55:31,564 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 16 treesize of output 12 [2024-11-09 05:55:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 05:55:34,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059439180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:55:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1630732542] [2024-11-09 05:55:34,081 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-09 05:55:34,081 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:55:34,082 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:55:34,082 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:55:34,082 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:55:41,191 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:56:23,723 WARN L286 SmtUtils]: Spent 14.81s on a formula simplification. DAG size of input: 298 DAG size of output: 279 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:56:57,982 WARN L286 SmtUtils]: Spent 16.93s on a formula simplification. DAG size of input: 322 DAG size of output: 301 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:57:51,147 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9605#(and (<= 0 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= (+ 16 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem17#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) 1)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 12 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2024-11-09 05:57:51,147 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:57:51,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:57:51,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 35 [2024-11-09 05:57:51,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324198674] [2024-11-09 05:57:51,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:57:51,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 05:57:51,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 05:57:51,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=3171, Unknown=45, NotChecked=726, Total=4290 [2024-11-09 05:57:51,150 INFO L87 Difference]: Start difference. First operand 211 states and 254 transitions. Second operand has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 36 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 05:58:06,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:58:08,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:58:12,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:58:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:58:14,603 INFO L93 Difference]: Finished difference Result 423 states and 493 transitions. [2024-11-09 05:58:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 05:58:14,604 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 36 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) Word has length 32 [2024-11-09 05:58:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:58:14,606 INFO L225 Difference]: With dead ends: 423 [2024-11-09 05:58:14,606 INFO L226 Difference]: Without dead ends: 423 [2024-11-09 05:58:14,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2512 ImplicationChecksByTransitivity, 146.9s TimeCoverageRelationStatistics Valid=788, Invalid=6324, Unknown=52, NotChecked=1026, Total=8190 [2024-11-09 05:58:14,609 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 528 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 84 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 3674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 1989 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:58:14,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1074 Invalid, 3674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1577 Invalid, 24 Unknown, 1989 Unchecked, 10.5s Time] [2024-11-09 05:58:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-09 05:58:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 245. [2024-11-09 05:58:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 224 states have (on average 1.3258928571428572) internal successors, (297), 244 states have internal predecessors, (297), 0 states have call successors, (0), 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 05:58:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2024-11-09 05:58:14,618 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 32 [2024-11-09 05:58:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:58:14,618 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2024-11-09 05:58:14,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 36 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 05:58:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2024-11-09 05:58:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 05:58:14,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:58:14,619 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:58:14,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 05:58:14,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 05:58:14,820 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 05:58:14,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:58:14,821 INFO L85 PathProgramCache]: Analyzing trace with hash 209548956, now seen corresponding path program 1 times [2024-11-09 05:58:14,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:58:14,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563800910] [2024-11-09 05:58:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:58:14,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:58:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:58:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:58:17,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:58:17,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563800910] [2024-11-09 05:58:17,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563800910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:58:17,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613188956] [2024-11-09 05:58:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:58:17,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:58:17,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:58:17,013 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:58:17,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:58:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:58:17,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 05:58:17,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:58:17,185 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 05:58:17,292 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 8 treesize of output 1 [2024-11-09 05:58:17,369 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 05:58:17,369 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 17 treesize of output 21 [2024-11-09 05:58:17,522 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 11 treesize of output 7 [2024-11-09 05:58:17,569 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 05:58:17,814 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:58:17,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-09 05:58:17,831 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 24 treesize of output 11 [2024-11-09 05:58:18,092 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 05:58:18,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-09 05:58:18,165 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 05:58:18,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 05:58:18,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:18,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 05:58:18,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:18,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-09 05:58:18,745 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:58:18,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 59 [2024-11-09 05:58:18,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 05:58:19,056 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:58:19,057 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 53 treesize of output 38 [2024-11-09 05:58:19,129 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:58:19,129 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 16 treesize of output 15 [2024-11-09 05:58:19,372 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:58:19,372 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 16 treesize of output 15 [2024-11-09 05:58:19,417 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:58:19,417 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 53 treesize of output 38 [2024-11-09 05:58:19,590 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:58:19,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 59 [2024-11-09 05:58:19,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 05:58:20,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:20,274 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 45 treesize of output 21 [2024-11-09 05:58:20,288 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 7 treesize of output 3 [2024-11-09 05:58:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:58:20,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:58:21,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1270))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1269) .cse1 v_ArrVal_1276) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1275) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1269) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1270) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1276) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2024-11-09 05:58:21,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)))) (and (forall ((v_ArrVal_1269 (Array Int Int)) (|ULTIMATE.start_main_#t~malloc7#1.offset| Int) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1269) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1270) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1276) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (forall ((v_ArrVal_1269 (Array Int Int)) (|ULTIMATE.start_main_#t~malloc7#1.offset| Int) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1270))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1269) .cse3 v_ArrVal_1276) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1275) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) is different from false [2024-11-09 05:58:32,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:32,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:58:32,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 252 [2024-11-09 05:58:32,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:32,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:58:32,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 144 [2024-11-09 05:58:32,841 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 86 treesize of output 82 [2024-11-09 05:58:32,860 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 146 treesize of output 140 [2024-11-09 05:58:32,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:32,875 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 69 treesize of output 61 [2024-11-09 05:58:32,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:32,891 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 53 treesize of output 49 [2024-11-09 05:58:32,899 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:32,905 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 46 treesize of output 42 [2024-11-09 05:58:32,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:32,919 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 48 treesize of output 40 [2024-11-09 05:58:32,932 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 22 treesize of output 18 [2024-11-09 05:58:32,944 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 18 treesize of output 14 [2024-11-09 05:58:33,031 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:33,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:58:33,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 104 [2024-11-09 05:58:33,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:33,063 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 48 treesize of output 44 [2024-11-09 05:58:33,071 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:33,076 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 41 treesize of output 33 [2024-11-09 05:58:33,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:33,090 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 25 treesize of output 21 [2024-11-09 05:58:33,101 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 11 treesize of output 7 [2024-11-09 05:58:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:58:39,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613188956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:58:39,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1564144379] [2024-11-09 05:58:39,580 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-09 05:58:39,580 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:58:39,581 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:58:39,581 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:58:39,581 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:58:47,064 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:59:32,122 WARN L286 SmtUtils]: Spent 13.80s on a formula simplification. DAG size of input: 298 DAG size of output: 279 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:00:12,613 WARN L286 SmtUtils]: Spent 19.39s on a formula simplification. DAG size of input: 322 DAG size of output: 301 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:01:08,475 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10587#(and (or (< (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))) (<= 0 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))) (<= (+ 16 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 12 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2024-11-09 06:01:08,475 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:01:08,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:01:08,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 40 [2024-11-09 06:01:08,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191834936] [2024-11-09 06:01:08,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:01:08,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 06:01:08,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:01:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 06:01:08,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=4217, Unknown=88, NotChecked=270, Total=4970 [2024-11-09 06:01:08,479 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand has 42 states, 41 states have (on average 2.341463414634146) internal successors, (96), 41 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:01:10,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:01:13,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:01:20,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:01:22,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:01:27,081 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1270))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1269) .cse1 v_ArrVal_1276) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1275) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1269) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1270) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1276) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2024-11-09 06:01:43,469 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_1276 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1276) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1276) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1275) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1))) is different from false [2024-11-09 06:01:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:01:54,938 INFO L93 Difference]: Finished difference Result 576 states and 677 transitions. [2024-11-09 06:01:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-09 06:01:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.341463414634146) internal successors, (96), 41 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) Word has length 32 [2024-11-09 06:01:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:01:54,942 INFO L225 Difference]: With dead ends: 576 [2024-11-09 06:01:54,942 INFO L226 Difference]: Without dead ends: 576 [2024-11-09 06:01:54,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3209 ImplicationChecksByTransitivity, 188.8s TimeCoverageRelationStatistics Valid=945, Invalid=8038, Unknown=153, NotChecked=764, Total=9900 [2024-11-09 06:01:54,945 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 936 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 115 mSolverCounterUnsat, 130 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 3772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 130 IncrementalHoareTripleChecker+Unknown, 888 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:01:54,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1779 Invalid, 3772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2639 Invalid, 130 Unknown, 888 Unchecked, 19.2s Time] [2024-11-09 06:01:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-09 06:01:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 259. [2024-11-09 06:01:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 238 states have (on average 1.319327731092437) internal successors, (314), 258 states have internal predecessors, (314), 0 states have call successors, (0), 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:01:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 314 transitions. [2024-11-09 06:01:54,953 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 314 transitions. Word has length 32 [2024-11-09 06:01:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:01:54,954 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 314 transitions. [2024-11-09 06:01:54,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.341463414634146) internal successors, (96), 41 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:01:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 314 transitions. [2024-11-09 06:01:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:01:54,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:01:54,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:01:54,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:01:55,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 06:01:55,156 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:01:55,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:01:55,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2111782024, now seen corresponding path program 1 times [2024-11-09 06:01:55,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:01:55,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229220390] [2024-11-09 06:01:55,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:55,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:01:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:01:55,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:01:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229220390] [2024-11-09 06:01:55,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229220390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:01:55,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:01:55,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:01:55,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788773154] [2024-11-09 06:01:55,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:01:55,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:01:55,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:01:55,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:01:55,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:01:55,269 INFO L87 Difference]: Start difference. First operand 259 states and 314 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:01:55,671 INFO L93 Difference]: Finished difference Result 269 states and 316 transitions. [2024-11-09 06:01:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:01:55,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-09 06:01:55,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:01:55,672 INFO L225 Difference]: With dead ends: 269 [2024-11-09 06:01:55,672 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 06:01:55,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:01:55,673 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 98 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:01:55,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 108 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:01:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 06:01:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2024-11-09 06:01:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 240 states have (on average 1.3083333333333333) internal successors, (314), 260 states have internal predecessors, (314), 0 states have call successors, (0), 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:01:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 314 transitions. [2024-11-09 06:01:55,680 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 314 transitions. Word has length 32 [2024-11-09 06:01:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:01:55,681 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 314 transitions. [2024-11-09 06:01:55,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 314 transitions. [2024-11-09 06:01:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:01:55,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:01:55,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:01:55,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 06:01:55,682 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:01:55,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:01:55,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2111771039, now seen corresponding path program 1 times [2024-11-09 06:01:55,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:01:55,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329868999] [2024-11-09 06:01:55,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:55,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:01:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:01:56,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:01:56,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329868999] [2024-11-09 06:01:56,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329868999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:01:56,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:01:56,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:01:56,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506789345] [2024-11-09 06:01:56,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:01:56,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:01:56,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:01:56,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:01:56,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:01:56,009 INFO L87 Difference]: Start difference. First operand 261 states and 314 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:01:56,855 INFO L93 Difference]: Finished difference Result 283 states and 337 transitions. [2024-11-09 06:01:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:01:56,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-09 06:01:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:01:56,856 INFO L225 Difference]: With dead ends: 283 [2024-11-09 06:01:56,856 INFO L226 Difference]: Without dead ends: 283 [2024-11-09 06:01:56,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:01:56,857 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 123 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:01:56,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 265 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:01:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-09 06:01:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 276. [2024-11-09 06:01:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 255 states have (on average 1.2941176470588236) internal successors, (330), 275 states have internal predecessors, (330), 0 states have call successors, (0), 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:01:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 330 transitions. [2024-11-09 06:01:56,864 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 330 transitions. Word has length 32 [2024-11-09 06:01:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:01:56,866 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 330 transitions. [2024-11-09 06:01:56,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 330 transitions. [2024-11-09 06:01:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:01:56,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:01:56,868 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:01:56,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 06:01:56,874 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:01:56,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:01:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash -91690074, now seen corresponding path program 1 times [2024-11-09 06:01:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:01:56,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109684414] [2024-11-09 06:01:56,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:56,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:01:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:01:59,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:01:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109684414] [2024-11-09 06:01:59,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109684414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129816826] [2024-11-09 06:01:59,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:59,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:59,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:01:59,158 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:01:59,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:01:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:59,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 06:01:59,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:01:59,355 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:01:59,488 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 11 treesize of output 7 [2024-11-09 06:01:59,505 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 11 treesize of output 7 [2024-11-09 06:01:59,802 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:01:59,802 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:01:59,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:59,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:01:59,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:59,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:02:00,160 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:02:00,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2024-11-09 06:02:00,170 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 24 treesize of output 11 [2024-11-09 06:02:00,411 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:02:00,411 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 16 treesize of output 15 [2024-11-09 06:02:00,462 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:02:00,462 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 31 treesize of output 22 [2024-11-09 06:02:00,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:02:00,730 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:02:00,781 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:02:00,781 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 31 treesize of output 22 [2024-11-09 06:02:00,877 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:02:00,877 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 16 treesize of output 15 [2024-11-09 06:02:01,126 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:02:01,127 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 16 treesize of output 15 [2024-11-09 06:02:01,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:01,236 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-09 06:02:01,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2024-11-09 06:02:01,663 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-09 06:02:01,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 73 [2024-11-09 06:02:01,679 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 24 treesize of output 11 [2024-11-09 06:02:01,691 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 20 treesize of output 12 [2024-11-09 06:02:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:02,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:02:03,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:02:03,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-09 06:02:03,245 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 30 treesize of output 22 [2024-11-09 06:02:04,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:02:04,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 134 [2024-11-09 06:02:04,293 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 7 treesize of output 3 [2024-11-09 06:02:04,398 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 7 treesize of output 3 [2024-11-09 06:02:04,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1476 (Array Int Int)) (|ULTIMATE.start_main_#t~malloc7#1.offset| Int) (v_arrayElimCell_101 Int) (v_ArrVal_1473 (Array Int Int)) (v_prenex_3 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1468) (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_prenex_3) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1473) v_arrayElimCell_101 v_ArrVal_1476) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (= v_arrayElimCell_101 |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_9 (+ 8 v_subst_2)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1467))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_9)) .cse3 v_ArrVal_1477) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (= .cse3 |c_ULTIMATE.start_main_~x~0#1.base|)))))) is different from false [2024-11-09 06:02:11,846 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:02:11,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:02:11,868 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 48 [2024-11-09 06:02:11,873 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:02:11,879 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:02:11,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 164 [2024-11-09 06:02:11,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:02:11,907 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 61 treesize of output 57 [2024-11-09 06:02:11,917 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:02:11,918 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 0 case distinctions, treesize of input 46 treesize of output 36 [2024-11-09 06:02:11,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:02:11,971 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-09 06:02:11,971 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 06:02:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:12,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129816826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:02:12,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1404949730] [2024-11-09 06:02:12,199 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-09 06:02:12,200 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:02:12,200 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:02:12,200 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:02:12,200 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:02:20,031 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:03:22,299 WARN L286 SmtUtils]: Spent 20.26s on a formula simplification. DAG size of input: 308 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:03:58,054 WARN L286 SmtUtils]: Spent 19.97s on a formula simplification. DAG size of input: 333 DAG size of output: 312 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:05:00,906 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12844#(and (<= 0 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= (+ 16 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem17#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) 1)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 12 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2024-11-09 06:05:00,906 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:05:00,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:05:00,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 41 [2024-11-09 06:05:00,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132191379] [2024-11-09 06:05:00,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:05:00,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 06:05:00,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:05:00,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 06:05:00,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=4371, Unknown=79, NotChecked=136, Total=4970 [2024-11-09 06:05:00,910 INFO L87 Difference]: Start difference. First operand 276 states and 330 transitions. Second operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 0 states have call successors, (0), 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:05:03,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:05:05,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:05:10,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:05:12,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:05:42,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:05:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:05:47,030 INFO L93 Difference]: Finished difference Result 379 states and 443 transitions. [2024-11-09 06:05:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 06:05:47,031 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 0 states have call successors, (0), 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 32 [2024-11-09 06:05:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:05:47,032 INFO L225 Difference]: With dead ends: 379 [2024-11-09 06:05:47,032 INFO L226 Difference]: Without dead ends: 379 [2024-11-09 06:05:47,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2894 ImplicationChecksByTransitivity, 201.8s TimeCoverageRelationStatistics Valid=844, Invalid=7819, Unknown=83, NotChecked=184, Total=8930 [2024-11-09 06:05:47,035 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 450 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 107 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:05:47,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1128 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1889 Invalid, 5 Unknown, 268 Unchecked, 16.2s Time] [2024-11-09 06:05:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-09 06:05:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 280. [2024-11-09 06:05:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 259 states have (on average 1.2895752895752897) internal successors, (334), 279 states have internal predecessors, (334), 0 states have call successors, (0), 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:05:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 334 transitions. [2024-11-09 06:05:47,044 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 334 transitions. Word has length 32 [2024-11-09 06:05:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:05:47,044 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 334 transitions. [2024-11-09 06:05:47,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 0 states have call successors, (0), 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:05:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 334 transitions. [2024-11-09 06:05:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 06:05:47,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:05:47,046 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:05:47,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:05:47,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:05:47,247 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:05:47,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:05:47,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1950320040, now seen corresponding path program 1 times [2024-11-09 06:05:47,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:05:47,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440791449] [2024-11-09 06:05:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:05:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:05:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:05:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:05:49,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:05:49,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440791449] [2024-11-09 06:05:49,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440791449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:05:49,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492434418] [2024-11-09 06:05:49,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:05:49,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:05:49,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:05:49,256 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:05:49,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8baff4f0-af1c-4814-8634-b9f1f490da21/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:05:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:05:49,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 06:05:49,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:05:49,479 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:05:49,581 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 06:05:49,582 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 17 treesize of output 21 [2024-11-09 06:05:49,716 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:05:49,915 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:05:49,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 06:05:50,254 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-09 06:05:50,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-09 06:05:50,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:50,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-09 06:05:50,922 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:05:50,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 47 [2024-11-09 06:05:51,305 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:05:51,305 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 53 treesize of output 38 [2024-11-09 06:05:51,444 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:05:51,445 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 53 treesize of output 38 [2024-11-09 06:05:51,547 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-09 06:05:51,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-09 06:05:51,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:51,899 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-09 06:05:51,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 45 [2024-11-09 06:05:52,476 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-09 06:05:52,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 92 [2024-11-09 06:05:52,519 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 41 treesize of output 25 [2024-11-09 06:05:56,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:56,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 123 [2024-11-09 06:05:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:05:56,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:05:57,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:57,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2024-11-09 06:05:59,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:05:59,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:05:59,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:59,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 66 [2024-11-09 06:05:59,995 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 72 treesize of output 68 [2024-11-09 06:06:00,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:00,025 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 96 treesize of output 84 [2024-11-09 06:06:00,034 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:06:00,039 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 57 treesize of output 49 [2024-11-09 06:06:00,048 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:06:00,053 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 41 treesize of output 37 [2024-11-09 06:06:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:06:01,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492434418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:06:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1341473165] [2024-11-09 06:06:01,573 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2024-11-09 06:06:01,573 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:06:01,574 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:06:01,574 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:06:01,574 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:06:10,224 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:06:46,182 WARN L286 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 288 DAG size of output: 268 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)