./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/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_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/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_9f886fb8-053a-475e-8c8e-f584b00ef601/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 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:55:48,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:55:49,030 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:55:49,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:55:49,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:55:49,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:55:49,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:55:49,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:55:49,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:55:49,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:55:49,077 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:55:49,077 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:55:49,078 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:55:49,083 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:55:49,083 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:55:49,083 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:55:49,084 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:55:49,084 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:55:49,084 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:55:49,085 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:55:49,085 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:55:49,085 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:55:49,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:55:49,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:55:49,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:55:49,087 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:55:49,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:55:49,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:55:49,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:55:49,088 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:55:49,088 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:55:49,088 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:55:49,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:55:49,089 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:55:49,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:55:49,091 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:55:49,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:55:49,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:55:49,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:55:49,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:55:49,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:55:49,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:55:49,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:55:49,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:55:49,094 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:55:49,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:55:49,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:55:49,094 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:55:49,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:55:49,095 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_9f886fb8-053a-475e-8c8e-f584b00ef601/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_9f886fb8-053a-475e-8c8e-f584b00ef601/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 -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2024-11-09 05:55:49,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:55:49,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:55:49,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:55:49,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:55:49,449 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:55:49,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i Unable to find full path for "g++" [2024-11-09 05:55:51,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:55:51,771 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:55:51,771 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2024-11-09 05:55:51,791 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/data/a38269e6c/f4581cabfa574951b80e6531b5e9f0b4/FLAG8db9cb299 [2024-11-09 05:55:51,811 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/data/a38269e6c/f4581cabfa574951b80e6531b5e9f0b4 [2024-11-09 05:55:51,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:55:51,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:55:51,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:55:51,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:55:51,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:55:51,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:55:51" (1/1) ... [2024-11-09 05:55:51,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44107059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:51, skipping insertion in model container [2024-11-09 05:55:51,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:55:51" (1/1) ... [2024-11-09 05:55:51,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:55:52,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:55:52,277 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:55:52,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:55:52,389 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:55:52,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:52 WrapperNode [2024-11-09 05:55:52,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:55:52,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:55:52,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:55:52,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:55:52,399 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:55:52" (1/1) ... [2024-11-09 05:55:52,423 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:55:52" (1/1) ... [2024-11-09 05:55:52,451 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 187 [2024-11-09 05:55:52,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:55:52,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:55:52,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:55:52,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:55:52,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:52" (1/1) ... [2024-11-09 05:55:52,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:52" (1/1) ... [2024-11-09 05:55:52,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:52" (1/1) ... [2024-11-09 05:55:52,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:52" (1/1) ... [2024-11-09 05:55:52,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:52" (1/1) ... [2024-11-09 05:55:52,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:52" (1/1) ... [2024-11-09 05:55:52,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:52" (1/1) ... [2024-11-09 05:55:52,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:52" (1/1) ... [2024-11-09 05:55:52,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:55:52,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:55:52,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:55:52,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:55:52,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:52" (1/1) ... [2024-11-09 05:55:52,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:55:52,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:55:52,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/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:55:52,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/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:55:52,570 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 05:55:52,570 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 05:55:52,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:55:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:55:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:55:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:55:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:55:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:55:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:55:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:55:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:55:52,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:55:52,717 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:55:52,720 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:55:53,434 INFO L? ?]: Removed 166 outVars from TransFormulas that were not future-live. [2024-11-09 05:55:53,435 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:55:53,590 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:55:53,590 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-09 05:55:53,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:55:53 BoogieIcfgContainer [2024-11-09 05:55:53,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:55:53,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:55:53,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:55:53,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:55:53,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:55:51" (1/3) ... [2024-11-09 05:55:53,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b22f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:55:53, skipping insertion in model container [2024-11-09 05:55:53,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:52" (2/3) ... [2024-11-09 05:55:53,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b22f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:55:53, skipping insertion in model container [2024-11-09 05:55:53,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:55:53" (3/3) ... [2024-11-09 05:55:53,602 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2024-11-09 05:55:53,625 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:55:53,626 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2024-11-09 05:55:53,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:55:53,694 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;@2771dba0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:55:53,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2024-11-09 05:55:53,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 81 states have (on average 2.3580246913580245) internal successors, (191), 156 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:55:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:55:53,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:53,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:55:53,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:55:53,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:53,726 INFO L85 PathProgramCache]: Analyzing trace with hash 13095, now seen corresponding path program 1 times [2024-11-09 05:55:53,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:53,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363631778] [2024-11-09 05:55:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:53,964 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:55:53,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363631778] [2024-11-09 05:55:53,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363631778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:53,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:53,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:55:53,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514412887] [2024-11-09 05:55:53,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:53,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:55:53,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:54,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:55:54,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:55:54,019 INFO L87 Difference]: Start difference. First operand has 164 states, 81 states have (on average 2.3580246913580245) internal successors, (191), 156 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:54,318 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2024-11-09 05:55:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:55:54,321 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:55:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:54,331 INFO L225 Difference]: With dead ends: 153 [2024-11-09 05:55:54,331 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 05:55:54,333 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:55:54,339 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 138 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:54,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 102 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:55:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 05:55:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-09 05:55:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 74 states have (on average 2.189189189189189) internal successors, (162), 150 states have internal predecessors, (162), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2024-11-09 05:55:54,406 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 2 [2024-11-09 05:55:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:54,407 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2024-11-09 05:55:54,407 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:55:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2024-11-09 05:55:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:55:54,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:54,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:55:54,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:55:54,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:55:54,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash 13096, now seen corresponding path program 1 times [2024-11-09 05:55:54,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493627211] [2024-11-09 05:55:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:54,595 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:55:54,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:54,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493627211] [2024-11-09 05:55:54,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493627211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:54,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:54,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:55:54,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740001546] [2024-11-09 05:55:54,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:54,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:55:54,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:55:54,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:55:54,601 INFO L87 Difference]: Start difference. First operand 152 states and 168 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:55:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:54,832 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2024-11-09 05:55:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:55:54,833 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:55:54,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:54,835 INFO L225 Difference]: With dead ends: 149 [2024-11-09 05:55:54,837 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 05:55:54,838 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:55:54,839 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 138 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:54,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 101 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:55:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 05:55:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-09 05:55:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 74 states have (on average 2.1486486486486487) internal successors, (159), 147 states have internal predecessors, (159), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2024-11-09 05:55:54,858 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 2 [2024-11-09 05:55:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:54,858 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2024-11-09 05:55:54,859 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:55:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2024-11-09 05:55:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:55:54,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:54,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:54,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:55:54,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:55:54,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:54,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1233236197, now seen corresponding path program 1 times [2024-11-09 05:55:54,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:54,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394471154] [2024-11-09 05:55:54,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:54,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:55,087 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:55:55,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:55,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394471154] [2024-11-09 05:55:55,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394471154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:55,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:55,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:55:55,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241463128] [2024-11-09 05:55:55,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:55,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:55:55,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:55,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:55:55,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:55:55,092 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:55,429 INFO L93 Difference]: Finished difference Result 148 states and 175 transitions. [2024-11-09 05:55:55,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:55:55,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 05:55:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:55,431 INFO L225 Difference]: With dead ends: 148 [2024-11-09 05:55:55,431 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 05:55:55,432 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:55:55,436 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 215 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:55,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 71 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:55:55,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 05:55:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2024-11-09 05:55:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 89 states have (on average 1.898876404494382) internal successors, (169), 144 states have internal predecessors, (169), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 175 transitions. [2024-11-09 05:55:55,449 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 175 transitions. Word has length 7 [2024-11-09 05:55:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:55,450 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 175 transitions. [2024-11-09 05:55:55,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2024-11-09 05:55:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:55:55,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:55,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:55,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:55:55,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:55:55,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1233236198, now seen corresponding path program 1 times [2024-11-09 05:55:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873318056] [2024-11-09 05:55:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:55,865 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:55:55,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:55,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873318056] [2024-11-09 05:55:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873318056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:55,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:55,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:55:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059529879] [2024-11-09 05:55:55,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:55,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:55:55,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:55,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:55:55,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:55:55,870 INFO L87 Difference]: Start difference. First operand 146 states and 175 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:56,332 INFO L93 Difference]: Finished difference Result 208 states and 246 transitions. [2024-11-09 05:55:56,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:55:56,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 05:55:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:56,335 INFO L225 Difference]: With dead ends: 208 [2024-11-09 05:55:56,337 INFO L226 Difference]: Without dead ends: 208 [2024-11-09 05:55:56,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:55:56,338 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 259 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:56,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 138 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:55:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-09 05:55:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 189. [2024-11-09 05:55:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 132 states have (on average 1.7803030303030303) internal successors, (235), 187 states have internal predecessors, (235), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 241 transitions. [2024-11-09 05:55:56,363 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 241 transitions. Word has length 7 [2024-11-09 05:55:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:56,363 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 241 transitions. [2024-11-09 05:55:56,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:56,364 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 241 transitions. [2024-11-09 05:55:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:55:56,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:56,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:56,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:55:56,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:55:56,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash -270641295, now seen corresponding path program 1 times [2024-11-09 05:55:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:56,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398752717] [2024-11-09 05:55:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:56,520 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:55:56,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:56,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398752717] [2024-11-09 05:55:56,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398752717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:56,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:56,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:55:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796842225] [2024-11-09 05:55:56,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:56,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:55:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:56,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:55:56,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:55:56,524 INFO L87 Difference]: Start difference. First operand 189 states and 241 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:56,775 INFO L93 Difference]: Finished difference Result 188 states and 239 transitions. [2024-11-09 05:55:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:55:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:55:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:56,776 INFO L225 Difference]: With dead ends: 188 [2024-11-09 05:55:56,776 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 05:55:56,777 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:55:56,778 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 3 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:56,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 352 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:55:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 05:55:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-09 05:55:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 132 states have (on average 1.7651515151515151) internal successors, (233), 186 states have internal predecessors, (233), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 239 transitions. [2024-11-09 05:55:56,791 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 239 transitions. Word has length 9 [2024-11-09 05:55:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:56,791 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 239 transitions. [2024-11-09 05:55:56,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 239 transitions. [2024-11-09 05:55:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:55:56,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:56,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:56,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:55:56,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:55:56,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash -270641294, now seen corresponding path program 1 times [2024-11-09 05:55:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736386226] [2024-11-09 05:55:56,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:56,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:57,020 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:55:57,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:57,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736386226] [2024-11-09 05:55:57,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736386226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:57,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:57,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:55:57,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364793687] [2024-11-09 05:55:57,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:57,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:55:57,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:57,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:55:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:55:57,022 INFO L87 Difference]: Start difference. First operand 188 states and 239 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:57,299 INFO L93 Difference]: Finished difference Result 187 states and 237 transitions. [2024-11-09 05:55:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:55:57,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:55:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:57,302 INFO L225 Difference]: With dead ends: 187 [2024-11-09 05:55:57,302 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 05:55:57,302 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:55:57,303 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 2 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:57,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 330 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:55:57,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 05:55:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-09 05:55:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 132 states have (on average 1.75) internal successors, (231), 185 states have internal predecessors, (231), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2024-11-09 05:55:57,312 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 9 [2024-11-09 05:55:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:57,312 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2024-11-09 05:55:57,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2024-11-09 05:55:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:55:57,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:57,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:57,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:55:57,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:55:57,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:57,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1554572811, now seen corresponding path program 1 times [2024-11-09 05:55:57,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:57,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939608015] [2024-11-09 05:55:57,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:57,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:57,366 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:55:57,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:57,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939608015] [2024-11-09 05:55:57,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939608015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:57,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:57,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:55:57,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943307347] [2024-11-09 05:55:57,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:57,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:55:57,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:57,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:55:57,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:55:57,369 INFO L87 Difference]: Start difference. First operand 187 states and 237 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:57,444 INFO L93 Difference]: Finished difference Result 225 states and 281 transitions. [2024-11-09 05:55:57,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:55:57,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 05:55:57,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:57,447 INFO L225 Difference]: With dead ends: 225 [2024-11-09 05:55:57,447 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 05:55:57,447 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:55:57,451 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 47 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:57,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 264 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:55:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 05:55:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 189. [2024-11-09 05:55:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 134 states have (on average 1.7313432835820894) internal successors, (232), 187 states have internal predecessors, (232), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 238 transitions. [2024-11-09 05:55:57,467 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 238 transitions. Word has length 11 [2024-11-09 05:55:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:57,467 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 238 transitions. [2024-11-09 05:55:57,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 238 transitions. [2024-11-09 05:55:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:55:57,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:57,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:57,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:55:57,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:55:57,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:57,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1907054169, now seen corresponding path program 1 times [2024-11-09 05:55:57,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:57,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499743995] [2024-11-09 05:55:57,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:57,915 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:55:57,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:57,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499743995] [2024-11-09 05:55:57,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499743995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:57,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:57,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:55:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678772182] [2024-11-09 05:55:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:57,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:55:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:57,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:55:57,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:55:57,918 INFO L87 Difference]: Start difference. First operand 189 states and 238 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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:55:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:58,606 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2024-11-09 05:55:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:55:58,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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:55:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:58,608 INFO L225 Difference]: With dead ends: 184 [2024-11-09 05:55:58,608 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 05:55:58,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-09 05:55:58,609 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 211 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:58,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 212 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:55:58,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 05:55:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2024-11-09 05:55:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 128 states have (on average 1.71875) internal successors, (220), 175 states have internal predecessors, (220), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 226 transitions. [2024-11-09 05:55:58,616 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 226 transitions. Word has length 11 [2024-11-09 05:55:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:58,617 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 226 transitions. [2024-11-09 05:55:58,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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:55:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 226 transitions. [2024-11-09 05:55:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:55:58,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:58,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:58,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:55:58,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:55:58,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1907054168, now seen corresponding path program 1 times [2024-11-09 05:55:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542475008] [2024-11-09 05:55:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:58,846 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:55:58,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:58,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542475008] [2024-11-09 05:55:58,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542475008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:58,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:58,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:55:58,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89029958] [2024-11-09 05:55:58,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:58,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:55:58,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:58,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:55:58,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:55:58,849 INFO L87 Difference]: Start difference. First operand 177 states and 226 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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:55:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:59,292 INFO L93 Difference]: Finished difference Result 177 states and 225 transitions. [2024-11-09 05:55:59,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:55:59,292 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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:55:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:59,293 INFO L225 Difference]: With dead ends: 177 [2024-11-09 05:55:59,293 INFO L226 Difference]: Without dead ends: 177 [2024-11-09 05:55:59,294 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:55:59,294 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 201 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:59,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 206 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:55:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-09 05:55:59,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2024-11-09 05:55:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 128 states have (on average 1.7109375) internal successors, (219), 174 states have internal predecessors, (219), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 225 transitions. [2024-11-09 05:55:59,314 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 225 transitions. Word has length 11 [2024-11-09 05:55:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:59,315 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 225 transitions. [2024-11-09 05:55:59,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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:55:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 225 transitions. [2024-11-09 05:55:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:55:59,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:59,315 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:59,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:55:59,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:55:59,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash -758231733, now seen corresponding path program 1 times [2024-11-09 05:55:59,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:59,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896919341] [2024-11-09 05:55:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:55:59,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:59,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896919341] [2024-11-09 05:55:59,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896919341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:59,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:59,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:55:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747159767] [2024-11-09 05:55:59,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:59,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:55:59,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:59,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:55:59,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:55:59,390 INFO L87 Difference]: Start difference. First operand 176 states and 225 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:59,607 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2024-11-09 05:55:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:55:59,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 05:55:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:59,608 INFO L225 Difference]: With dead ends: 198 [2024-11-09 05:55:59,608 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 05:55:59,609 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:55:59,609 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 233 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:59,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 167 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:55:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 05:55:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 175. [2024-11-09 05:55:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 128 states have (on average 1.671875) internal successors, (214), 173 states have internal predecessors, (214), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 219 transitions. [2024-11-09 05:55:59,620 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 219 transitions. Word has length 20 [2024-11-09 05:55:59,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:59,620 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 219 transitions. [2024-11-09 05:55:59,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 219 transitions. [2024-11-09 05:55:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 05:55:59,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:59,622 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] [2024-11-09 05:55:59,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:55:59,622 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:55:59,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1214547819, now seen corresponding path program 1 times [2024-11-09 05:55:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:59,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328638356] [2024-11-09 05:55:59,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:59,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:56:00,292 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:56:00,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:56:00,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328638356] [2024-11-09 05:56:00,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328638356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:56:00,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602137615] [2024-11-09 05:56:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:56:00,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:56:00,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:56:00,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:56:00,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:56:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:56:00,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 05:56:00,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:00,518 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:56:00,623 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:56:00,624 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:56:00,684 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:56:00,803 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:56:00,803 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:56:00,917 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:56:00,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 05:56:00,974 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:56:00,975 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:56:01,169 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 25 treesize of output 13 [2024-11-09 05:56:01,174 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:56:01,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:56:01,685 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-09 05:56:01,686 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 29 treesize of output 28 [2024-11-09 05:56:01,708 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_127| Int) (v_ArrVal_334 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_127|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_127|))) is different from false [2024-11-09 05:56:01,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_127| Int) (v_ArrVal_334 (Array Int Int))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_334))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_127|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_127|))) is different from false [2024-11-09 05:56:01,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:56:01,759 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 36 treesize of output 29 [2024-11-09 05:56:01,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:56:01,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 123 [2024-11-09 05:56:01,805 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 72 treesize of output 68 [2024-11-09 05:56:01,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:56:01,828 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 68 treesize of output 66 [2024-11-09 05:56:02,440 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:56:02,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602137615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:56:02,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [809389567] [2024-11-09 05:56:02,462 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-09 05:56:02,462 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:56:02,467 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:56:02,473 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:56:02,473 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:56:09,195 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:57:18,729 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3961#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))) (<= (+ |ULTIMATE.start_main_~x~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (exists ((|v_#memory_int_96| (Array Int (Array Int Int))) (|v_#memory_int_97| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_157| Int) (|v_#memory_$Pointer$.offset_109| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (store (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 8))))) (= |#memory_int| (store |v_#memory_int_98| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_int_98| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 8) 1))) (= (store |v_#memory_int_96| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_int_96| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) (select (select |v_#memory_int_97| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4)))) |v_#memory_int_97|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_157|) 1) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) 1) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_131|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_131|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_157|)) (<= (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 12) (select |#length| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))) (<= 0 (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (= |v_#memory_int_98| (store |v_#memory_int_97| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_int_97| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (select (select |v_#memory_int_98| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (store (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 8) (select (select |#memory_$Pointer$.base| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_131|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 8))))))) (exists ((|v_ULTIMATE.start_main_~marked~0#1_39| Int) (|v_ULTIMATE.start_main_~marked~0#1_40| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (not (= |v_ULTIMATE.start_main_~marked~0#1_40| 0)) (or (and (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0) (= |v_ULTIMATE.start_main_~marked~0#1_40| |v_ULTIMATE.start_main_~marked~0#1_39|)) (and (not (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (= |v_ULTIMATE.start_main_~marked~0#1_40| 1))) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)))) (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:18,730 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:57:18,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:57:18,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-11-09 05:57:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722264477] [2024-11-09 05:57:18,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:57:18,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 05:57:18,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:18,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 05:57:18,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1976, Unknown=25, NotChecked=182, Total=2352 [2024-11-09 05:57:18,739 INFO L87 Difference]: Start difference. First operand 175 states and 219 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 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:57:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:23,397 INFO L93 Difference]: Finished difference Result 290 states and 356 transitions. [2024-11-09 05:57:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:57:23,398 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 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:57:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:23,402 INFO L225 Difference]: With dead ends: 290 [2024-11-09 05:57:23,402 INFO L226 Difference]: Without dead ends: 290 [2024-11-09 05:57:23,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 71.5s TimeCoverageRelationStatistics Valid=312, Invalid=2751, Unknown=25, NotChecked=218, Total=3306 [2024-11-09 05:57:23,404 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1200 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 624 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:23,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 914 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1626 Invalid, 0 Unknown, 624 Unchecked, 3.4s Time] [2024-11-09 05:57:23,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-09 05:57:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 201. [2024-11-09 05:57:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 154 states have (on average 1.6103896103896105) internal successors, (248), 199 states have internal predecessors, (248), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 253 transitions. [2024-11-09 05:57:23,412 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 253 transitions. Word has length 23 [2024-11-09 05:57:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:23,413 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 253 transitions. [2024-11-09 05:57:23,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 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:57:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 253 transitions. [2024-11-09 05:57:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 05:57:23,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:23,414 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] [2024-11-09 05:57:23,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:57:23,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 05:57:23,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:57:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1214547818, now seen corresponding path program 1 times [2024-11-09 05:57:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:23,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511746438] [2024-11-09 05:57:23,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:25,039 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:57:25,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511746438] [2024-11-09 05:57:25,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511746438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:57:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941373996] [2024-11-09 05:57:25,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:25,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:57:25,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:57:25,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:57:25,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:57:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:25,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 05:57:25,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:57:25,198 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:57:25,378 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:57:25,412 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:57:25,413 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:57:25,507 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:57:25,518 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:57:25,783 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:57:25,784 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 50 treesize of output 45 [2024-11-09 05:57:25,798 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:57:25,931 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:57:25,931 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:57:25,971 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:57:25,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 05:57:26,094 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:57:26,094 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 50 treesize of output 45 [2024-11-09 05:57:26,105 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:57:26,412 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 25 treesize of output 13 [2024-11-09 05:57:26,427 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:57:26,428 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:57:26,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:57:27,438 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_134| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_134|) (< |v_ULTIMATE.start_main_~x~0#1.offset_134| 0) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_134|) 9)))) (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_134| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_134|) (< |v_ULTIMATE.start_main_~x~0#1.offset_134| 0) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_434))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435) .cse0 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_134|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_134|)))))))) is different from false [2024-11-09 05:57:27,500 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|))) (and (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_134| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_134|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_435) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_434) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_134|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_134| 0))) (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_134| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_134|) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_434))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_435) .cse1 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_134|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_134|))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_134| 0))))) is different from false [2024-11-09 05:57:27,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:57:27,534 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 73 treesize of output 74 [2024-11-09 05:57:27,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:57:27,545 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 65 treesize of output 50 [2024-11-09 05:57:27,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:57:27,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 567 [2024-11-09 05:57:27,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:57:27,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1831 treesize of output 1742 [2024-11-09 05:57:27,718 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 547 treesize of output 523 [2024-11-09 05:57:27,756 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 523 treesize of output 499 [2024-11-09 05:57:27,775 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 499 treesize of output 491 [2024-11-09 05:57:27,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:57:27,818 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 491 treesize of output 447 [2024-11-09 05:57:28,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:57:28,730 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 38 treesize of output 39 [2024-11-09 05:57:28,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:57:28,746 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 30 treesize of output 31 [2024-11-09 05:57:28,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:57:28,759 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 28 treesize of output 20 [2024-11-09 05:57:28,766 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:57:28,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:28,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:28,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 05:57:29,293 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:57:29,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941373996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:57:29,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1899251410] [2024-11-09 05:57:29,297 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-09 05:57:29,297 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:57:29,298 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:57:29,298 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:57:29,298 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:57:35,941 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:59:08,994 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4654#(and (<= 1 |#StackHeapBarrier|) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0))) (or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 8) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 12))) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_139| Int) (|v_ULTIMATE.start_main_~x~0#1.base_166| Int) (|v_#memory_$Pointer$.offset_139| (Array Int (Array Int Int))) (|v_#memory_int_122| (Array Int (Array Int Int))) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (store (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (select (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 8))))) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_139|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_166|)) (<= 0 (select (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (= (store |v_#memory_int_123| (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_int_123| (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (select (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (select (select |v_#memory_int_124| (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (select (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)))) |v_#memory_int_124|) (= (store |v_#memory_int_122| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_int_122| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) (select (select |v_#memory_int_123| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4)))) |v_#memory_int_123|) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (store (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (select (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 8) (select (select |#memory_$Pointer$.base| (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 8))))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) 1) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_166|) 1) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_139|) (= (store |v_#memory_int_124| (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_int_124| (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 8) 1)) |#memory_int|) (<= (+ (select (select (store |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.offset_139| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 12) (select |#length| (select (select (store |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) (store (select |v_#memory_$Pointer$.base_143| (select (select |v_#memory_$Pointer$.base_143| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|)) (+ (select (select |v_#memory_$Pointer$.offset_139| |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|) 4) |v_ULTIMATE.start_main_~x~0#1.base_166|)) |v_ULTIMATE.start_main_~x~0#1.base_166|) |v_ULTIMATE.start_main_~x~0#1.offset_139|))))) (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_~marked~0#1_48| Int) (|v_ULTIMATE.start_main_~marked~0#1_49| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (not (= |v_ULTIMATE.start_main_~marked~0#1_49| 0)) (or (and (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0) (= |v_ULTIMATE.start_main_~marked~0#1_49| |v_ULTIMATE.start_main_~marked~0#1_48|)) (and (not (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (= |v_ULTIMATE.start_main_~marked~0#1_49| 1))) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)))))' at error location [2024-11-09 05:59:08,994 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:59:08,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:59:08,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 31 [2024-11-09 05:59:08,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868436144] [2024-11-09 05:59:08,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:59:08,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 05:59:08,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:59:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 05:59:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2204, Unknown=45, NotChecked=194, Total=2652 [2024-11-09 05:59:08,997 INFO L87 Difference]: Start difference. First operand 201 states and 253 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:59:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:59:13,259 INFO L93 Difference]: Finished difference Result 287 states and 353 transitions. [2024-11-09 05:59:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:59:13,260 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 05:59:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:59:13,261 INFO L225 Difference]: With dead ends: 287 [2024-11-09 05:59:13,261 INFO L226 Difference]: Without dead ends: 287 [2024-11-09 05:59:13,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 95.9s TimeCoverageRelationStatistics Valid=395, Invalid=3226, Unknown=47, NotChecked=238, Total=3906 [2024-11-09 05:59:13,263 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 1190 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 636 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:59:13,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 776 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1847 Invalid, 0 Unknown, 636 Unchecked, 3.2s Time] [2024-11-09 05:59:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-09 05:59:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 201. [2024-11-09 05:59:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 154 states have (on average 1.603896103896104) internal successors, (247), 199 states have internal predecessors, (247), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:59:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 252 transitions. [2024-11-09 05:59:13,269 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 252 transitions. Word has length 23 [2024-11-09 05:59:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:59:13,270 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 252 transitions. [2024-11-09 05:59:13,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:59:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 252 transitions. [2024-11-09 05:59:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 05:59:13,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:13,271 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] [2024-11-09 05:59:13,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 05:59:13,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 05:59:13,476 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:59:13,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:13,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1004013531, now seen corresponding path program 1 times [2024-11-09 05:59:13,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:13,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696276183] [2024-11-09 05:59:13,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:13,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:59:13,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:13,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696276183] [2024-11-09 05:59:13,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696276183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:59:13,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:59:13,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:59:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565857589] [2024-11-09 05:59:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:59:13,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:59:13,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:59:13,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:59:13,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:59:13,524 INFO L87 Difference]: Start difference. First operand 201 states and 252 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:59:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:59:13,619 INFO L93 Difference]: Finished difference Result 204 states and 255 transitions. [2024-11-09 05:59:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:59:13,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 24 [2024-11-09 05:59:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:59:13,621 INFO L225 Difference]: With dead ends: 204 [2024-11-09 05:59:13,621 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 05:59:13,622 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:59:13,622 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:59:13,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:59:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 05:59:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-09 05:59:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 157 states have (on average 1.5923566878980893) internal successors, (250), 202 states have internal predecessors, (250), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:59:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 255 transitions. [2024-11-09 05:59:13,628 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 255 transitions. Word has length 24 [2024-11-09 05:59:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:59:13,628 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 255 transitions. [2024-11-09 05:59:13,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:59:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 255 transitions. [2024-11-09 05:59:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 05:59:13,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:13,629 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] [2024-11-09 05:59:13,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:59:13,629 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 05:59:13,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:13,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1781259347, now seen corresponding path program 1 times [2024-11-09 05:59:13,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:13,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191835293] [2024-11-09 05:59:13,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:13,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:59:14,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:14,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191835293] [2024-11-09 05:59:14,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191835293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:59:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701276486] [2024-11-09 05:59:14,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:14,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:59:14,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:59:14,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:59:14,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:59:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:14,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 05:59:14,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:59:14,713 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:59:14,857 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:59:14,858 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:59:14,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:59:14,967 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:59:15,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:59:15,105 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2024-11-09 05:59:15,112 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:59:15,214 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:59:15,214 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 24 treesize of output 17 [2024-11-09 05:59:15,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:59:15,228 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:59:15,299 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:59:15,300 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 66 treesize of output 59 [2024-11-09 05:59:15,312 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 25 treesize of output 17 [2024-11-09 05:59:15,319 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 41 treesize of output 26 [2024-11-09 05:59:15,595 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 33 treesize of output 21 [2024-11-09 05:59:15,601 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 28 treesize of output 16 [2024-11-09 05:59:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:59:15,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:59:16,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2024-11-09 05:59:17,118 INFO L349 Elim1Store]: treesize reduction 17, result has 69.6 percent of original size [2024-11-09 05:59:17,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 94 [2024-11-09 05:59:17,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:59:17,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 215 treesize of output 212 [2024-11-09 05:59:17,191 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 88 treesize of output 82 [2024-11-09 05:59:17,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:59:17,271 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 63 treesize of output 67 [2024-11-09 05:59:17,562 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 05:59:17,563 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 1 [2024-11-09 05:59:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:59:18,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701276486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:59:18,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [851641625] [2024-11-09 05:59:18,049 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 05:59:18,049 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:59:18,049 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:59:18,049 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:59:18,050 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:59:23,652 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:00:19,315 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5595#true' at error location [2024-11-09 06:00:19,315 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:00:19,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:00:19,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 36 [2024-11-09 06:00:19,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985172252] [2024-11-09 06:00:19,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:00:19,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 06:00:19,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:19,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 06:00:19,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2662, Unknown=28, NotChecked=0, Total=2862 [2024-11-09 06:00:19,319 INFO L87 Difference]: Start difference. First operand 204 states and 255 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 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:00:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:34,917 INFO L93 Difference]: Finished difference Result 300 states and 358 transitions. [2024-11-09 06:00:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 06:00:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 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 06:00:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:34,919 INFO L225 Difference]: With dead ends: 300 [2024-11-09 06:00:34,919 INFO L226 Difference]: Without dead ends: 300 [2024-11-09 06:00:34,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 67.8s TimeCoverageRelationStatistics Valid=587, Invalid=5540, Unknown=35, NotChecked=0, Total=6162 [2024-11-09 06:00:34,921 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 934 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 3194 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 3289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:34,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1581 Invalid, 3289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3194 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-09 06:00:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-09 06:00:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 203. [2024-11-09 06:00:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 156 states have (on average 1.5833333333333333) internal successors, (247), 201 states have internal predecessors, (247), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:00:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 252 transitions. [2024-11-09 06:00:34,928 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 252 transitions. Word has length 26 [2024-11-09 06:00:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:34,929 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 252 transitions. [2024-11-09 06:00:34,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 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:00:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 252 transitions. [2024-11-09 06:00:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:00:34,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:34,930 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] [2024-11-09 06:00:34,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:00:35,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 06:00:35,135 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 06:00:35,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:35,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1512083080, now seen corresponding path program 1 times [2024-11-09 06:00:35,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:35,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637619072] [2024-11-09 06:00:35,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:35,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:00:35,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637619072] [2024-11-09 06:00:35,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637619072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:35,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:00:35,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:00:35,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724961301] [2024-11-09 06:00:35,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:35,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:00:35,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:35,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:00:35,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:00:35,221 INFO L87 Difference]: Start difference. First operand 203 states and 252 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 06:00:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:35,457 INFO L93 Difference]: Finished difference Result 199 states and 244 transitions. [2024-11-09 06:00:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:00:35,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 26 [2024-11-09 06:00:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:35,458 INFO L225 Difference]: With dead ends: 199 [2024-11-09 06:00:35,458 INFO L226 Difference]: Without dead ends: 199 [2024-11-09 06:00:35,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:00:35,459 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 17 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:35,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 171 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:00:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-09 06:00:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-09 06:00:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 197 states have internal predecessors, (239), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:00:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 244 transitions. [2024-11-09 06:00:35,466 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 244 transitions. Word has length 26 [2024-11-09 06:00:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:35,466 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 244 transitions. [2024-11-09 06:00:35,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 06:00:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 244 transitions. [2024-11-09 06:00:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:00:35,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:35,468 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] [2024-11-09 06:00:35,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:00:35,468 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 06:00:35,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1512083079, now seen corresponding path program 1 times [2024-11-09 06:00:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:35,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200604921] [2024-11-09 06:00:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:00:35,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:35,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200604921] [2024-11-09 06:00:35,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200604921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:35,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:00:35,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:00:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596668697] [2024-11-09 06:00:35,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:35,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:00:35,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:35,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:00:35,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:00:35,592 INFO L87 Difference]: Start difference. First operand 199 states and 244 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 06:00:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:35,846 INFO L93 Difference]: Finished difference Result 195 states and 236 transitions. [2024-11-09 06:00:35,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:00:35,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 26 [2024-11-09 06:00:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:35,848 INFO L225 Difference]: With dead ends: 195 [2024-11-09 06:00:35,848 INFO L226 Difference]: Without dead ends: 195 [2024-11-09 06:00:35,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:00:35,850 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 17 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:35,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 161 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:00:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-09 06:00:35,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-09 06:00:35,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 156 states have (on average 1.4807692307692308) internal successors, (231), 193 states have internal predecessors, (231), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:00:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 236 transitions. [2024-11-09 06:00:35,858 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 236 transitions. Word has length 26 [2024-11-09 06:00:35,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:35,858 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 236 transitions. [2024-11-09 06:00:35,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 06:00:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 236 transitions. [2024-11-09 06:00:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:00:35,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:35,864 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] [2024-11-09 06:00:35,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:00:35,865 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 06:00:35,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:35,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1085555654, now seen corresponding path program 1 times [2024-11-09 06:00:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:35,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729243896] [2024-11-09 06:00:35,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:00:36,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:36,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729243896] [2024-11-09 06:00:36,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729243896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:36,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:00:36,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:00:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140487788] [2024-11-09 06:00:36,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:36,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:00:36,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:36,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:00:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:00:36,075 INFO L87 Difference]: Start difference. First operand 195 states and 236 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:00:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:36,540 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2024-11-09 06:00:36,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:00:36,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 06:00:36,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:36,542 INFO L225 Difference]: With dead ends: 206 [2024-11-09 06:00:36,542 INFO L226 Difference]: Without dead ends: 206 [2024-11-09 06:00:36,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:00:36,543 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 8 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:36,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 305 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:00:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-09 06:00:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 199. [2024-11-09 06:00:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 160 states have (on average 1.475) internal successors, (236), 197 states have internal predecessors, (236), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:00:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 241 transitions. [2024-11-09 06:00:36,549 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 241 transitions. Word has length 30 [2024-11-09 06:00:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:36,550 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 241 transitions. [2024-11-09 06:00:36,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:00:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 241 transitions. [2024-11-09 06:00:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:00:36,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:36,551 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:00:36,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:00:36,552 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 06:00:36,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1499738764, now seen corresponding path program 1 times [2024-11-09 06:00:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:36,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837956881] [2024-11-09 06:00:36,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:36,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:38,652 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:00:38,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:38,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837956881] [2024-11-09 06:00:38,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837956881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:00:38,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543290808] [2024-11-09 06:00:38,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:38,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:00:38,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:00:38,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:00:38,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:00:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:38,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 06:00:38,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:00:38,829 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:00:39,047 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:00:39,048 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:00:39,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:00:39,179 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:00:39,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:00:39,471 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2024-11-09 06:00:39,481 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:00:39,590 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:00:39,590 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 23 treesize of output 20 [2024-11-09 06:00:39,596 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 06:00:39,634 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:00:39,634 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 24 treesize of output 17 [2024-11-09 06:00:39,748 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:00:39,749 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 66 treesize of output 59 [2024-11-09 06:00:39,755 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 25 treesize of output 17 [2024-11-09 06:00:39,761 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 41 treesize of output 26 [2024-11-09 06:00:40,317 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 33 treesize of output 21 [2024-11-09 06:00:40,325 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 28 treesize of output 16 [2024-11-09 06:00:40,405 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:00:40,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:00:40,753 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 69 treesize of output 49 [2024-11-09 06:00:41,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:00:41,660 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 59 [2024-11-09 06:00:41,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:00:41,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 382 treesize of output 325 [2024-11-09 06:00:41,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:00:41,713 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 128 treesize of output 122 [2024-11-09 06:00:41,721 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 114 treesize of output 106 [2024-11-09 06:00:42,188 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:00:42,198 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:00:42,198 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 18 treesize of output 1 [2024-11-09 06:00:42,713 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:00:42,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543290808] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:00:42,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1841595199] [2024-11-09 06:00:42,716 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-09 06:00:42,717 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:00:42,717 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:00:42,717 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:00:42,718 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:00:48,759 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 58 for LOIs [2024-11-09 06:00:48,777 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:01:18,259 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7781#(and (exists ((|v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| Int)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|)) (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|))) 0)) (<= (+ 12 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|)) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|)) (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|))) 1)) (<= (+ |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| 4) (select |#length| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|)) (<= 0 |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|)) 1) (= 1 (select |#valid| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|)) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|) 0))) (<= 0 (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|))) (or (not (= |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| 0)) (not (= |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| 0))))) (exists ((|v_ULTIMATE.start_main_#t~nondet13#1_13| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet13#1_13| 0)) (<= |v_ULTIMATE.start_main_#t~nondet13#1_13| 2147483647) (<= 0 (+ 2147483648 |v_ULTIMATE.start_main_#t~nondet13#1_13|)))))' at error location [2024-11-09 06:01:18,259 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:01:18,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:01:18,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 36 [2024-11-09 06:01:18,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108161977] [2024-11-09 06:01:18,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:01:18,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 06:01:18,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:01:18,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 06:01:18,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=3284, Unknown=15, NotChecked=0, Total=3540 [2024-11-09 06:01:18,262 INFO L87 Difference]: Start difference. First operand 199 states and 241 transitions. Second operand has 37 states, 37 states have (on average 2.324324324324324) internal successors, (86), 36 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:01:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:01:27,839 INFO L93 Difference]: Finished difference Result 270 states and 325 transitions. [2024-11-09 06:01:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 06:01:27,840 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.324324324324324) internal successors, (86), 36 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 06:01:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:01:27,842 INFO L225 Difference]: With dead ends: 270 [2024-11-09 06:01:27,842 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 06:01:27,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=454, Invalid=4786, Unknown=16, NotChecked=0, Total=5256 [2024-11-09 06:01:27,845 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 949 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 2190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:01:27,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 988 Invalid, 2190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-09 06:01:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 06:01:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 199. [2024-11-09 06:01:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 160 states have (on average 1.46875) internal successors, (235), 197 states have internal predecessors, (235), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:01:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 240 transitions. [2024-11-09 06:01:27,852 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 240 transitions. Word has length 32 [2024-11-09 06:01:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:01:27,852 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 240 transitions. [2024-11-09 06:01:27,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.324324324324324) internal successors, (86), 36 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:01:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 240 transitions. [2024-11-09 06:01:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:01:27,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:01:27,854 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:27,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:01:28,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 06:01:28,055 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 06:01:28,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:01:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash -381445208, now seen corresponding path program 1 times [2024-11-09 06:01:28,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:01:28,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317476367] [2024-11-09 06:01:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:28,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:01:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:29,238 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:29,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:01:29,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317476367] [2024-11-09 06:01:29,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317476367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:29,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016708919] [2024-11-09 06:01:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:29,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:29,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:01:29,242 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:01:29,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:01:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:29,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 06:01:29,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:01:29,865 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:01:29,866 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:29,968 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 16 treesize of output 11 [2024-11-09 06:01:29,982 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 16 treesize of output 11 [2024-11-09 06:01:30,004 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 16 treesize of output 11 [2024-11-09 06:01:30,017 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 16 treesize of output 11 [2024-11-09 06:01:30,036 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 16 treesize of output 11 [2024-11-09 06:01:30,043 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 16 treesize of output 11 [2024-11-09 06:01:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:01:30,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:01:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016708919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:01:30,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:01:30,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2024-11-09 06:01:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386108536] [2024-11-09 06:01:30,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:01:30,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:01:30,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:01:30,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:01:30,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-09 06:01:30,220 INFO L87 Difference]: Start difference. First operand 199 states and 240 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:01:31,330 INFO L93 Difference]: Finished difference Result 213 states and 256 transitions. [2024-11-09 06:01:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:01:31,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:01:31,332 INFO L225 Difference]: With dead ends: 213 [2024-11-09 06:01:31,333 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 06:01:31,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-09 06:01:31,334 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 16 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:01:31,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 292 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:01:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 06:01:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-11-09 06:01:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 172 states have (on average 1.441860465116279) internal successors, (248), 209 states have internal predecessors, (248), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:01:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 253 transitions. [2024-11-09 06:01:31,340 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 253 transitions. Word has length 32 [2024-11-09 06:01:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:01:31,340 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 253 transitions. [2024-11-09 06:01:31,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 253 transitions. [2024-11-09 06:01:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:01:31,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:01:31,341 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:01:31,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 06:01:31,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:31,545 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 06:01:31,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:01:31,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1990197205, now seen corresponding path program 2 times [2024-11-09 06:01:31,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:01:31,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449135938] [2024-11-09 06:01:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:31,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:01:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:01:33,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:01:33,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449135938] [2024-11-09 06:01:33,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449135938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:33,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199864967] [2024-11-09 06:01:33,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:01:33,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:33,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:01:33,805 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:01:33,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:01:34,091 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 06:01:34,091 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:01:34,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 06:01:34,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:01:34,115 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:34,392 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:01:34,392 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:34,520 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:01:34,805 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:01:34,806 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 25 treesize of output 26 [2024-11-09 06:01:34,997 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:01:34,997 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 24 treesize of output 17 [2024-11-09 06:01:35,188 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:01:35,188 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 24 treesize of output 17 [2024-11-09 06:01:35,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:35,307 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 06:01:35,308 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 16 treesize of output 18 [2024-11-09 06:01:35,497 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 06:01:35,498 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 1 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 06:01:35,853 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-11-09 06:01:35,854 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 2 case distinctions, treesize of input 40 treesize of output 42 [2024-11-09 06:01:36,235 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-09 06:01:36,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 48 [2024-11-09 06:01:36,409 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 06:01:36,409 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 70 treesize of output 57 [2024-11-09 06:01:37,204 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:01:37,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2024-11-09 06:01:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:01:37,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:01:38,143 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1132 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_167| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_167| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_167|) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1129))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1132)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|)) 1))) is different from false [2024-11-09 06:01:38,178 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-11-09 06:01:38,179 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 37 treesize of output 36 [2024-11-09 06:01:38,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1132 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_167| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.base| (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|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1129))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1132)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_167| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_167|))) is different from false [2024-11-09 06:01:38,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:01:38,794 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 32 treesize of output 33 [2024-11-09 06:01:38,829 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1132 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_167| Int)) (let ((.cse0 (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (< |v_ULTIMATE.start_main_~x~0#1.offset_167| 0) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_11) .cse0 v_ArrVal_1129))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1132)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|) |c_ULTIMATE.start_main_~x~0#1.base|) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_167|)))) is different from false [2024-11-09 06:01:40,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:01:40,156 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 134 treesize of output 86 [2024-11-09 06:01:40,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:01:40,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4416 treesize of output 3779 [2024-11-09 06:01:40,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:01:40,488 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 1440 treesize of output 1376 [2024-11-09 06:01:40,535 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 1368 treesize of output 1310 [2024-11-09 06:01:40,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:01:40,635 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 769 treesize of output 659 [2024-11-09 06:01:40,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:01:40,720 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 1202 treesize of output 946 [2024-11-09 06:01:41,049 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-11-09 06:01:41,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2024-11-09 06:01:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 06:01:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199864967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:01:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [376338345] [2024-11-09 06:01:43,839 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-09 06:01:43,839 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:01:43,839 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:01:43,840 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:01:43,840 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:01:49,617 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:03:10,096 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9074#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))) (<= (+ |ULTIMATE.start_main_~x~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_199| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_172| Int) (|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_234| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_222| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_198| (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_int_198| (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 8) 1)) |#memory_int|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_172|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_172|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_199|)) (= (store |v_#memory_int_197| (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_int_197| (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (select (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (select (select |v_#memory_int_198| (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (select (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)))) |v_#memory_int_198|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_199|) 1) (<= (+ (select (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 12) (select |#length| (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|))) (= (store |v_#memory_int_196| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_int_196| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) (select (select |v_#memory_int_197| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4)))) |v_#memory_int_197|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (store (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (select (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 8))))) (<= 0 (select (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (store (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (select (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 8) (select (select |#memory_$Pointer$.base| (select (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.base_199|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select (store |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) (store (select |v_#memory_$Pointer$.offset_222| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) (+ (select (select |v_#memory_$Pointer$.offset_222| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|) 8))))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_234| |v_ULTIMATE.start_main_~x~0#1.base_199|) |v_ULTIMATE.start_main_~x~0#1.offset_172|)) 1))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (exists ((|v_ULTIMATE.start_main_~marked~0#1_80| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_ULTIMATE.start_main_~marked~0#1_79| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (or (and (not (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (= |v_ULTIMATE.start_main_~marked~0#1_80| 1)) (and (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0) (= |v_ULTIMATE.start_main_~marked~0#1_80| |v_ULTIMATE.start_main_~marked~0#1_79|))) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)) (not (= |v_ULTIMATE.start_main_~marked~0#1_80| 0)))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (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:03:10,097 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:03:10,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:03:10,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 18] total 48 [2024-11-09 06:03:10,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487178321] [2024-11-09 06:03:10,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:03:10,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 06:03:10,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:10,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 06:03:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=3735, Unknown=43, NotChecked=378, Total=4422 [2024-11-09 06:03:10,101 INFO L87 Difference]: Start difference. First operand 211 states and 253 transitions. Second operand has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 49 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:12,881 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:03:14,894 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:03:16,941 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:03:19,490 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:03:21,501 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:03:23,552 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:03:25,775 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:03:28,141 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:03:30,332 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:03:32,464 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:03:34,827 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:03:40,531 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:03:42,543 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:03:44,624 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:03:54,490 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:04:02,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:04:02,289 INFO L93 Difference]: Finished difference Result 373 states and 450 transitions. [2024-11-09 06:04:02,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 06:04:02,290 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 49 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 06:04:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:04:02,291 INFO L225 Difference]: With dead ends: 373 [2024-11-09 06:04:02,291 INFO L226 Difference]: Without dead ends: 373 [2024-11-09 06:04:02,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 96.2s TimeCoverageRelationStatistics Valid=750, Invalid=6873, Unknown=45, NotChecked=522, Total=8190 [2024-11-09 06:04:02,294 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 716 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 3841 mSolverCounterSat, 129 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 5061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3841 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 1076 IncrementalHoareTripleChecker+Unchecked, 41.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:04:02,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1798 Invalid, 5061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3841 Invalid, 15 Unknown, 1076 Unchecked, 41.8s Time] [2024-11-09 06:04:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-09 06:04:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 238. [2024-11-09 06:04:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 199 states have (on average 1.4221105527638191) internal successors, (283), 236 states have internal predecessors, (283), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:04:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 288 transitions. [2024-11-09 06:04:02,302 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 288 transitions. Word has length 32 [2024-11-09 06:04:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:04:02,302 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 288 transitions. [2024-11-09 06:04:02,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 49 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:04:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 288 transitions. [2024-11-09 06:04:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:04:02,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:04:02,304 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:04:02,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:04:02,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:04:02,515 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 06:04:02,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:04:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1990197206, now seen corresponding path program 2 times [2024-11-09 06:04:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:04:02,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774444878] [2024-11-09 06:04:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:02,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:04:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:04:05,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:04:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774444878] [2024-11-09 06:04:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774444878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:04:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850614931] [2024-11-09 06:04:05,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:04:05,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:04:05,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:04:05,514 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:04:05,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:04:05,751 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 06:04:05,751 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:04:05,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 06:04:05,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:04:05,769 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:04:06,159 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:04:06,159 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:04:06,326 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:04:06,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:04:06,840 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:04:06,841 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 41 treesize of output 38 [2024-11-09 06:04:06,853 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:04:07,139 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:04:07,139 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 24 treesize of output 17 [2024-11-09 06:04:07,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:04:07,176 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 06:04:07,476 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:04:07,477 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 24 treesize of output 17 [2024-11-09 06:04:07,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:04:07,507 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 06:04:07,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:04:07,839 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 06:04:07,839 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 16 treesize of output 18 [2024-11-09 06:04:07,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 11 [2024-11-09 06:04:08,137 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 06:04:08,137 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 1 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 06:04:08,160 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 16 [2024-11-09 06:04:08,706 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-11-09 06:04:08,707 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 2 case distinctions, treesize of input 56 treesize of output 54 [2024-11-09 06:04:08,726 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 31 treesize of output 16 [2024-11-09 06:04:09,094 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-09 06:04:09,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 50 [2024-11-09 06:04:09,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:04:09,108 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 06:04:09,300 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 06:04:09,301 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 96 treesize of output 71 [2024-11-09 06:04:09,319 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 39 treesize of output 16 [2024-11-09 06:04:10,517 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:04:10,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2024-11-09 06:04:10,526 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 26 treesize of output 14 [2024-11-09 06:04:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:04:10,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:04:11,715 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_176| Int) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1295 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_176| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_176|) (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1296) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1295) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_176| Int) (v_ArrVal_1296 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_176| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_176|) (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1296) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|) 9))))) is different from false [2024-11-09 06:04:12,219 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1291 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_176| Int) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_176| 0) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1291))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ 11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1292) .cse0 v_ArrVal_1296) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1295) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_176|))) (forall ((v_ArrVal_1291 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_176| Int) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (or (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1292) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1296) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_176| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_176|)))) is different from false [2024-11-09 06:04:12,288 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|))) (and (forall ((v_ArrVal_1291 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_176| Int) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1291))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ 11 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1292) .cse1 v_ArrVal_1296) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1295) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_176| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_176|))) (forall ((v_ArrVal_1291 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_176| Int) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_176| 0) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1292) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1291) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1296) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_176|))))) is different from false [2024-11-09 06:04:12,363 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~malloc3#1.base|)))) (and (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_176| Int) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_176| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_176|) (< 0 (+ 9 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1290) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1292) (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1296) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|))))) (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_176| Int) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_176| 0) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1291))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1290) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1292) .cse1 v_ArrVal_1296) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1295) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_176|))))) is different from false [2024-11-09 06:04:13,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:13,136 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 226 treesize of output 230 [2024-11-09 06:04:13,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:13,162 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 225 treesize of output 207 [2024-11-09 06:04:13,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:13,193 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 191 treesize of output 195 [2024-11-09 06:04:13,872 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_prenex_4 Int) (v_prenex_1 (Array Int Int)) (v_ArrVal_1295 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_4) (not (= (select |c_#valid| .cse0) 0)) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_13) .cse0 v_prenex_1))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1295)) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_4) |c_ULTIMATE.start_main_~x~0#1.base|) (< v_prenex_4 0)))) (forall ((v_prenex_4 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_ArrVal_1295 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_4) (not (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_13) .cse3 v_prenex_1))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1295)) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_4) .cse3)) (not (= (select |c_#valid| .cse3) 0)) (< v_prenex_4 0)))) (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_176| Int) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_14 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< 0 (+ 9 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1290) .cse4 v_ArrVal_1292) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_14) .cse4 v_ArrVal_1291) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1296) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_176|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_176| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_176|) (not (= (select |c_#valid| .cse4) 0))))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_prenex_4 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_4) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_2) .cse5 v_prenex_7) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_13) .cse5 v_prenex_1) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_prenex_6) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_4) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 1)) (not (= (select |c_#valid| .cse5) 0)) (< v_prenex_4 0))))) is different from false [2024-11-09 06:04:17,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:17,961 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 627 treesize of output 452 [2024-11-09 06:04:17,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:17,990 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 443 treesize of output 404 [2024-11-09 06:04:18,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:18,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34125 treesize of output 28659 [2024-11-09 06:04:19,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:19,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28488 treesize of output 28118 [2024-11-09 06:04:19,355 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 4569 treesize of output 4557 [2024-11-09 06:04:19,449 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 4557 treesize of output 4521 [2024-11-09 06:04:19,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:19,590 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 4521 treesize of output 4524 [2024-11-09 06:04:19,759 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 4515 treesize of output 4503 [2024-11-09 06:04:19,911 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 4503 treesize of output 4473 [2024-11-09 06:04:20,029 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 4473 treesize of output 4457 [2024-11-09 06:04:20,123 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 4457 treesize of output 4421 [2024-11-09 06:04:20,224 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 4421 treesize of output 4395 [2024-11-09 06:04:20,315 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 4395 treesize of output 4383 [2024-11-09 06:04:22,676 INFO L349 Elim1Store]: treesize reduction 4, result has 99.1 percent of original size [2024-11-09 06:04:22,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 4390 treesize of output 4816 [2024-11-09 06:04:23,397 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 4408 treesize of output 4346 [2024-11-09 06:04:23,593 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 4263 treesize of output 4251 [2024-11-09 06:04:23,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:23,829 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 4251 treesize of output 4254 [2024-11-09 06:04:24,068 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 4245 treesize of output 4225 [2024-11-09 06:04:24,262 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 4324 treesize of output 4254 [2024-11-09 06:04:24,488 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 4173 treesize of output 4121 [2024-11-09 06:04:24,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:24,858 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 4218 treesize of output 3980 [2024-11-09 06:04:25,080 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 3893 treesize of output 3805 [2024-11-09 06:04:25,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:25,329 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 3900 treesize of output 3800 [2024-11-09 06:04:25,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:25,578 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 3715 treesize of output 3638 [2024-11-09 06:04:25,791 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 3629 treesize of output 3627 [2024-11-09 06:04:26,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:26,052 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 3720 treesize of output 3554 [2024-11-09 06:04:26,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:26,333 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 3562 treesize of output 3306 [2024-11-09 06:04:26,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:04:26,624 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 3225 treesize of output 3142 [2024-11-09 06:04:26,843 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 3133 treesize of output 3131 [2024-11-09 06:06:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 06:06:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850614931] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:06:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [554189331] [2024-11-09 06:06:54,231 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-09 06:06:54,232 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:06:54,232 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:06:54,232 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:06:54,233 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:06:59,541 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:08:27,632 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9990#(and (or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12))) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))) (exists ((|v_ULTIMATE.start_main_~marked~0#1_88| Int) (|v_ULTIMATE.start_main_~marked~0#1_89| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (or (and (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0) (= |v_ULTIMATE.start_main_~marked~0#1_89| |v_ULTIMATE.start_main_~marked~0#1_88|)) (and (not (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (= |v_ULTIMATE.start_main_~marked~0#1_89| 1))) (not (= |v_ULTIMATE.start_main_~marked~0#1_89| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)))) (<= (+ |ULTIMATE.start_main_~x~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (exists ((|v_#memory_int_224| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_181| Int) (|v_#memory_$Pointer$.base_268| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_209| Int) (|v_#memory_$Pointer$.offset_256| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_223| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_int_223| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (select (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (select (select |v_#memory_int_224| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (select (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)))) |v_#memory_int_224|) (= (store (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (store (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (select (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 8) (select (select |#memory_$Pointer$.base| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ (select (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 8)))) |#memory_$Pointer$.base|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_181|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_209|)) (<= 0 (select (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (= (store |v_#memory_int_222| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_int_222| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (select (select |v_#memory_int_223| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|))))) |v_#memory_int_223|) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) 1) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_209|) 1) (<= (+ (select (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 12) (select |#length| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (store (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (select (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ (select (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 8))))) (= |#memory_int| (store |v_#memory_int_224| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_int_224| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ (select (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) |v_ULTIMATE.start_main_~x~0#1.base_209|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 8) 1))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_181|))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (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:08:27,632 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:08:27,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:08:27,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 18] total 51 [2024-11-09 06:08:27,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457399596] [2024-11-09 06:08:27,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:08:27,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 06:08:27,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:08:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 06:08:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=3882, Unknown=38, NotChecked=650, Total=4830 [2024-11-09 06:08:27,635 INFO L87 Difference]: Start difference. First operand 238 states and 288 transitions. Second operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 52 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:09:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:31,813 INFO L93 Difference]: Finished difference Result 394 states and 477 transitions. [2024-11-09 06:09:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 06:09:31,814 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 52 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:09:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:31,816 INFO L225 Difference]: With dead ends: 394 [2024-11-09 06:09:31,816 INFO L226 Difference]: Without dead ends: 394 [2024-11-09 06:09:31,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 143.1s TimeCoverageRelationStatistics Valid=751, Invalid=7229, Unknown=50, NotChecked=900, Total=8930 [2024-11-09 06:09:31,819 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 755 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 4480 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 6494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 4480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1874 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:31,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 2164 Invalid, 6494 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [140 Valid, 4480 Invalid, 0 Unknown, 1874 Unchecked, 17.7s Time] [2024-11-09 06:09:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-09 06:09:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 248. [2024-11-09 06:09:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 209 states have (on average 1.4162679425837321) internal successors, (296), 246 states have internal predecessors, (296), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 301 transitions. [2024-11-09 06:09:31,828 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 301 transitions. Word has length 32 [2024-11-09 06:09:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:31,829 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 301 transitions. [2024-11-09 06:09:31,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 52 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:09:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 301 transitions. [2024-11-09 06:09:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:09:31,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:31,831 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, 1] [2024-11-09 06:09:31,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 06:09:32,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 06:09:32,032 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 06:09:32,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:32,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1595393402, now seen corresponding path program 1 times [2024-11-09 06:09:32,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:32,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848242021] [2024-11-09 06:09:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:32,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:33,658 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:09:33,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:33,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848242021] [2024-11-09 06:09:33,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848242021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:09:33,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300270617] [2024-11-09 06:09:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:33,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:09:33,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:09:33,660 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:09:33,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 06:09:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:33,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 06:09:33,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:09:34,373 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-09 06:09:34,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2024-11-09 06:09:34,550 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 26 treesize of output 19 [2024-11-09 06:09:34,620 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 26 treesize of output 19 [2024-11-09 06:09:34,651 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 26 treesize of output 19 [2024-11-09 06:09:34,696 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 17 treesize of output 9 [2024-11-09 06:09:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:09:34,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:09:34,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300270617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:34,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:09:34,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2024-11-09 06:09:34,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316178327] [2024-11-09 06:09:34,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:34,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:09:34,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:34,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:09:34,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-11-09 06:09:34,768 INFO L87 Difference]: Start difference. First operand 248 states and 301 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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:09:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:36,501 INFO L93 Difference]: Finished difference Result 280 states and 346 transitions. [2024-11-09 06:09:36,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:09:36,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 34 [2024-11-09 06:09:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:36,506 INFO L225 Difference]: With dead ends: 280 [2024-11-09 06:09:36,506 INFO L226 Difference]: Without dead ends: 280 [2024-11-09 06:09:36,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2024-11-09 06:09:36,507 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 60 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:36,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 257 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 06:09:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-09 06:09:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 272. [2024-11-09 06:09:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 234 states have (on average 1.4188034188034189) internal successors, (332), 270 states have internal predecessors, (332), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 337 transitions. [2024-11-09 06:09:36,515 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 337 transitions. Word has length 34 [2024-11-09 06:09:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:36,516 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 337 transitions. [2024-11-09 06:09:36,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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:09:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 337 transitions. [2024-11-09 06:09:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:09:36,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:36,517 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, 1] [2024-11-09 06:09:36,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 06:09:36,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 06:09:36,722 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-09 06:09:36,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1595393403, now seen corresponding path program 1 times [2024-11-09 06:09:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:36,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425270248] [2024-11-09 06:09:36,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:36,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:39,003 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:09:39,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:39,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425270248] [2024-11-09 06:09:39,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425270248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:09:39,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729101593] [2024-11-09 06:09:39,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:39,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:09:39,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:09:39,005 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:09:39,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f886fb8-053a-475e-8c8e-f584b00ef601/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:09:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:39,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 06:09:39,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:09:39,214 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:09:39,540 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:09:39,541 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:09:39,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:09:39,726 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:09:39,756 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:09:40,090 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:09:40,090 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 50 treesize of output 45 [2024-11-09 06:09:40,100 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:09:40,378 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:09:40,378 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:09:40,459 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:09:40,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:09:40,724 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:09:40,724 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 06:09:40,736 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:09:41,799 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 06:09:41,799 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 06:09:41,887 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 06:09:41,888 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 06:09:42,045 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 16 treesize of output 11 [2024-11-09 06:09:42,076 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 34 treesize of output 25 [2024-11-09 06:09:42,115 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 16 treesize of output 11 [2024-11-09 06:09:42,137 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 34 treesize of output 25 [2024-11-09 06:09:42,177 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 16 treesize of output 11 [2024-11-09 06:09:42,185 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 34 treesize of output 25 [2024-11-09 06:09:42,383 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 25 treesize of output 13 [2024-11-09 06:09:42,391 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 06:09:42,406 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:09:42,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:09:46,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:46,506 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 192 treesize of output 185 [2024-11-09 06:09:46,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:46,526 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 176 treesize of output 137 [2024-11-09 06:09:46,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:46,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5252 treesize of output 4783 [2024-11-09 06:09:46,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:46,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3980 treesize of output 3914 [2024-11-09 06:09:46,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:46,831 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 545 treesize of output 542 [2024-11-09 06:09:46,852 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 533 treesize of output 531 [2024-11-09 06:09:46,872 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 531 treesize of output 525 [2024-11-09 06:09:46,893 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 525 treesize of output 519 [2024-11-09 06:09:46,914 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 519 treesize of output 507 [2024-11-09 06:09:46,934 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 507 treesize of output 495 [2024-11-09 06:09:47,591 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2024-11-09 06:09:47,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 502 treesize of output 612 [2024-11-09 06:09:47,653 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 461 treesize of output 449 [2024-11-09 06:09:47,678 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 449 treesize of output 447 [2024-11-09 06:09:47,722 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 447 treesize of output 441 [2024-11-09 06:09:47,750 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 492 treesize of output 478 [2024-11-09 06:10:08,843 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:10:08,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729101593] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:10:08,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [200719206] [2024-11-09 06:10:08,845 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2024-11-09 06:10:08,846 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:10:08,846 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:10:08,846 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:10:08,846 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:10:14,814 INFO L180 IcfgInterpreter]: Interpretation finished