./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/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_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/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_b3828e98-0550-48c1-b38a-8fdb6692a966/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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:47:35,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:47:35,974 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:47:35,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:47:35,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:47:36,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:47:36,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:47:36,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:47:36,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:47:36,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:47:36,034 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:47:36,035 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:47:36,036 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:47:36,041 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:47:36,041 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:47:36,042 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:47:36,042 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:47:36,042 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:47:36,043 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:47:36,043 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:47:36,043 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:47:36,044 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:47:36,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:47:36,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:47:36,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:47:36,049 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:47:36,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:47:36,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:47:36,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:47:36,050 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:47:36,051 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:47:36,051 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:47:36,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:47:36,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:47:36,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:47:36,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:47:36,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:47:36,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:47:36,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:47:36,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:47:36,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:47:36,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:47:36,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:47:36,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:47:36,058 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:47:36,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:47:36,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:47:36,059 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:47:36,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:47:36,060 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_b3828e98-0550-48c1-b38a-8fdb6692a966/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_b3828e98-0550-48c1-b38a-8fdb6692a966/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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2024-11-09 05:47:36,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:47:36,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:47:36,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:47:36,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:47:36,456 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:47:36,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i Unable to find full path for "g++" [2024-11-09 05:47:38,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:47:39,050 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:47:39,051 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-11-09 05:47:39,068 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/data/387a00e6f/ebbd681d347e484794032d1b9fe19f51/FLAG160ef8ef2 [2024-11-09 05:47:39,086 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/data/387a00e6f/ebbd681d347e484794032d1b9fe19f51 [2024-11-09 05:47:39,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:47:39,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:47:39,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:47:39,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:47:39,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:47:39,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:47:39" (1/1) ... [2024-11-09 05:47:39,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2498dec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39, skipping insertion in model container [2024-11-09 05:47:39,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:47:39" (1/1) ... [2024-11-09 05:47:39,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:47:39,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:47:39,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:47:39,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:47:39,761 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:47:39,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39 WrapperNode [2024-11-09 05:47:39,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:47:39,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:47:39,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:47:39,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:47:39,772 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:47:39" (1/1) ... [2024-11-09 05:47:39,789 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:47:39" (1/1) ... [2024-11-09 05:47:39,820 INFO L138 Inliner]: procedures = 128, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 151 [2024-11-09 05:47:39,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:47:39,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:47:39,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:47:39,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:47:39,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39" (1/1) ... [2024-11-09 05:47:39,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39" (1/1) ... [2024-11-09 05:47:39,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39" (1/1) ... [2024-11-09 05:47:39,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39" (1/1) ... [2024-11-09 05:47:39,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39" (1/1) ... [2024-11-09 05:47:39,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39" (1/1) ... [2024-11-09 05:47:39,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39" (1/1) ... [2024-11-09 05:47:39,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39" (1/1) ... [2024-11-09 05:47:39,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:47:39,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:47:39,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:47:39,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:47:39,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39" (1/1) ... [2024-11-09 05:47:39,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:47:39,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:47:39,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/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:47:39,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/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:47:40,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:47:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:47:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 05:47:40,006 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 05:47:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:47:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:47:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:47:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:47:40,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:47:40,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:47:40,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 05:47:40,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:47:40,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:47:40,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:47:40,204 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:47:40,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:47:40,816 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-09 05:47:40,819 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:47:40,899 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:47:40,900 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:47:40,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:47:40 BoogieIcfgContainer [2024-11-09 05:47:40,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:47:40,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:47:40,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:47:40,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:47:40,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:47:39" (1/3) ... [2024-11-09 05:47:40,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46982694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:47:40, skipping insertion in model container [2024-11-09 05:47:40,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:47:39" (2/3) ... [2024-11-09 05:47:40,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46982694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:47:40, skipping insertion in model container [2024-11-09 05:47:40,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:47:40" (3/3) ... [2024-11-09 05:47:40,913 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2024-11-09 05:47:40,936 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:47:40,937 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-11-09 05:47:40,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:47:41,002 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;@62a22a05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:47:41,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-11-09 05:47:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 87 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:47:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:47:41,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:47:41,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:47:41,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:47:41,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:47:41,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1369125779, now seen corresponding path program 1 times [2024-11-09 05:47:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:47:41,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721923678] [2024-11-09 05:47:41,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:47:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:47:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:47:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:47:41,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:47:41,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721923678] [2024-11-09 05:47:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721923678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:47:41,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:47:41,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:47:41,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434831849] [2024-11-09 05:47:41,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:47:41,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:47:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:47:41,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:47:41,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:47:41,424 INFO L87 Difference]: Start difference. First operand has 91 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 87 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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:47:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:47:41,529 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2024-11-09 05:47:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:47:41,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2024-11-09 05:47:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:47:41,542 INFO L225 Difference]: With dead ends: 97 [2024-11-09 05:47:41,542 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 05:47:41,544 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 05:47:41,548 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:47:41,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 176 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:47:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 05:47:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2024-11-09 05:47:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 86 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:47:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2024-11-09 05:47:41,596 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 7 [2024-11-09 05:47:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:47:41,596 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-11-09 05:47:41,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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:47:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2024-11-09 05:47:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:47:41,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:47:41,597 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:47:41,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:47:41,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:47:41,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:47:41,599 INFO L85 PathProgramCache]: Analyzing trace with hash 817724160, now seen corresponding path program 1 times [2024-11-09 05:47:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:47:41,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124844173] [2024-11-09 05:47:41,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:47:41,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:47:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:47:41,720 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:47:41,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:47:41,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124844173] [2024-11-09 05:47:41,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124844173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:47:41,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:47:41,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:47:41,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817335528] [2024-11-09 05:47:41,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:47:41,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:47:41,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:47:41,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:47:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:47:41,726 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:47:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:47:41,838 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2024-11-09 05:47:41,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:47:41,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-11-09 05:47:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:47:41,841 INFO L225 Difference]: With dead ends: 88 [2024-11-09 05:47:41,841 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 05:47:41,842 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 05:47:41,843 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:47:41,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:47:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 05:47:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 05:47:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 84 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:47:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2024-11-09 05:47:41,857 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 7 [2024-11-09 05:47:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:47:41,858 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2024-11-09 05:47:41,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:47:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2024-11-09 05:47:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:47:41,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:47:41,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:47:41,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:47:41,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:47:41,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:47:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash 817724161, now seen corresponding path program 1 times [2024-11-09 05:47:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:47:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453607802] [2024-11-09 05:47:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:47:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:47:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:47:42,099 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:47:42,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:47:42,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453607802] [2024-11-09 05:47:42,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453607802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:47:42,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:47:42,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:47:42,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463913664] [2024-11-09 05:47:42,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:47:42,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:47:42,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:47:42,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:47:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:47:42,103 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:47:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:47:42,204 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2024-11-09 05:47:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:47:42,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-11-09 05:47:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:47:42,206 INFO L225 Difference]: With dead ends: 86 [2024-11-09 05:47:42,207 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 05:47:42,207 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 05:47:42,209 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:47:42,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:47:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 05:47:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 05:47:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 2.0) internal successors, (96), 82 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:47:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2024-11-09 05:47:42,219 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 7 [2024-11-09 05:47:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:47:42,220 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2024-11-09 05:47:42,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:47:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2024-11-09 05:47:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:47:42,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:47:42,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:47:42,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:47:42,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:47:42,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:47:42,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1339799409, now seen corresponding path program 1 times [2024-11-09 05:47:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:47:42,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989722712] [2024-11-09 05:47:42,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:47:42,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:47:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:47:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:47:42,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:47:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989722712] [2024-11-09 05:47:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989722712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:47:42,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:47:42,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:47:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910689558] [2024-11-09 05:47:42,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:47:42,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:47:42,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:47:42,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:47:42,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:47:42,478 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:47:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:47:42,680 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2024-11-09 05:47:42,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:47:42,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 05:47:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:47:42,682 INFO L225 Difference]: With dead ends: 85 [2024-11-09 05:47:42,682 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 05:47:42,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:47:42,684 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:47:42,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:47:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 05:47:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 05:47:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 81 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:47:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-09 05:47:42,692 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 11 [2024-11-09 05:47:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:47:42,692 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-09 05:47:42,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:47:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-09 05:47:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:47:42,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:47:42,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:47:42,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:47:42,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:47:42,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:47:42,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1339799408, now seen corresponding path program 1 times [2024-11-09 05:47:42,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:47:42,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707939430] [2024-11-09 05:47:42,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:47:42,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:47:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:47:42,808 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:47:42,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:47:42,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707939430] [2024-11-09 05:47:42,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707939430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:47:42,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:47:42,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:47:42,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960674260] [2024-11-09 05:47:42,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:47:42,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:47:42,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:47:42,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:47:42,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:47:42,811 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:47:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:47:42,998 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2024-11-09 05:47:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:47:42,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 05:47:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:47:43,000 INFO L225 Difference]: With dead ends: 84 [2024-11-09 05:47:43,000 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 05:47:43,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:47:43,002 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:47:43,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 296 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:47:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 05:47:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 05:47:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 80 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:47:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-11-09 05:47:43,016 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 11 [2024-11-09 05:47:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:47:43,016 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-11-09 05:47:43,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:47:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-11-09 05:47:43,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:47:43,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:47:43,017 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:47:43,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:47:43,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:47:43,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:47:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 612729356, now seen corresponding path program 1 times [2024-11-09 05:47:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:47:43,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929954536] [2024-11-09 05:47:43,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:47:43,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:47:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:47:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 05:47:43,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:47:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929954536] [2024-11-09 05:47:43,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929954536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:47:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144001064] [2024-11-09 05:47:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:47:43,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:47:43,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:47:43,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:47:43,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:47:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:47:43,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:47:43,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:47:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:47:43,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:47:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 05:47:43,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144001064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:47:43,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1168576442] [2024-11-09 05:47:43,585 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:47:43,585 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:47:43,591 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:47:43,598 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:47:43,599 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:47:50,781 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 113 for LOIs [2024-11-09 05:47:51,151 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:48:12,757 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1112#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_17| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_17|) 1)) (or (and (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= |v_ULTIMATE.start_sll_insert_~head#1.base_17| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_81| (Array Int Int))) (= |#length| (store |v_#length_81| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_67| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_67| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_#valid_92| (Array Int Int)) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_10|) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) 1) |#StackHeapBarrier|) (= (select (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_#valid_92| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0) (= (store |v_#memory_int_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_47|) (= (store |v_#memory_$Pointer$.base_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_71|) (= (store |v_#memory_$Pointer$.offset_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_71|) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) (exists ((|v_#memory_int_53| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_53| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_53| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_54| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_54|) (= (store |v_#memory_int_54| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5)) |#memory_int|))) (exists ((|v_#valid_90| (Array Int Int))) (and (= (select |v_#valid_90| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_90| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|)))) (and (= |v_ULTIMATE.start_sll_insert_~head#1.base_17| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_52| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_52| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))) (= |v_#memory_int_52| (store |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_52| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4)))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_80| (Array Int Int))) (= (store |v_#length_80| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_#valid_91| (Array Int Int)) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (and (= (select |v_#valid_91| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0) (= (store |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_int)_AFTER_CALL_9|) (= (select (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) 1) |#StackHeapBarrier|) (= |v_#memory_int_47| (store |v_#memory_int_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_$Pointer$.offset_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_71|) (= (store |v_#memory_$Pointer$.base_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_71|) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) (exists ((|v_#valid_90| (Array Int Int))) (and (= (select |v_#valid_90| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_90| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)))))) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 05:48:12,758 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:48:12,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:48:12,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-09 05:48:12,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40155869] [2024-11-09 05:48:12,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:48:12,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:48:12,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:12,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:48:12,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=234, Unknown=1, NotChecked=0, Total=272 [2024-11-09 05:48:12,762 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:48:12,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:12,943 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2024-11-09 05:48:12,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:48:12,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-09 05:48:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:12,945 INFO L225 Difference]: With dead ends: 88 [2024-11-09 05:48:12,945 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 05:48:12,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=37, Invalid=234, Unknown=1, NotChecked=0, Total=272 [2024-11-09 05:48:12,947 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:12,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 158 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:48:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 05:48:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 05:48:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 83 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:48:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2024-11-09 05:48:12,967 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 21 [2024-11-09 05:48:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:12,967 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2024-11-09 05:48:12,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:48:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2024-11-09 05:48:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:48:12,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:12,969 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:13,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:48:13,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:13,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:48:13,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:13,175 INFO L85 PathProgramCache]: Analyzing trace with hash -825503789, now seen corresponding path program 2 times [2024-11-09 05:48:13,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:13,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069328582] [2024-11-09 05:48:13,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 05:48:14,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:14,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069328582] [2024-11-09 05:48:14,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069328582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:14,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616137109] [2024-11-09 05:48:14,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:48:14,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:14,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:14,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:48:14,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:48:14,616 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 05:48:14,616 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:48:14,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 05:48:14,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:14,670 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:48:14,835 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 5 treesize of output 3 [2024-11-09 05:48:14,887 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-09 05:48:14,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:14,992 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 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:48:15,113 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 5 treesize of output 3 [2024-11-09 05:48:15,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:15,226 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 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:48:15,306 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-09 05:48:15,400 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 05:48:15,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 05:48:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 8 not checked. [2024-11-09 05:48:15,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:48:16,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616137109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [881058042] [2024-11-09 05:48:16,189 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:48:16,189 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:48:16,190 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:48:16,190 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:48:16,190 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:48:22,187 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 111 for LOIs [2024-11-09 05:48:22,420 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:48:42,649 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1445#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_19| Int)) (and (or (and (exists ((|v_#memory_$Pointer$.offset_89| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_89| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_89| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int))) (|v_#valid_114| (Array Int Int)) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_93| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_93| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_21|) (= |v_#memory_int_78| (store |v_#memory_int_77| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_77| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_78| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_#valid_114| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0) (= (store |v_#memory_$Pointer$.offset_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_93|) (= (store |v_#memory_$Pointer$.base_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_93|) (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_78| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_78| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_21| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) 1) |#StackHeapBarrier|))) (exists ((|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_89| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_89| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= |v_ULTIMATE.start_sll_insert_~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_70| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (and (= |v_#memory_int_71| (store |v_#memory_int_70| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_70| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_93| (Array Int Int))) (= (store |v_#length_93| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8) |#length|)) (exists ((|v_#valid_112| (Array Int Int))) (and (= (select |v_#valid_112| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_112| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|)))) (and (exists ((|v_#memory_$Pointer$.offset_89| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_89| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_89| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_89| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_89| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#valid_113| (Array Int Int))) (and (= (store |v_#valid_113| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_113| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_94| (Array Int (Array Int Int))) (|v_#memory_int_75| (Array Int (Array Int Int))) (|v_#memory_int_76| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int))) (|v_#valid_112| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_94| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_93| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_32| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_93|) (= (select (select |v_#memory_$Pointer$.offset_93| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_#memory_int_76| (store |v_#memory_int_75| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_75| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_BEFORE_CALL_32| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_BEFORE_CALL_32|) (= |v_#memory_$Pointer$.offset_93| (store |v_#memory_$Pointer$.offset_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_20|) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= (select |v_#valid_112| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) (= |v_ULTIMATE.start_sll_insert_~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_70| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (and (= |v_#memory_int_71| (store |v_#memory_int_70| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_70| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_94| (Array Int Int))) (= |#length| (store |v_#length_94| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))))) (not (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_19|) 1)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 05:48:42,650 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:48:42,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:48:42,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2024-11-09 05:48:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281055870] [2024-11-09 05:48:42,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:48:42,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:48:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:42,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:48:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=565, Unknown=3, NotChecked=98, Total=756 [2024-11-09 05:48:42,654 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 13 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 05:48:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:44,632 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2024-11-09 05:48:44,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:48:44,632 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2024-11-09 05:48:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:44,633 INFO L225 Difference]: With dead ends: 99 [2024-11-09 05:48:44,634 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 05:48:44,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=115, Invalid=701, Unknown=4, NotChecked=110, Total=930 [2024-11-09 05:48:44,635 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 92 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:44,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 332 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 315 Invalid, 0 Unknown, 208 Unchecked, 1.4s Time] [2024-11-09 05:48:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 05:48:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2024-11-09 05:48:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.803921568627451) internal successors, (92), 79 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:48:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-11-09 05:48:44,643 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 31 [2024-11-09 05:48:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:44,644 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-11-09 05:48:44,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 05:48:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-11-09 05:48:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:48:44,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:44,646 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:44,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:48:44,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 05:48:44,847 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:48:44,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:44,847 INFO L85 PathProgramCache]: Analyzing trace with hash -825503788, now seen corresponding path program 1 times [2024-11-09 05:48:44,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:44,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383621913] [2024-11-09 05:48:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:44,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:48:46,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383621913] [2024-11-09 05:48:46,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383621913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:46,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458270321] [2024-11-09 05:48:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:46,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:46,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:48:46,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:48:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:47,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 05:48:47,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:47,149 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:48:47,338 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 5 treesize of output 3 [2024-11-09 05:48:47,373 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 05:48:47,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:47,453 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 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:48:47,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 5 treesize of output 3 [2024-11-09 05:48:47,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:47,728 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 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:48:48,057 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 5 treesize of output 3 [2024-11-09 05:48:48,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:48,172 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 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:48:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 05:48:48,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:48:48,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458270321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:48,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:48:48,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-09 05:48:48,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275161288] [2024-11-09 05:48:48,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:48,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:48:48,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:48,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:48:48,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2024-11-09 05:48:48,309 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:48:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:49,049 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2024-11-09 05:48:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:48:49,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-09 05:48:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:49,050 INFO L225 Difference]: With dead ends: 85 [2024-11-09 05:48:49,050 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 05:48:49,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2024-11-09 05:48:49,051 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 16 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:49,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 257 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 110 Unchecked, 0.6s Time] [2024-11-09 05:48:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 05:48:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-09 05:48:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 77 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:48:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-09 05:48:49,058 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 31 [2024-11-09 05:48:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:49,059 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-09 05:48:49,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:48:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-09 05:48:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:48:49,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:49,060 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:49,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 05:48:49,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 05:48:49,261 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:48:49,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash 404664735, now seen corresponding path program 1 times [2024-11-09 05:48:49,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:49,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414365795] [2024-11-09 05:48:49,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:49,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 05:48:50,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:50,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414365795] [2024-11-09 05:48:50,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414365795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:50,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069505925] [2024-11-09 05:48:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:50,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:50,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:50,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:48:50,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:48:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:51,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 05:48:51,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:51,809 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 9 treesize of output 5 [2024-11-09 05:48:52,095 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_37| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_37| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_37| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37|))) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_37| 1)))) is different from true [2024-11-09 05:48:52,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:52,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:48:52,191 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-09 05:48:52,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 05:48:52,423 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 05:48:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 05:48:52,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:48:52,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069505925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:52,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:48:52,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2024-11-09 05:48:52,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101588488] [2024-11-09 05:48:52,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:52,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:48:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:52,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:48:52,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2024-11-09 05:48:52,565 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 11 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:48:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:53,923 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2024-11-09 05:48:53,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:48:53,924 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-09 05:48:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:53,925 INFO L225 Difference]: With dead ends: 93 [2024-11-09 05:48:53,925 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 05:48:53,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=69, Invalid=396, Unknown=1, NotChecked=40, Total=506 [2024-11-09 05:48:53,927 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:53,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 364 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 131 Unchecked, 1.2s Time] [2024-11-09 05:48:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 05:48:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2024-11-09 05:48:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 80 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:48:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2024-11-09 05:48:53,941 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 34 [2024-11-09 05:48:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:53,942 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2024-11-09 05:48:53,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:48:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2024-11-09 05:48:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:48:53,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:53,944 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:53,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 05:48:54,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:54,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:48:54,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:54,149 INFO L85 PathProgramCache]: Analyzing trace with hash 404664736, now seen corresponding path program 1 times [2024-11-09 05:48:54,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:54,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735064375] [2024-11-09 05:48:54,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:54,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:48:56,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:56,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735064375] [2024-11-09 05:48:56,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735064375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:56,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929228178] [2024-11-09 05:48:56,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:56,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:56,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:56,685 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:48:56,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:48:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:56,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 05:48:56,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:57,254 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:48:58,131 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 19 treesize of output 11 [2024-11-09 05:48:58,148 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 7 treesize of output 3 [2024-11-09 05:48:58,886 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_39| Int)) (and (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_39| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_39|)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_39|) 0) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_39| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_39|)) |c_#memory_$Pointer$.base|) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_39| (select |c_#length| |v_node_create_~temp~0#1.base_39|)) |c_#length|) (<= (+ |v_node_create_~temp~0#1.base_39| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-09 05:48:58,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:58,928 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 27 treesize of output 20 [2024-11-09 05:48:59,003 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 05:48:59,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 05:48:59,021 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 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:48:59,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:59,046 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 05:48:59,337 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 05:48:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2024-11-09 05:48:59,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:49:00,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929228178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:49:00,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1881854784] [2024-11-09 05:49:00,491 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 05:49:00,491 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:49:00,492 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:49:00,492 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:49:00,492 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:49:06,517 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 113 for LOIs [2024-11-09 05:49:06,790 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:49:41,555 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2373#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~head#1.base|) 0) |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|) (<= 4 (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~head#1.base|) 0) 4) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~head#1.base|) 0) 8))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) 0) |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (or (and (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_109| (Array Int (Array Int Int))) (|v_#valid_124| (Array Int Int)) (|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_111| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (Array Int (Array Int Int))) (|v_#memory_int_93| (Array Int (Array Int Int))) (|v_#memory_int_94| (Array Int (Array Int Int)))) (and (= (select |v_#valid_124| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (store |v_#memory_$Pointer$.base_113| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_#memory_int_94| (store |v_#memory_int_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_int)_AFTER_CALL_38| (store |v_#memory_int_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_38| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_$Pointer$.base_109| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_109| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_113| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_113|) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.offset_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_111| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_111|) (= (select (select |v_#memory_$Pointer$.offset_111| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#length_110| (Array Int Int))) (= |#length| (store |v_#length_110| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int)))) (and (= |v_#memory_int_87| (store |v_#memory_int_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_115| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_115| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_126| (Array Int Int))) (and (= (select |v_#valid_126| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_126| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|)))) (and (exists ((|v_#valid_125| (Array Int Int))) (and (= (store |v_#valid_125| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_125| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_#valid_124| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_114| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_111| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int))) (|v_#memory_int_92| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_113| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_37|) (= |v_#memory_$Pointer$.base_113| (store |v_#memory_$Pointer$.base_114| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_114| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_113| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) 1) |#StackHeapBarrier|) (= (select |v_#valid_124| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0) (= (store |v_#memory_$Pointer$.offset_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_111| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_111|) (= |v_#memory_int_92| (store |v_#memory_int_91| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_91| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_92| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= (store |v_#memory_int_92| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_92| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_BEFORE_CALL_51| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_BEFORE_CALL_51|) (= (select (select |v_#memory_$Pointer$.offset_111| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#length_110| (Array Int Int))) (= |#length| (store |v_#length_110| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_112| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_112| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_112| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int)))) (and (= |v_#memory_int_87| (store |v_#memory_int_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_109| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))))) (<= 2 |ULTIMATE.start_sll_insert_~head#1.base|))' at error location [2024-11-09 05:49:41,555 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:49:41,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:49:41,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2024-11-09 05:49:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674459192] [2024-11-09 05:49:41,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:49:41,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 05:49:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:41,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 05:49:41,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1669, Unknown=1, NotChecked=82, Total=1892 [2024-11-09 05:49:41,559 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand has 26 states, 20 states have (on average 2.2) internal successors, (44), 22 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:49:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:47,784 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2024-11-09 05:49:47,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 05:49:47,785 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 2.2) internal successors, (44), 22 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-11-09 05:49:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:47,786 INFO L225 Difference]: With dead ends: 93 [2024-11-09 05:49:47,786 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 05:49:47,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=216, Invalid=2439, Unknown=1, NotChecked=100, Total=2756 [2024-11-09 05:49:47,788 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 212 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:47,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 917 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 792 Invalid, 0 Unknown, 108 Unchecked, 4.0s Time] [2024-11-09 05:49:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 05:49:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2024-11-09 05:49:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 80 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:49:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2024-11-09 05:49:47,794 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 34 [2024-11-09 05:49:47,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:47,795 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2024-11-09 05:49:47,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 2.2) internal successors, (44), 22 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:49:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2024-11-09 05:49:47,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:49:47,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:47,797 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:49:47,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 05:49:48,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 05:49:48,002 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:49:48,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash 404675626, now seen corresponding path program 1 times [2024-11-09 05:49:48,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:48,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12832288] [2024-11-09 05:49:48,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:48,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 05:49:48,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:48,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12832288] [2024-11-09 05:49:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12832288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:49:48,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:49:48,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:49:48,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228511846] [2024-11-09 05:49:48,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:49:48,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:49:48,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:48,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:49:48,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:49:48,136 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:49:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:48,354 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2024-11-09 05:49:48,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:49:48,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-09 05:49:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:48,356 INFO L225 Difference]: With dead ends: 86 [2024-11-09 05:49:48,356 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 05:49:48,356 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:49:48,357 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:48,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 144 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:49:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 05:49:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 05:49:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 81 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:49:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2024-11-09 05:49:48,366 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 34 [2024-11-09 05:49:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:48,367 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2024-11-09 05:49:48,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:49:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2024-11-09 05:49:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 05:49:48,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:48,372 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:49:48,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:49:48,372 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:49:48,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash -339952494, now seen corresponding path program 1 times [2024-11-09 05:49:48,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:48,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795954435] [2024-11-09 05:49:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:48,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 05:49:48,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:48,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795954435] [2024-11-09 05:49:48,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795954435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:49:48,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:49:48,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:49:48,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776489311] [2024-11-09 05:49:48,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:49:48,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:49:48,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:49:48,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:49:48,704 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:49:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:49,453 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2024-11-09 05:49:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:49:49,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-09 05:49:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:49,455 INFO L225 Difference]: With dead ends: 85 [2024-11-09 05:49:49,455 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 05:49:49,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:49:49,456 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 11 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:49,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 259 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 05:49:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 05:49:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 05:49:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 80 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:49:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2024-11-09 05:49:49,461 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 35 [2024-11-09 05:49:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:49,462 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2024-11-09 05:49:49,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:49:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2024-11-09 05:49:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 05:49:49,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:49,463 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:49:49,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:49:49,463 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:49:49,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:49,464 INFO L85 PathProgramCache]: Analyzing trace with hash -339952493, now seen corresponding path program 1 times [2024-11-09 05:49:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:49,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866942873] [2024-11-09 05:49:49,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:49,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 05:49:49,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:49,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866942873] [2024-11-09 05:49:49,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866942873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:49:49,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:49:49,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:49:49,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489923162] [2024-11-09 05:49:49,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:49:49,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:49:49,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:49:49,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:49:49,668 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:49:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:49,951 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2024-11-09 05:49:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:49:49,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-09 05:49:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:49,953 INFO L225 Difference]: With dead ends: 88 [2024-11-09 05:49:49,953 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 05:49:49,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:49:49,954 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 59 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:49,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:49:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 05:49:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-11-09 05:49:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 79 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:49:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2024-11-09 05:49:49,959 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 35 [2024-11-09 05:49:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:49,960 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2024-11-09 05:49:49,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:49:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2024-11-09 05:49:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 05:49:49,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:49,961 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:49:49,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:49:49,962 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:49:49,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:49,962 INFO L85 PathProgramCache]: Analyzing trace with hash -601369369, now seen corresponding path program 1 times [2024-11-09 05:49:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:49,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722117230] [2024-11-09 05:49:49,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:49,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 05:49:50,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:50,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722117230] [2024-11-09 05:49:50,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722117230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:49:50,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:49:50,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:49:50,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73730106] [2024-11-09 05:49:50,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:49:50,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:49:50,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:50,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:49:50,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:49:50,273 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:49:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:50,772 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2024-11-09 05:49:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:49:50,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-09 05:49:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:50,777 INFO L225 Difference]: With dead ends: 84 [2024-11-09 05:49:50,777 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 05:49:50,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:49:50,778 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 52 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:50,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 221 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:49:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 05:49:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-11-09 05:49:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 75 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:49:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2024-11-09 05:49:50,789 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 37 [2024-11-09 05:49:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:50,790 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2024-11-09 05:49:50,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:49:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2024-11-09 05:49:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 05:49:50,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:50,791 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:49:50,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 05:49:50,791 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:49:50,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash -601358478, now seen corresponding path program 1 times [2024-11-09 05:49:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:50,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693668102] [2024-11-09 05:49:50,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:50,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 05:49:50,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:50,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693668102] [2024-11-09 05:49:50,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693668102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:49:50,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:49:50,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:49:50,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355144411] [2024-11-09 05:49:50,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:49:50,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:49:50,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:50,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:49:50,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:49:50,996 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:49:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:51,630 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2024-11-09 05:49:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:49:51,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-09 05:49:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:51,632 INFO L225 Difference]: With dead ends: 79 [2024-11-09 05:49:51,632 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 05:49:51,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:49:51,633 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:51,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:49:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 05:49:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 05:49:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 74 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:49:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2024-11-09 05:49:51,640 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 37 [2024-11-09 05:49:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:51,640 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2024-11-09 05:49:51,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:49:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2024-11-09 05:49:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 05:49:51,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:51,641 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:49:51,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 05:49:51,641 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:49:51,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:51,642 INFO L85 PathProgramCache]: Analyzing trace with hash -601358477, now seen corresponding path program 1 times [2024-11-09 05:49:51,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:51,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55728601] [2024-11-09 05:49:51,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:51,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:49:53,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55728601] [2024-11-09 05:49:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55728601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:49:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144498555] [2024-11-09 05:49:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:53,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:49:53,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:49:53,969 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:49:53,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:49:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:54,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:49:54,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:49:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 05:49:54,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:49:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144498555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:49:54,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:49:54,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [16] total 18 [2024-11-09 05:49:54,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947825509] [2024-11-09 05:49:54,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:49:54,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:49:54,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:54,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:49:54,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:49:54,570 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:49:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:54,937 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2024-11-09 05:49:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:49:54,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-09 05:49:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:54,939 INFO L225 Difference]: With dead ends: 78 [2024-11-09 05:49:54,939 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 05:49:54,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:49:54,940 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:54,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:49:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 05:49:54,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 05:49:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 73 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:49:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2024-11-09 05:49:54,944 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 37 [2024-11-09 05:49:54,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:54,945 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2024-11-09 05:49:54,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:49:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2024-11-09 05:49:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 05:49:54,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:54,946 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:49:54,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 05:49:55,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 05:49:55,147 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:49:55,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1462243605, now seen corresponding path program 1 times [2024-11-09 05:49:55,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:55,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917597037] [2024-11-09 05:49:55,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:55,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 05:49:55,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917597037] [2024-11-09 05:49:55,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917597037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:49:55,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:49:55,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:49:55,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802307166] [2024-11-09 05:49:55,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:49:55,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:49:55,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:55,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:49:55,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:49:55,712 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:49:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:56,481 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2024-11-09 05:49:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:49:56,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-09 05:49:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:56,483 INFO L225 Difference]: With dead ends: 77 [2024-11-09 05:49:56,483 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 05:49:56,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:49:56,484 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:56,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 255 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 05:49:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 05:49:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 05:49:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 72 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:49:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2024-11-09 05:49:56,488 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 38 [2024-11-09 05:49:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:56,488 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2024-11-09 05:49:56,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:49:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2024-11-09 05:49:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 05:49:56,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:56,490 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:49:56,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 05:49:56,490 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:49:56,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:56,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1915092751, now seen corresponding path program 1 times [2024-11-09 05:49:56,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:56,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846652906] [2024-11-09 05:49:56,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:56,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 05:49:56,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:56,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846652906] [2024-11-09 05:49:56,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846652906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:49:56,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:49:56,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:49:56,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844995816] [2024-11-09 05:49:56,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:49:56,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:49:56,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:56,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:49:56,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:49:56,953 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:49:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:57,437 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-11-09 05:49:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:49:57,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-11-09 05:49:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:57,438 INFO L225 Difference]: With dead ends: 76 [2024-11-09 05:49:57,438 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 05:49:57,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:49:57,439 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 51 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:57,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 183 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:49:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 05:49:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2024-11-09 05:49:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 70 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:49:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2024-11-09 05:49:57,444 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 39 [2024-11-09 05:49:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:57,444 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2024-11-09 05:49:57,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:49:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2024-11-09 05:49:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 05:49:57,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:57,445 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:49:57,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 05:49:57,452 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:49:57,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2136704648, now seen corresponding path program 1 times [2024-11-09 05:49:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:57,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675898160] [2024-11-09 05:49:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:57,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:50:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:50:01,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:50:01,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675898160] [2024-11-09 05:50:01,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675898160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:50:01,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895123036] [2024-11-09 05:50:01,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:50:01,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:50:01,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:50:01,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:50:01,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 05:50:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:50:02,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 05:50:02,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:50:03,638 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 8 treesize of output 4 [2024-11-09 05:50:04,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:50:04,722 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 17 treesize of output 12 [2024-11-09 05:50:06,129 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-09 05:50:06,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2024-11-09 05:50:06,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:50:06,791 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:50:06,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2024-11-09 05:50:06,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:50:07,121 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 16 treesize of output 8 [2024-11-09 05:50:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:50:07,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:50:07,496 WARN L851 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_main_~mid_index~0#1|) (forall ((v_ArrVal_1271 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1271) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-09 05:50:09,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895123036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:50:09,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1757432781] [2024-11-09 05:50:09,598 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 05:50:09,598 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:50:09,598 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:50:09,598 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:50:09,598 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:50:16,078 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 115 for LOIs [2024-11-09 05:50:16,266 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:50:54,115 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4253#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_#memory_int_114| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_25| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| Int) (|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22| Int)) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_25| 4) 0)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_130| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_25| 4) 0)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4)))) (<= 0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_25| 4)) (= |v_#memory_int_114| (store |v_#memory_int_113| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| (store (select |v_#memory_int_113| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_25| 4) (select (select |v_#memory_int_114| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_25| 4))))) (<= (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_25| 8) (select |#length| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|)) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| (store (select |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_25| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22| (store (select (store |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| (store (select |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_25| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4)))) (= |#memory_int| (store |v_#memory_int_114| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22| (store (select |v_#memory_int_114| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4)))) (= (select |#valid| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 1) (<= 8 (select |#length| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|)) (= (select |#valid| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) 1))) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select |#valid| 0) 1)) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 05:50:54,115 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:50:54,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:50:54,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 39 [2024-11-09 05:50:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574470096] [2024-11-09 05:50:54,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:50:54,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 05:50:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:50:54,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 05:50:54,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3946, Unknown=18, NotChecked=126, Total=4290 [2024-11-09 05:50:54,127 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 39 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 05:51:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:51:05,779 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-11-09 05:51:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 05:51:05,780 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2024-11-09 05:51:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:51:05,781 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:51:05,781 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 05:51:05,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1749 ImplicationChecksByTransitivity, 52.6s TimeCoverageRelationStatistics Valid=402, Invalid=6556, Unknown=18, NotChecked=164, Total=7140 [2024-11-09 05:51:05,784 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 145 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:51:05,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1160 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-09 05:51:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 05:51:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2024-11-09 05:51:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.528301886792453) internal successors, (81), 71 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:51:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-11-09 05:51:05,788 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 41 [2024-11-09 05:51:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:51:05,788 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-11-09 05:51:05,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 05:51:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2024-11-09 05:51:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 05:51:05,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:51:05,789 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:51:05,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 05:51:05,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:51:05,990 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:51:05,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:51:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1813353357, now seen corresponding path program 1 times [2024-11-09 05:51:05,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:51:05,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461354551] [2024-11-09 05:51:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:51:05,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:51:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:51:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:51:08,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:51:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461354551] [2024-11-09 05:51:08,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461354551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:51:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982329006] [2024-11-09 05:51:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:51:08,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:51:08,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:51:08,760 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:51:08,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 05:51:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:51:08,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 05:51:08,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:51:09,094 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:51:10,372 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 9 treesize of output 5 [2024-11-09 05:51:11,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:51:11,477 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 18 treesize of output 13 [2024-11-09 05:51:11,583 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2024-11-09 05:51:11,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2024-11-09 05:51:12,547 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-09 05:51:12,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2024-11-09 05:51:13,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:51:13,230 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:51:13,231 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 52 [2024-11-09 05:51:13,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:51:13,807 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 45 [2024-11-09 05:51:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 05:51:14,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:51:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982329006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:51:14,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:51:14,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [20] total 35 [2024-11-09 05:51:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742048541] [2024-11-09 05:51:14,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:51:14,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 05:51:14,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:51:14,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 05:51:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 05:51:14,293 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:51:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:51:18,135 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2024-11-09 05:51:18,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 05:51:18,136 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-09 05:51:18,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:51:18,137 INFO L225 Difference]: With dead ends: 78 [2024-11-09 05:51:18,137 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 05:51:18,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=160, Invalid=1646, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 05:51:18,138 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 156 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:51:18,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 447 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 05:51:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 05:51:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-09 05:51:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 69 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:51:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-11-09 05:51:18,143 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 42 [2024-11-09 05:51:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:51:18,143 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-09 05:51:18,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:51:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2024-11-09 05:51:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 05:51:18,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:51:18,144 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:51:18,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 05:51:18,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:51:18,345 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:51:18,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:51:18,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1813353356, now seen corresponding path program 1 times [2024-11-09 05:51:18,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:51:18,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846080856] [2024-11-09 05:51:18,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:51:18,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:51:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:51:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:51:23,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:51:23,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846080856] [2024-11-09 05:51:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846080856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:51:23,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434573708] [2024-11-09 05:51:23,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:51:23,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:51:23,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:51:23,077 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:51:23,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 05:51:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:51:23,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-09 05:51:23,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:51:23,414 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:51:24,933 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 19 treesize of output 11 [2024-11-09 05:51:24,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:51:26,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:51:26,097 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 05:51:26,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:51:26,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-09 05:51:26,218 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 05:51:26,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-09 05:51:26,296 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 05:51:26,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 05:51:27,645 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-09 05:51:27,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2024-11-09 05:51:27,777 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 05:51:27,777 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 21 treesize of output 20 [2024-11-09 05:51:28,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:51:28,406 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:51:28,406 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 61 [2024-11-09 05:51:28,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:51:28,525 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:51:28,526 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 70 [2024-11-09 05:51:28,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:51:28,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:51:29,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:51:29,883 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 154 treesize of output 134 [2024-11-09 05:51:29,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:51:29,985 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 98 treesize of output 102 [2024-11-09 05:51:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 05:51:33,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:51:33,789 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1566 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2024-11-09 05:51:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434573708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:51:42,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1983366909] [2024-11-09 05:51:42,838 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 05:51:42,838 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:51:42,839 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:51:42,839 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:51:42,839 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:51:45,255 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 83 for LOIs [2024-11-09 05:51:45,429 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:52:07,361 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5003#(and (or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 8))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| Int) (|v_#memory_$Pointer$.offset_153| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_165| (Array Int (Array Int Int))) (|v_#memory_int_130| (Array Int (Array Int Int))) (|v_#memory_int_131| (Array Int (Array Int Int)))) (and (= (select |#valid| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|) 1) (or (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 0)) (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| 0))) (= (select |#valid| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 1) (<= 0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4)) (= (store (store |v_#memory_$Pointer$.base_165| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| (store (select |v_#memory_$Pointer$.base_165| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26| (store (select (store |v_#memory_$Pointer$.base_165| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| (store (select |v_#memory_$Pointer$.base_165| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_131| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26| (store (select |v_#memory_int_131| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4)))) (<= 8 (select |#length| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|)) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_153| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| (store (select |v_#memory_$Pointer$.offset_153| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4) 0)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26| (store (select (store |v_#memory_$Pointer$.offset_153| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| (store (select |v_#memory_$Pointer$.offset_153| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4) 0)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4)))) (<= (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 8) (select |#length| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|)) (= (store |v_#memory_int_130| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| (store (select |v_#memory_int_130| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4) (select (select |v_#memory_int_131| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4)))) |v_#memory_int_131|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 05:52:07,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:52:07,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:52:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 35 [2024-11-09 05:52:07,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983230757] [2024-11-09 05:52:07,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:52:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 05:52:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:52:07,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 05:52:07,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3800, Unknown=19, NotChecked=124, Total=4160 [2024-11-09 05:52:07,364 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 36 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 31 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 05:52:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:52:16,355 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2024-11-09 05:52:16,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 05:52:16,355 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 31 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-11-09 05:52:16,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:52:16,356 INFO L225 Difference]: With dead ends: 75 [2024-11-09 05:52:16,356 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 05:52:16,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=346, Invalid=5189, Unknown=19, NotChecked=146, Total=5700 [2024-11-09 05:52:16,359 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 151 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:52:16,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 721 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-09 05:52:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 05:52:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 05:52:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 70 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:52:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2024-11-09 05:52:16,363 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 42 [2024-11-09 05:52:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:52:16,364 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2024-11-09 05:52:16,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 31 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 05:52:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2024-11-09 05:52:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 05:52:16,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:52:16,365 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:52:16,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 05:52:16,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:52:16,566 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:52:16,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:52:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1910371111, now seen corresponding path program 1 times [2024-11-09 05:52:16,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:52:16,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705466364] [2024-11-09 05:52:16,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:52:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:52:23,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:52:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705466364] [2024-11-09 05:52:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705466364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:52:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115798394] [2024-11-09 05:52:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:52:23,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:52:23,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:52:23,045 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:52:23,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3828e98-0550-48c1-b38a-8fdb6692a966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 05:52:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:52:23,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-09 05:52:23,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:52:23,310 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:52:23,341 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:52:23,695 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 5 treesize of output 3 [2024-11-09 05:52:23,707 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 5 treesize of output 3 [2024-11-09 05:52:24,560 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:52:24,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 05:52:24,691 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 05:52:24,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 05:52:25,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-09 05:52:25,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:52:26,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:52:27,046 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 05:52:27,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 24 [2024-11-09 05:52:27,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:52:27,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-09 05:52:28,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:52:29,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:52:29,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-09 05:52:29,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:52:29,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2024-11-09 05:52:29,258 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 7 treesize of output 3 [2024-11-09 05:52:29,272 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 5 treesize of output 3 [2024-11-09 05:52:30,623 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:52:31,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:52:31,119 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 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:52:31,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:52:31,216 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 05:52:31,216 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 68 treesize of output 51 [2024-11-09 05:52:31,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:52:31,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:52:31,429 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-09 05:52:31,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 60 [2024-11-09 05:52:31,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:52:31,531 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 16 treesize of output 11 [2024-11-09 05:52:33,950 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-11-09 05:52:33,950 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 3 case distinctions, treesize of input 93 treesize of output 70 [2024-11-09 05:52:34,050 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:52:34,050 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 16 treesize of output 15 [2024-11-09 05:52:34,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:52:34,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-11-09 05:52:34,243 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-11-09 05:52:34,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 05:52:36,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:52:37,230 INFO L349 Elim1Store]: treesize reduction 128, result has 35.0 percent of original size [2024-11-09 05:52:37,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 395 treesize of output 367 [2024-11-09 05:52:37,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:52:37,784 INFO L349 Elim1Store]: treesize reduction 104, result has 38.1 percent of original size [2024-11-09 05:52:37,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 332 treesize of output 376 [2024-11-09 05:52:37,825 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 318 treesize of output 302 [2024-11-09 05:53:16,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:17,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:17,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:17,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:18,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:18,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 7 treesize of output 3 [2024-11-09 05:53:19,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:20,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:20,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:20,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:21,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:21,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:22,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:22,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:22,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:23,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:24,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:53:24,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:54:42,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:54:43,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:54:43,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:54:44,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:54:44,524 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:54:45,466 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:54:45,473 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:54:50,671 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:55:27,554 WARN L286 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 250 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:57:51,575 WARN L286 SmtUtils]: Spent 2.35m on a formula simplification. DAG size of input: 3206 DAG size of output: 3202 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 05:57:51,576 INFO L349 Elim1Store]: treesize reduction 12, result has 99.8 percent of original size [2024-11-09 05:57:51,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 40 select indices, 40 select index equivalence classes, 0 disjoint index pairs (out of 780 index pairs), introduced 40 new quantified variables, introduced 780 case distinctions, treesize of input 6666 treesize of output 12900