./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/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_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/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_fbef5645-0058-4275-b700-71a480a3aa2b/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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:07:16,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:07:16,688 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 01:07:16,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:07:16,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:07:16,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:07:16,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:07:16,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:07:16,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:07:16,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:07:16,723 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:07:16,723 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:07:16,723 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:07:16,724 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:07:16,724 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:07:16,725 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:07:16,725 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:07:16,725 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:07:16,726 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:07:16,726 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:07:16,727 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:07:16,727 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:07:16,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:07:16,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:07:16,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:07:16,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:07:16,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:07:16,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:07:16,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:07:16,730 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 01:07:16,731 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 01:07:16,731 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 01:07:16,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:07:16,732 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:07:16,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:07:16,732 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 01:07:16,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:07:16,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:07:16,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:07:16,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:07:16,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:07:16,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:07:16,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:07:16,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:07:16,735 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:07:16,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:07:16,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:07:16,736 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:07:16,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:07:16,737 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_fbef5645-0058-4275-b700-71a480a3aa2b/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_fbef5645-0058-4275-b700-71a480a3aa2b/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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-11-09 01:07:16,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:07:17,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:07:17,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:07:17,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:07:17,009 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:07:17,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i Unable to find full path for "g++" [2024-11-09 01:07:18,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:07:19,207 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:07:19,207 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-09 01:07:19,224 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/data/0598534d2/a3fb602370b24ab5b78c5098544e446a/FLAG1fb6988d9 [2024-11-09 01:07:19,242 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/data/0598534d2/a3fb602370b24ab5b78c5098544e446a [2024-11-09 01:07:19,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:07:19,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:07:19,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:07:19,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:07:19,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:07:19,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@822524e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19, skipping insertion in model container [2024-11-09 01:07:19,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:07:19,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:07:19,684 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:07:19,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:07:19,790 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:07:19,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19 WrapperNode [2024-11-09 01:07:19,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:07:19,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:07:19,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:07:19,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:07:19,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,860 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 164 [2024-11-09 01:07:19,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:07:19,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:07:19,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:07:19,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:07:19,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:07:19,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:07:19,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:07:19,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:07:19,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (1/1) ... [2024-11-09 01:07:19,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:07:19,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:07:19,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:07:19,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:07:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:07:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:07:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 01:07:19,987 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 01:07:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:07:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:07:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 01:07:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:07:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:07:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:07:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 01:07:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:07:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:07:19,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:07:20,112 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:07:20,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:07:20,571 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2024-11-09 01:07:20,571 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:07:20,640 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:07:20,640 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 01:07:20,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:07:20 BoogieIcfgContainer [2024-11-09 01:07:20,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:07:20,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:07:20,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:07:20,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:07:20,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:07:19" (1/3) ... [2024-11-09 01:07:20,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122c32b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:07:20, skipping insertion in model container [2024-11-09 01:07:20,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:07:19" (2/3) ... [2024-11-09 01:07:20,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122c32b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:07:20, skipping insertion in model container [2024-11-09 01:07:20,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:07:20" (3/3) ... [2024-11-09 01:07:20,652 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-11-09 01:07:20,670 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:07:20,670 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-11-09 01:07:20,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:07:20,738 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;@7a692d96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:07:20,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-11-09 01:07:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 57 states have (on average 2.3157894736842106) internal successors, (132), 115 states have internal predecessors, (132), 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 01:07:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 01:07:20,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:20,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 01:07:20,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:20,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash 253366685, now seen corresponding path program 1 times [2024-11-09 01:07:20,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:20,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666802999] [2024-11-09 01:07:20,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:20,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:21,067 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 01:07:21,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:21,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666802999] [2024-11-09 01:07:21,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666802999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:07:21,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:07:21,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:07:21,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491388366] [2024-11-09 01:07:21,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:07:21,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:07:21,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:21,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:07:21,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:07:21,105 INFO L87 Difference]: Start difference. First operand has 120 states, 57 states have (on average 2.3157894736842106) internal successors, (132), 115 states have internal predecessors, (132), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 01:07:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:21,263 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2024-11-09 01:07:21,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:07:21,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-09 01:07:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:21,274 INFO L225 Difference]: With dead ends: 117 [2024-11-09 01:07:21,274 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 01:07:21,276 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 01:07:21,279 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:21,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 179 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:07:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 01:07:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 01:07:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 55 states have (on average 2.2) internal successors, (121), 110 states have internal predecessors, (121), 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 01:07:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2024-11-09 01:07:21,321 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 5 [2024-11-09 01:07:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:21,322 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2024-11-09 01:07:21,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 01:07:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2024-11-09 01:07:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 01:07:21,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:21,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 01:07:21,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:07:21,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:21,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:21,325 INFO L85 PathProgramCache]: Analyzing trace with hash 253366686, now seen corresponding path program 1 times [2024-11-09 01:07:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:21,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710793333] [2024-11-09 01:07:21,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:21,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:21,484 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 01:07:21,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:21,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710793333] [2024-11-09 01:07:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710793333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:07:21,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:07:21,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:07:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964038306] [2024-11-09 01:07:21,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:07:21,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:07:21,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:21,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:07:21,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:07:21,490 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 01:07:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:21,622 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2024-11-09 01:07:21,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:07:21,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-09 01:07:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:21,626 INFO L225 Difference]: With dead ends: 113 [2024-11-09 01:07:21,626 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 01:07:21,626 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 01:07:21,628 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:21,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:07:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 01:07:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 01:07:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 55 states have (on average 2.1636363636363636) internal successors, (119), 108 states have internal predecessors, (119), 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 01:07:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2024-11-09 01:07:21,637 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 5 [2024-11-09 01:07:21,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:21,638 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2024-11-09 01:07:21,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 01:07:21,638 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2024-11-09 01:07:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 01:07:21,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:21,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:07:21,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:07:21,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:21,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1803672416, now seen corresponding path program 1 times [2024-11-09 01:07:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:21,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233056705] [2024-11-09 01:07:21,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:21,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:21,706 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 01:07:21,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:21,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233056705] [2024-11-09 01:07:21,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233056705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:07:21,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:07:21,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:07:21,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945483674] [2024-11-09 01:07:21,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:07:21,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:07:21,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:21,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:07:21,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:07:21,709 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 01:07:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:21,756 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2024-11-09 01:07:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:07:21,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-11-09 01:07:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:21,758 INFO L225 Difference]: With dead ends: 114 [2024-11-09 01:07:21,758 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 01:07:21,758 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 01:07:21,759 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 5 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:21,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 209 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:07:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 01:07:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 01:07:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 56 states have (on average 2.125) internal successors, (119), 109 states have internal predecessors, (119), 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 01:07:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2024-11-09 01:07:21,769 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 10 [2024-11-09 01:07:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:21,770 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2024-11-09 01:07:21,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 01:07:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2024-11-09 01:07:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 01:07:21,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:21,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:07:21,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:07:21,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:21,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -813092864, now seen corresponding path program 1 times [2024-11-09 01:07:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888040327] [2024-11-09 01:07:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:07:21,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888040327] [2024-11-09 01:07:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888040327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:07:21,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:07:21,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:07:21,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114532614] [2024-11-09 01:07:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:07:21,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:07:21,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:21,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:07:21,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:07:21,949 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 01:07:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:22,213 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2024-11-09 01:07:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:07:22,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 18 [2024-11-09 01:07:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:22,216 INFO L225 Difference]: With dead ends: 113 [2024-11-09 01:07:22,218 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 01:07:22,218 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 01:07:22,220 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:22,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 353 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:07:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 01:07:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 01:07:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 56 states have (on average 2.107142857142857) internal successors, (118), 108 states have internal predecessors, (118), 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 01:07:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2024-11-09 01:07:22,229 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 18 [2024-11-09 01:07:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:22,230 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2024-11-09 01:07:22,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 01:07:22,231 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2024-11-09 01:07:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 01:07:22,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:22,232 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:07:22,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:07:22,232 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:22,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:22,233 INFO L85 PathProgramCache]: Analyzing trace with hash -813092863, now seen corresponding path program 1 times [2024-11-09 01:07:22,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:22,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365334469] [2024-11-09 01:07:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:07:22,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:22,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365334469] [2024-11-09 01:07:22,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365334469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:07:22,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:07:22,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:07:22,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310339269] [2024-11-09 01:07:22,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:07:22,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:07:22,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:22,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:07:22,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:07:22,635 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 01:07:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:22,859 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2024-11-09 01:07:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:07:22,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2024-11-09 01:07:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:22,861 INFO L225 Difference]: With dead ends: 112 [2024-11-09 01:07:22,862 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 01:07:22,863 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 01:07:22,864 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:22,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 377 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:07:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 01:07:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 01:07:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 107 states have internal predecessors, (117), 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 01:07:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2024-11-09 01:07:22,882 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 18 [2024-11-09 01:07:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:22,882 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2024-11-09 01:07:22,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 01:07:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2024-11-09 01:07:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 01:07:22,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:22,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:07:22,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:07:22,884 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:22,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash 302020546, now seen corresponding path program 1 times [2024-11-09 01:07:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293650300] [2024-11-09 01:07:22,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:07:23,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:23,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293650300] [2024-11-09 01:07:23,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293650300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:07:23,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844144386] [2024-11-09 01:07:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:23,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:07:23,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:07:23,233 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:07:23,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:07:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:23,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 01:07:23,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:07:23,455 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 01:07:23,546 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:07:23,546 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 01:07:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:07:23,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:07:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:07:23,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844144386] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:07:23,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [836070897] [2024-11-09 01:07:23,987 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 01:07:23,987 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:07:23,991 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:07:23,997 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:07:23,998 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:07:25,970 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2024-11-09 01:07:26,594 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:07:34,124 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1412#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (not (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (= |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|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2024-11-09 01:07:34,124 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:07:34,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:07:34,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2024-11-09 01:07:34,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403257669] [2024-11-09 01:07:34,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:07:34,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 01:07:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:34,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 01:07:34,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=746, Unknown=1, NotChecked=0, Total=870 [2024-11-09 01:07:34,127 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 18 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 01:07:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:34,699 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2024-11-09 01:07:34,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:07:34,700 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 20 [2024-11-09 01:07:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:34,701 INFO L225 Difference]: With dead ends: 111 [2024-11-09 01:07:34,701 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 01:07:34,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=132, Invalid=797, Unknown=1, NotChecked=0, Total=930 [2024-11-09 01:07:34,702 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:34,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 739 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:07:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 01:07:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 01:07:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 106 states have internal predecessors, (116), 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 01:07:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2024-11-09 01:07:34,709 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 20 [2024-11-09 01:07:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:34,710 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2024-11-09 01:07:34,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 01:07:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2024-11-09 01:07:34,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 01:07:34,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:34,711 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:07:34,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:07:34,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:07:34,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:34,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:34,913 INFO L85 PathProgramCache]: Analyzing trace with hash 302020547, now seen corresponding path program 1 times [2024-11-09 01:07:34,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:34,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641843801] [2024-11-09 01:07:34,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:34,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:07:35,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:35,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641843801] [2024-11-09 01:07:35,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641843801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:07:35,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570841539] [2024-11-09 01:07:35,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:35,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:07:35,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:07:35,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:07:35,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:07:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:35,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 01:07:35,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:07:35,337 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 01:07:35,345 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 01:07:35,571 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:07:35,572 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 01:07:35,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:07:35,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 01:07:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:07:35,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:07:35,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570841539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:07:35,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1945853347] [2024-11-09 01:07:35,831 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 01:07:35,831 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:07:35,832 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:07:35,832 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:07:35,832 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:07:36,965 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2024-11-09 01:07:37,442 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:07:42,891 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1740#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (<= (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 3)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2024-11-09 01:07:42,891 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:07:42,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:07:42,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-09 01:07:42,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336641492] [2024-11-09 01:07:42,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:07:42,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 01:07:42,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:42,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 01:07:42,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2024-11-09 01:07:42,893 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 18 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 01:07:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:43,732 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2024-11-09 01:07:43,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:07:43,733 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2024-11-09 01:07:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:43,733 INFO L225 Difference]: With dead ends: 113 [2024-11-09 01:07:43,734 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 01:07:43,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 01:07:43,735 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:43,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:07:43,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 01:07:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-11-09 01:07:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 56 states have (on average 2.0535714285714284) internal successors, (115), 105 states have internal predecessors, (115), 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 01:07:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2024-11-09 01:07:43,741 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 20 [2024-11-09 01:07:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:43,742 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2024-11-09 01:07:43,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 01:07:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2024-11-09 01:07:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 01:07:43,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:43,743 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:07:43,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:07:43,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:07:43,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:43,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:43,949 INFO L85 PathProgramCache]: Analyzing trace with hash 808112369, now seen corresponding path program 1 times [2024-11-09 01:07:43,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:43,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341567378] [2024-11-09 01:07:43,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:43,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:07:44,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:44,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341567378] [2024-11-09 01:07:44,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341567378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:07:44,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794919376] [2024-11-09 01:07:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:44,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:07:44,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:07:44,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:07:44,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:07:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:44,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:07:44,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:07:44,649 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 01:07:44,658 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 01:07:44,679 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 01:07:44,679 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 01:07:44,743 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:07:44,743 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 01:07:44,818 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 01:07:44,819 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 01:07:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2024-11-09 01:07:44,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:07:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 01:07:45,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794919376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:07:45,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [684185288] [2024-11-09 01:07:45,304 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 01:07:45,304 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:07:45,304 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:07:45,305 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:07:45,305 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:07:46,455 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 01:07:46,480 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:07:51,962 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2169#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_26| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_sll_circular_append_~head#1.base_26|) 1)) (or (and (exists ((|v_#length_132| (Array Int Int))) (= |#length| (store |v_#length_132| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (exists ((|v_#valid_161| (Array Int Int))) (and (= (select |v_#valid_161| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_161| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_100| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_100| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_101|) (= |#memory_int| (store |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 5))))) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_26| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_26| (Array Int Int)) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_26|) (<= 4 (select |v_old(#length)_AFTER_CALL_26| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= 1 (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_26| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (exists ((|v_#length_132| (Array Int Int))) (= |#length| (store |v_#length_132| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (exists ((|v_#valid_161| (Array Int Int))) (and (= (select |v_#valid_161| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_161| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_old(#memory_int)_AFTER_CALL_27| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_27| (Array Int Int)) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_27| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (<= 4 (select |v_old(#length)_AFTER_CALL_27| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= |v_old(#memory_int)_AFTER_CALL_27| (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_27| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_27| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_27|))) (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_100| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_100| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_101|) (= |#memory_int| (store |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 5))))) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_26| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))))) (= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |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 01:07:51,962 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:07:51,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:07:51,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 20 [2024-11-09 01:07:51,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463796932] [2024-11-09 01:07:51,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:07:51,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 01:07:51,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:51,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 01:07:51,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1131, Unknown=3, NotChecked=68, Total=1332 [2024-11-09 01:07:51,965 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 22 states, 16 states have (on average 2.75) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 01:07:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:52,629 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2024-11-09 01:07:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:07:52,630 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 2.75) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 28 [2024-11-09 01:07:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:52,631 INFO L225 Difference]: With dead ends: 119 [2024-11-09 01:07:52,631 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 01:07:52,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=160, Invalid=1323, Unknown=3, NotChecked=74, Total=1560 [2024-11-09 01:07:52,632 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 454 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:52,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 401 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 532 Invalid, 0 Unknown, 127 Unchecked, 0.5s Time] [2024-11-09 01:07:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 01:07:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2024-11-09 01:07:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 56 states have (on average 1.8928571428571428) internal successors, (106), 96 states have internal predecessors, (106), 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 01:07:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2024-11-09 01:07:52,638 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 28 [2024-11-09 01:07:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:52,639 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2024-11-09 01:07:52,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 2.75) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 01:07:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2024-11-09 01:07:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 01:07:52,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:52,640 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:07:52,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 01:07:52,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:07:52,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:52,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash 808112370, now seen corresponding path program 1 times [2024-11-09 01:07:52,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:52,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085356628] [2024-11-09 01:07:52,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:52,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 01:07:53,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:53,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085356628] [2024-11-09 01:07:53,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085356628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:07:53,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693893807] [2024-11-09 01:07:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:53,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:07:53,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:07:53,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:07:53,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:07:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:53,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 01:07:53,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:07:53,534 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 01:07:53,546 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 01:07:53,556 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 01:07:53,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:07:53,581 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 01:07:53,611 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 01:07:53,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:07:53,644 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 01:07:53,677 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 01:07:53,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:07:53,710 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 01:07:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 01:07:53,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:07:53,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693893807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:07:53,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:07:53,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-09 01:07:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140804087] [2024-11-09 01:07:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:07:53,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:07:53,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:53,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:07:53,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-11-09 01:07:53,720 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:07:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:53,900 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2024-11-09 01:07:53,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:07:53,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-09 01:07:53,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:53,902 INFO L225 Difference]: With dead ends: 96 [2024-11-09 01:07:53,902 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 01:07:53,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-09 01:07:53,903 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 20 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:53,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 233 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 128 Unchecked, 0.1s Time] [2024-11-09 01:07:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 01:07:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 01:07:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 91 states have internal predecessors, (101), 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 01:07:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2024-11-09 01:07:53,908 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 28 [2024-11-09 01:07:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:53,908 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2024-11-09 01:07:53,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:07:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2024-11-09 01:07:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 01:07:53,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:53,909 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:07:53,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:07:54,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:07:54,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:54,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash -793093774, now seen corresponding path program 1 times [2024-11-09 01:07:54,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:54,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695731655] [2024-11-09 01:07:54,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:54,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 01:07:54,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695731655] [2024-11-09 01:07:54,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695731655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:07:54,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:07:54,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:07:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139915968] [2024-11-09 01:07:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:07:54,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:07:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:54,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:07:54,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:07:54,221 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 01:07:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:54,391 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-11-09 01:07:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:07:54,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-11-09 01:07:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:54,392 INFO L225 Difference]: With dead ends: 94 [2024-11-09 01:07:54,392 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 01:07:54,392 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 01:07:54,393 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 17 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:54,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 282 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:07:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 01:07:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 01:07:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 89 states have internal predecessors, (99), 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 01:07:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2024-11-09 01:07:54,406 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 30 [2024-11-09 01:07:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:54,406 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2024-11-09 01:07:54,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 01:07:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2024-11-09 01:07:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 01:07:54,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:54,407 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:07:54,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:07:54,407 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:54,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:54,408 INFO L85 PathProgramCache]: Analyzing trace with hash -793093773, now seen corresponding path program 1 times [2024-11-09 01:07:54,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:54,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528576151] [2024-11-09 01:07:54,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:54,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 01:07:54,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:54,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528576151] [2024-11-09 01:07:54,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528576151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:07:54,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:07:54,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:07:54,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390539690] [2024-11-09 01:07:54,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:07:54,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:07:54,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:54,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:07:54,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:07:54,650 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 01:07:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:54,824 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2024-11-09 01:07:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:07:54,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-11-09 01:07:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:54,825 INFO L225 Difference]: With dead ends: 92 [2024-11-09 01:07:54,825 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 01:07:54,826 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 01:07:54,826 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 16 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:54,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 290 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:07:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 01:07:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 01:07:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.7321428571428572) internal successors, (97), 87 states have internal predecessors, (97), 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 01:07:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2024-11-09 01:07:54,834 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 30 [2024-11-09 01:07:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:54,834 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2024-11-09 01:07:54,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 01:07:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2024-11-09 01:07:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 01:07:54,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:54,835 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:07:54,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:07:54,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:07:54,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1183910754, now seen corresponding path program 1 times [2024-11-09 01:07:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701894992] [2024-11-09 01:07:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:07:55,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:55,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701894992] [2024-11-09 01:07:55,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701894992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:07:55,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815011556] [2024-11-09 01:07:55,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:55,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:07:55,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:07:55,405 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:07:55,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:07:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:55,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 01:07:55,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:07:55,565 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 01:07:55,615 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 01:07:55,646 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 01:07:55,646 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 19 treesize of output 16 [2024-11-09 01:07:55,723 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:07:55,724 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 01:07:55,949 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_58| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_58|) 0) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_58| (select |c_#valid| |v_node_create_~temp~0#1.base_58|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_58|))))) is different from true [2024-11-09 01:07:55,986 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-09 01:07:55,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2024-11-09 01:07:55,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 01:07:56,018 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 01:07:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2024-11-09 01:07:56,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:07:56,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815011556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:07:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1252038823] [2024-11-09 01:07:56,128 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 01:07:56,128 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:07:56,128 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:07:56,129 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:07:56,129 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:07:57,255 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2024-11-09 01:07:57,278 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:08:03,009 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3218#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) 1)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (or (and (exists ((|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 5))) (= (store |v_#memory_int_112| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_112| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_113|))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_143| (Array Int Int))) (= (store |v_#length_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_41| (Array Int (Array Int Int))) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_41| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_41| (Array Int Int)) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_old(#length)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)) (= |v_old(#memory_int)_AFTER_CALL_41| (store |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_41| (store |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_41| |ULTIMATE.start_main_~#s~0#1.base|) 0)))))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_174| (Array Int Int))) (and (= (store |v_#valid_174| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_174| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (exists ((|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 5))) (= (store |v_#memory_int_112| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_112| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_113|))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_143| (Array Int Int))) (= (store |v_#length_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_174| (Array Int Int))) (and (= (store |v_#valid_174| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_174| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_69| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_40|) (<= 4 (select |v_#length_BEFORE_CALL_69| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)) (= |v_old(#memory_int)_AFTER_CALL_40| (store |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 01:08:03,009 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:08:03,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:08:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 01:08:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409338751] [2024-11-09 01:08:03,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:08:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 01:08:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 01:08:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1745, Unknown=3, NotChecked=170, Total=2070 [2024-11-09 01:08:03,011 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 27 states, 21 states have (on average 2.238095238095238) internal successors, (47), 23 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 01:08:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:04,354 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-11-09 01:08:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:08:04,355 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 2.238095238095238) internal successors, (47), 23 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2024-11-09 01:08:04,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:04,356 INFO L225 Difference]: With dead ends: 95 [2024-11-09 01:08:04,356 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 01:08:04,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=254, Invalid=2721, Unknown=3, NotChecked=214, Total=3192 [2024-11-09 01:08:04,357 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 228 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:04,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 673 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 973 Invalid, 0 Unknown, 211 Unchecked, 0.8s Time] [2024-11-09 01:08:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 01:08:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2024-11-09 01:08:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 86 states have internal predecessors, (97), 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 01:08:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2024-11-09 01:08:04,361 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 31 [2024-11-09 01:08:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:04,361 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2024-11-09 01:08:04,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 2.238095238095238) internal successors, (47), 23 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 01:08:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-11-09 01:08:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 01:08:04,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:04,363 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:04,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 01:08:04,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 01:08:04,564 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:08:04,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1183910755, now seen corresponding path program 1 times [2024-11-09 01:08:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:04,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39773797] [2024-11-09 01:08:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:08:05,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:05,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39773797] [2024-11-09 01:08:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39773797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:08:05,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031142811] [2024-11-09 01:08:05,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:05,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:08:05,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:08:05,621 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:08:05,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 01:08:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:05,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 01:08:05,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:08:05,913 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 01:08:06,240 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 01:08:06,248 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 01:08:06,326 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_68| Int)) (and (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_68| (select |c_#length| |v_node_create_~temp~0#1.base_68|)) |c_#length|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_68|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_68| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_68|)) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_68| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_68|))) (<= (+ |v_node_create_~temp~0#1.base_68| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-09 01:08:06,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:08:06,375 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 01:08:06,393 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 01:08:06,394 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 01:08:06,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:08:06,402 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 01:08:06,407 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 01:08:06,481 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 01:08:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-09 01:08:06,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:08:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031142811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:08:06,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1824182201] [2024-11-09 01:08:06,801 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 01:08:06,801 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:08:06,801 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:08:06,802 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:08:06,802 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:08:07,844 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2024-11-09 01:08:07,866 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:08:14,228 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3581#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (or (and (exists ((|v_#valid_183| (Array Int Int))) (and (= (store |v_#valid_183| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= 0 (select |v_#valid_183| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int)))) (and (= |v_#memory_int_125| (store |v_#memory_int_124| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_124| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_125| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 5))))) (exists ((|v_#memory_$Pointer$.offset_159| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_159| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_159| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| Int) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_163| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_167| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_92| (Array Int Int))) (and (= |v_old(#memory_int)_AFTER_CALL_52| (store |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.offset_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_167| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.base_167| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_52| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_52|) (<= 4 (select |v_#length_BEFORE_CALL_92| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|)))) (exists ((|v_#memory_$Pointer$.base_163| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_163| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_163| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#length_154| (Array Int Int))) (= (store |v_#length_154| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (exists ((|v_#valid_183| (Array Int Int))) (and (= (store |v_#valid_183| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= 0 (select |v_#valid_183| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int)))) (and (= |v_#memory_int_125| (store |v_#memory_int_124| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_124| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_125| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 5))))) (exists ((|v_#memory_$Pointer$.offset_159| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_159| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_159| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_51| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#length_BEFORE_CALL_90| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_80| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| Int) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_163| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_167| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.offset_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_51| (store |v_#memory_$Pointer$.base_167| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.base_167| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_51| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_51| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 1) (<= 4 (select |v_#length_BEFORE_CALL_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|)) (= (store |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 (select (select |v_#memory_int_BEFORE_CALL_80| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0))) |v_#memory_int_BEFORE_CALL_80|))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_163| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_163| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_163| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#length_154| (Array Int Int))) (= (store |v_#length_154| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))) (= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 4)) (< (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0)) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 01:08:14,228 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:08:14,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:08:14,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2024-11-09 01:08:14,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730681892] [2024-11-09 01:08:14,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:08:14,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 01:08:14,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:14,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 01:08:14,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1919, Unknown=2, NotChecked=88, Total=2162 [2024-11-09 01:08:14,231 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 26 states, 19 states have (on average 2.263157894736842) internal successors, (43), 23 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 01:08:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:15,747 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2024-11-09 01:08:15,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:08:15,747 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 19 states have (on average 2.263157894736842) internal successors, (43), 23 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2024-11-09 01:08:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:15,749 INFO L225 Difference]: With dead ends: 97 [2024-11-09 01:08:15,749 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 01:08:15,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=222, Invalid=2750, Unknown=2, NotChecked=106, Total=3080 [2024-11-09 01:08:15,751 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 182 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:15,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 871 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1067 Invalid, 0 Unknown, 109 Unchecked, 0.9s Time] [2024-11-09 01:08:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 01:08:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-09 01:08:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 90 states have internal predecessors, (101), 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 01:08:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-11-09 01:08:15,756 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 31 [2024-11-09 01:08:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:15,756 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-11-09 01:08:15,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 19 states have (on average 2.263157894736842) internal successors, (43), 23 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 01:08:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-11-09 01:08:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 01:08:15,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:15,759 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:15,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 01:08:15,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 01:08:15,960 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:08:15,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash -441514694, now seen corresponding path program 1 times [2024-11-09 01:08:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:15,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426800096] [2024-11-09 01:08:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 01:08:16,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426800096] [2024-11-09 01:08:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426800096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:08:16,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:08:16,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:08:16,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525320808] [2024-11-09 01:08:16,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:08:16,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:08:16,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:16,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:08:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:08:16,188 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:08:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:16,309 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2024-11-09 01:08:16,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:08:16,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-09 01:08:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:16,311 INFO L225 Difference]: With dead ends: 91 [2024-11-09 01:08:16,311 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 01:08:16,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:08:16,312 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 118 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:16,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 144 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:08:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 01:08:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 01:08:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 86 states have internal predecessors, (97), 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 01:08:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2024-11-09 01:08:16,316 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 33 [2024-11-09 01:08:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:16,316 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2024-11-09 01:08:16,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:08:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-11-09 01:08:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 01:08:16,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:16,320 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:16,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:08:16,320 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:08:16,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash 906293953, now seen corresponding path program 1 times [2024-11-09 01:08:16,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:16,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075411262] [2024-11-09 01:08:16,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:16,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 01:08:16,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:16,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075411262] [2024-11-09 01:08:16,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075411262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:08:16,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:08:16,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:08:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555601026] [2024-11-09 01:08:16,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:08:16,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:08:16,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:16,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:08:16,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:08:16,602 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 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 01:08:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:16,891 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2024-11-09 01:08:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:08:16,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 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 35 [2024-11-09 01:08:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:16,892 INFO L225 Difference]: With dead ends: 127 [2024-11-09 01:08:16,893 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 01:08:16,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:08:16,893 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 78 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:16,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 368 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:08:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 01:08:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 94. [2024-11-09 01:08:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 89 states have internal predecessors, (101), 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 01:08:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2024-11-09 01:08:16,899 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 35 [2024-11-09 01:08:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:16,900 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2024-11-09 01:08:16,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 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 01:08:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2024-11-09 01:08:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 01:08:16,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:16,901 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:16,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:08:16,904 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:08:16,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 906293954, now seen corresponding path program 1 times [2024-11-09 01:08:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:16,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100610587] [2024-11-09 01:08:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 01:08:17,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:17,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100610587] [2024-11-09 01:08:17,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100610587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:08:17,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:08:17,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:08:17,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427311794] [2024-11-09 01:08:17,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:08:17,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:08:17,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:17,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:08:17,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:08:17,327 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 9 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 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 01:08:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:17,631 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2024-11-09 01:08:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:08:17,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 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 35 [2024-11-09 01:08:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:17,632 INFO L225 Difference]: With dead ends: 134 [2024-11-09 01:08:17,632 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 01:08:17,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:08:17,633 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 75 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:17,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 403 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:08:17,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 01:08:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 97. [2024-11-09 01:08:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 92 states have internal predecessors, (104), 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 01:08:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-11-09 01:08:17,638 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 35 [2024-11-09 01:08:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:17,639 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-11-09 01:08:17,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 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 01:08:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-11-09 01:08:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 01:08:17,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:17,641 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:17,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:08:17,641 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:08:17,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash 914651159, now seen corresponding path program 1 times [2024-11-09 01:08:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:17,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971559361] [2024-11-09 01:08:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:08:18,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:18,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971559361] [2024-11-09 01:08:18,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971559361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:08:18,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647857061] [2024-11-09 01:08:18,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:18,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:08:18,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:08:18,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:08:18,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 01:08:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:19,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-09 01:08:19,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:08:19,334 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 01:08:19,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:08:19,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 01:08:19,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:08:19,752 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 01:08:19,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-11-09 01:08:19,820 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:08:19,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2024-11-09 01:08:19,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:08:19,832 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 01:08:19,942 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_79| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_79| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_79|))) (<= (+ |v_node_create_~temp~0#1.base_79| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_79| (select |c_#valid| |v_node_create_~temp~0#1.base_79|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_79|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_79| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_79|)) |c_#memory_$Pointer$.offset|))) is different from true [2024-11-09 01:08:19,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:08:19,971 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 01:08:19,971 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 47 treesize of output 38 [2024-11-09 01:08:20,012 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-09 01:08:20,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-09 01:08:20,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:08:20,021 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 01:08:20,266 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 15 treesize of output 7 [2024-11-09 01:08:20,350 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:08:20,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2024-11-09 01:08:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 01:08:20,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:08:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647857061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:08:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1409633746] [2024-11-09 01:08:20,699 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 01:08:20,700 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:08:20,700 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:08:20,700 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:08:20,700 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:08:21,968 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 01:08:21,988 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:08:33,405 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4649#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38| Int)) (not (= (select |#valid| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_38|) 1))) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |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 01:08:33,405 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:08:33,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:08:33,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 39 [2024-11-09 01:08:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680425916] [2024-11-09 01:08:33,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:08:33,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 01:08:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:33,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 01:08:33,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3559, Unknown=5, NotChecked=120, Total=3906 [2024-11-09 01:08:33,408 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 40 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:08:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:35,203 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2024-11-09 01:08:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:08:35,203 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2024-11-09 01:08:35,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:35,205 INFO L225 Difference]: With dead ends: 129 [2024-11-09 01:08:35,205 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 01:08:35,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=353, Invalid=5048, Unknown=5, NotChecked=144, Total=5550 [2024-11-09 01:08:35,207 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 268 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:35,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1042 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1228 Invalid, 0 Unknown, 135 Unchecked, 1.0s Time] [2024-11-09 01:08:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 01:08:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2024-11-09 01:08:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 106 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:08:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2024-11-09 01:08:35,212 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 35 [2024-11-09 01:08:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:35,213 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2024-11-09 01:08:35,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:08:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2024-11-09 01:08:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 01:08:35,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:35,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:35,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 01:08:35,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 01:08:35,415 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:08:35,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:35,415 INFO L85 PathProgramCache]: Analyzing trace with hash 914651160, now seen corresponding path program 1 times [2024-11-09 01:08:35,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:35,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300050576] [2024-11-09 01:08:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:08:37,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:37,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300050576] [2024-11-09 01:08:37,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300050576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:08:37,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107745840] [2024-11-09 01:08:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:37,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:08:37,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:08:37,295 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:08:37,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 01:08:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:37,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-09 01:08:37,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:08:37,696 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 01:08:37,702 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 01:08:38,045 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 01:08:38,046 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 01:08:38,061 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 01:08:38,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:08:38,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:08:38,371 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 01:08:38,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 60 [2024-11-09 01:08:38,385 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 36 treesize of output 15 [2024-11-09 01:08:38,470 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:08:38,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2024-11-09 01:08:38,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:08:38,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 01:08:38,650 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_90| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_90| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_90|))) (<= (+ |v_node_create_~temp~0#1.base_90| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_90| (select |c_#length| |v_node_create_~temp~0#1.base_90|)) |c_#length|) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_90| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_90|)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_90|) 0))) is different from true [2024-11-09 01:08:38,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:08:38,682 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 01:08:38,683 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 71 treesize of output 54 [2024-11-09 01:08:38,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:08:38,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:08:38,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:08:38,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-09 01:08:38,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:08:38,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-09 01:08:38,725 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 01:08:38,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 01:08:39,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:08:39,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2024-11-09 01:08:39,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 01:08:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 01:08:39,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:08:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107745840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:08:39,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2090478325] [2024-11-09 01:08:39,646 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 01:08:39,647 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:08:39,647 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:08:39,647 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:08:39,647 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:08:40,797 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 01:08:40,812 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:08:46,517 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5114#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |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 01:08:46,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:08:46,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:08:46,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2024-11-09 01:08:46,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476231660] [2024-11-09 01:08:46,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:08:46,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 01:08:46,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:46,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 01:08:46,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3933, Unknown=2, NotChecked=126, Total=4290 [2024-11-09 01:08:46,520 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand has 42 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 35 states have internal predecessors, (58), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:08:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:48,830 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2024-11-09 01:08:48,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 01:08:48,831 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 35 states have internal predecessors, (58), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2024-11-09 01:08:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:48,832 INFO L225 Difference]: With dead ends: 132 [2024-11-09 01:08:48,832 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 01:08:48,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1743 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=356, Invalid=5498, Unknown=2, NotChecked=150, Total=6006 [2024-11-09 01:08:48,835 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 203 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:48,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1001 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1434 Invalid, 0 Unknown, 138 Unchecked, 1.2s Time] [2024-11-09 01:08:48,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 01:08:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2024-11-09 01:08:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 105 states have internal predecessors, (120), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:08:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2024-11-09 01:08:48,840 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 35 [2024-11-09 01:08:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:48,841 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2024-11-09 01:08:48,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 35 states have internal predecessors, (58), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:08:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2024-11-09 01:08:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:08:48,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:48,842 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:48,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:08:49,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 01:08:49,043 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:08:49,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:49,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1238796877, now seen corresponding path program 1 times [2024-11-09 01:08:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:49,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000231815] [2024-11-09 01:08:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:49,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 01:08:49,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:49,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000231815] [2024-11-09 01:08:49,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000231815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:08:49,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:08:49,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:08:49,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364585245] [2024-11-09 01:08:49,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:08:49,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:08:49,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:49,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:08:49,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:08:49,166 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 01:08:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:49,328 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2024-11-09 01:08:49,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:08:49,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-09 01:08:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:49,329 INFO L225 Difference]: With dead ends: 135 [2024-11-09 01:08:49,329 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 01:08:49,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:08:49,330 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 57 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:49,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 244 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:08:49,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 01:08:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 112. [2024-11-09 01:08:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.475609756097561) internal successors, (121), 105 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:08:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2024-11-09 01:08:49,335 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 38 [2024-11-09 01:08:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:49,336 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2024-11-09 01:08:49,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 01:08:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2024-11-09 01:08:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:08:49,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:49,337 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:49,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:08:49,337 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:08:49,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:49,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1238796878, now seen corresponding path program 1 times [2024-11-09 01:08:49,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:49,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189945723] [2024-11-09 01:08:49,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:49,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 01:08:49,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:49,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189945723] [2024-11-09 01:08:49,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189945723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:08:49,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:08:49,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:08:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797809335] [2024-11-09 01:08:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:08:49,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:08:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:49,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:08:49,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:08:49,859 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 1 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 01:08:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:50,193 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2024-11-09 01:08:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:08:50,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 1 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 38 [2024-11-09 01:08:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:50,194 INFO L225 Difference]: With dead ends: 150 [2024-11-09 01:08:50,194 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 01:08:50,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:08:50,195 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 121 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:50,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 368 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:08:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 01:08:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 119. [2024-11-09 01:08:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.4943820224719102) internal successors, (133), 112 states have internal predecessors, (133), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:08:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 143 transitions. [2024-11-09 01:08:50,205 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 143 transitions. Word has length 38 [2024-11-09 01:08:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:50,206 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 143 transitions. [2024-11-09 01:08:50,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 1 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 01:08:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2024-11-09 01:08:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 01:08:50,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:50,207 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:50,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 01:08:50,207 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:08:50,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:50,208 INFO L85 PathProgramCache]: Analyzing trace with hash -251996958, now seen corresponding path program 1 times [2024-11-09 01:08:50,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:50,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520112939] [2024-11-09 01:08:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:50,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:08:51,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:51,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520112939] [2024-11-09 01:08:51,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520112939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:08:51,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696626] [2024-11-09 01:08:51,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:51,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:08:51,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:08:51,319 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:08:51,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 01:08:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:51,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 01:08:51,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:08:51,693 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 01:08:51,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:08:51,900 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 17 treesize of output 12 [2024-11-09 01:08:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:08:52,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:08:52,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:08:52,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [577588638] [2024-11-09 01:08:52,308 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-09 01:08:52,308 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:08:52,309 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:08:52,309 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:08:52,309 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:08:54,177 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 01:08:54,190 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:09:59,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [577588638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:09:59,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:09:59,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [22, 16] total 57 [2024-11-09 01:09:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150655157] [2024-11-09 01:09:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:09:59,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 01:09:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:09:59,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 01:09:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3319, Unknown=33, NotChecked=0, Total=3540 [2024-11-09 01:09:59,828 INFO L87 Difference]: Start difference. First operand 119 states and 143 transitions. Second operand has 25 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 20 states have internal predecessors, (25), 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 01:10:04,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:10:06,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:10:09,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:10:11,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:10:14,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:10:16,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:10:18,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:10:21,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:10:24,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:11:26,682 WARN L286 SmtUtils]: Spent 46.88s on a formula simplification. DAG size of input: 185 DAG size of output: 184 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:12:30,494 WARN L286 SmtUtils]: Spent 46.46s on a formula simplification. DAG size of input: 189 DAG size of output: 188 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:12:33,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:13:32,770 WARN L286 SmtUtils]: Spent 42.20s on a formula simplification. DAG size of input: 197 DAG size of output: 196 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:14:29,272 WARN L286 SmtUtils]: Spent 41.03s on a formula simplification. DAG size of input: 201 DAG size of output: 200 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:14:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:14:52,108 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2024-11-09 01:14:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 01:14:52,109 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 20 states have internal predecessors, (25), 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) Word has length 39 [2024-11-09 01:14:52,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:14:52,110 INFO L225 Difference]: With dead ends: 125 [2024-11-09 01:14:52,110 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 01:14:52,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 299.2s TimeCoverageRelationStatistics Valid=221, Invalid=3762, Unknown=49, NotChecked=0, Total=4032 [2024-11-09 01:14:52,113 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:14:52,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 396 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1274 Invalid, 12 Unknown, 0 Unchecked, 59.7s Time] [2024-11-09 01:14:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 01:14:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2024-11-09 01:14:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 107 states have internal predecessors, (123), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:14:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2024-11-09 01:14:52,119 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 39 [2024-11-09 01:14:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:14:52,120 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2024-11-09 01:14:52,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 20 states have internal predecessors, (25), 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 01:14:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2024-11-09 01:14:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 01:14:52,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:14:52,121 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:14:52,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 01:14:52,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:14:52,322 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:14:52,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:14:52,323 INFO L85 PathProgramCache]: Analyzing trace with hash -254246324, now seen corresponding path program 2 times [2024-11-09 01:14:52,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:14:52,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396756693] [2024-11-09 01:14:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:14:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:14:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:14:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:14:57,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:14:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396756693] [2024-11-09 01:14:57,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396756693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:14:57,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103978377] [2024-11-09 01:14:57,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:14:57,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:14:57,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:14:57,106 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:14:57,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 01:14:57,379 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 01:14:57,379 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:14:57,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-09 01:14:57,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:15:00,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:15:00,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:15:00,669 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-09 01:15:00,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 42 [2024-11-09 01:15:00,791 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2024-11-09 01:15:00,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2024-11-09 01:15:01,339 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-11-09 01:15:01,339 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 42 [2024-11-09 01:15:01,374 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:15:01,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:15:01,424 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 01:15:01,425 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 22 treesize of output 10 [2024-11-09 01:15:01,639 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_111| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_111| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_111|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_111|) 0) (<= (+ |v_node_create_~temp~0#1.base_111| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_111| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_111|)) |c_#memory_$Pointer$.offset|))) is different from true [2024-11-09 01:15:01,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:15:01,770 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-09 01:15:01,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 65 [2024-11-09 01:15:01,897 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-09 01:15:01,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 01:15:01,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:15:01,945 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-09 01:15:01,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 43 [2024-11-09 01:15:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 01:15:04,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:15:05,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103978377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:15:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [705632629] [2024-11-09 01:15:05,105 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 01:15:05,105 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:15:05,106 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:15:05,106 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:15:05,106 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:15:06,255 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 01:15:06,283 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:15:27,786 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6605#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_54| Int)) (not (= (select |#valid| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_54|) 1))) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |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 01:15:27,786 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:15:27,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:15:27,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 42 [2024-11-09 01:15:27,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914000079] [2024-11-09 01:15:27,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:15:27,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 01:15:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:27,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 01:15:27,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3564, Unknown=5, NotChecked=120, Total=3906 [2024-11-09 01:15:27,791 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 42 states, 32 states have (on average 1.90625) internal successors, (61), 36 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:15:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:38,921 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2024-11-09 01:15:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:15:38,922 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 1.90625) internal successors, (61), 36 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2024-11-09 01:15:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:38,923 INFO L225 Difference]: With dead ends: 122 [2024-11-09 01:15:38,924 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 01:15:38,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=341, Invalid=5358, Unknown=5, NotChecked=148, Total=5852 [2024-11-09 01:15:38,927 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 185 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:38,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1410 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1300 Invalid, 0 Unknown, 123 Unchecked, 7.0s Time] [2024-11-09 01:15:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 01:15:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2024-11-09 01:15:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 110 states have internal predecessors, (126), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:15:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2024-11-09 01:15:38,934 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 39 [2024-11-09 01:15:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:38,934 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2024-11-09 01:15:38,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 1.90625) internal successors, (61), 36 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:15:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2024-11-09 01:15:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:15:38,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:38,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:38,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:15:39,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:39,137 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:15:39,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2018076075, now seen corresponding path program 1 times [2024-11-09 01:15:39,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:39,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958360133] [2024-11-09 01:15:39,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:15:42,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:42,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958360133] [2024-11-09 01:15:42,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958360133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:15:42,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396144859] [2024-11-09 01:15:42,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:42,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:42,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:42,996 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:15:42,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 01:15:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:43,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 01:15:43,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:15:45,045 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 01:15:45,058 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 01:15:48,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:15:48,824 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 01:15:48,958 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 01:15:48,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 01:15:51,828 INFO L349 Elim1Store]: treesize reduction 51, result has 46.3 percent of original size [2024-11-09 01:15:51,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 82 [2024-11-09 01:15:52,974 INFO L349 Elim1Store]: treesize reduction 56, result has 36.4 percent of original size [2024-11-09 01:15:52,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 106 [2024-11-09 01:15:53,717 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 01:15:53,959 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 01:15:54,517 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 26 treesize of output 14 [2024-11-09 01:15:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:15:54,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:15:54,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396144859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:15:54,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:15:54,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [20] total 39 [2024-11-09 01:15:54,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631886718] [2024-11-09 01:15:54,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:15:54,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 01:15:54,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:54,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 01:15:54,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1429, Unknown=1, NotChecked=0, Total=1560 [2024-11-09 01:15:54,528 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:16:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:02,076 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2024-11-09 01:16:02,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 01:16:02,076 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-09 01:16:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:02,077 INFO L225 Difference]: With dead ends: 157 [2024-11-09 01:16:02,077 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 01:16:02,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=253, Invalid=2502, Unknown=1, NotChecked=0, Total=2756 [2024-11-09 01:16:02,078 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 177 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:02,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 827 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-09 01:16:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 01:16:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 124. [2024-11-09 01:16:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.425531914893617) internal successors, (134), 117 states have internal predecessors, (134), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:16:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2024-11-09 01:16:02,084 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 40 [2024-11-09 01:16:02,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:02,084 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2024-11-09 01:16:02,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:16:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2024-11-09 01:16:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:16:02,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:02,085 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:02,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 01:16:02,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:16:02,286 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-11-09 01:16:02,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:02,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2018076076, now seen corresponding path program 1 times [2024-11-09 01:16:02,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:02,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879107898] [2024-11-09 01:16:02,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:02,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:16:06,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:06,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879107898] [2024-11-09 01:16:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879107898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:16:06,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927215640] [2024-11-09 01:16:06,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:06,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:16:06,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:16:06,280 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:16:06,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbef5645-0058-4275-b700-71a480a3aa2b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 01:16:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:06,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-09 01:16:06,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:16:06,692 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 01:16:08,726 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 34 treesize of output 22 [2024-11-09 01:16:08,742 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 01:16:08,760 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 01:16:08,773 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 01:16:24,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:16:24,120 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 42 treesize of output 33 [2024-11-09 01:16:24,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:16:24,153 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 24 treesize of output 19 [2024-11-09 01:16:24,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:16:24,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-09 01:16:24,252 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 01:16:24,252 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 01:16:27,195 INFO L349 Elim1Store]: treesize reduction 63, result has 33.7 percent of original size [2024-11-09 01:16:27,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 91 [2024-11-09 01:16:27,351 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 01:16:27,351 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 38 treesize of output 22 [2024-11-09 01:16:28,542 INFO L349 Elim1Store]: treesize reduction 56, result has 36.4 percent of original size [2024-11-09 01:16:28,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 114 [2024-11-09 01:16:28,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:16:28,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-09 01:16:29,203 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 55 treesize of output 53 [2024-11-09 01:16:30,133 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 9 treesize of output 7 [2024-11-09 01:16:30,236 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 9 treesize of output 7 [2024-11-09 01:16:54,574 WARN L286 SmtUtils]: Spent 18.69s on a formula simplification that was a NOOP. DAG size: 1251 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 01:16:54,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:16:54,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 49 new quantified variables, introduced 300 case distinctions, treesize of input 937 treesize of output 3115 [2024-11-09 01:16:55,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16