./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/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_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/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_36cf1164-f23b-43d3-8901-53151f858db8/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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:01:56,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:01:56,429 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 07:01:56,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:01:56,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:01:56,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:01:56,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:01:56,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:01:56,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:01:56,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:01:56,476 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:01:56,476 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:01:56,477 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:01:56,479 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 07:01:56,479 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:01:56,479 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:01:56,480 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 07:01:56,480 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 07:01:56,480 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:01:56,481 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 07:01:56,481 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 07:01:56,485 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 07:01:56,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:01:56,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:01:56,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:01:56,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:01:56,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:01:56,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:01:56,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:01:56,487 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:01:56,488 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:01:56,488 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:01:56,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:01:56,493 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:01:56,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:01:56,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:01:56,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:01:56,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:01:56,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:01:56,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:01:56,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:01:56,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:01:56,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:01:56,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:01:56,497 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 07:01:56,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:01:56,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:01:56,498 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:01:56,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:01:56,498 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_36cf1164-f23b-43d3-8901-53151f858db8/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_36cf1164-f23b-43d3-8901-53151f858db8/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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2024-11-09 07:01:56,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:01:56,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:01:56,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:01:56,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:01:56,799 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:01:56,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i Unable to find full path for "g++" [2024-11-09 07:01:58,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:01:59,166 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:01:59,167 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2024-11-09 07:01:59,183 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/data/088ac2292/cbc7e58f106c4af481a9009aac62eb85/FLAG007c28789 [2024-11-09 07:01:59,198 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/data/088ac2292/cbc7e58f106c4af481a9009aac62eb85 [2024-11-09 07:01:59,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:01:59,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:01:59,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:59,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:01:59,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:01:59,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be5e7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59, skipping insertion in model container [2024-11-09 07:01:59,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:01:59,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:59,661 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:01:59,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:59,775 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:01:59,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59 WrapperNode [2024-11-09 07:01:59,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:59,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:59,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:01:59,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:01:59,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,847 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 147 [2024-11-09 07:01:59,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:59,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:01:59,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:01:59,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:01:59,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:01:59,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:01:59,886 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:01:59,886 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:01:59,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (1/1) ... [2024-11-09 07:01:59,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:01:59,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:01:59,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:01:59,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:01:59,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:01:59,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:01:59,963 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 07:01:59,963 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 07:01:59,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:01:59,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:01:59,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:01:59,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 07:01:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 07:01:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:01:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 07:01:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:01:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:01:59,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:02:00,094 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:02:00,097 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:02:00,575 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-11-09 07:02:00,575 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:02:00,659 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:02:00,659 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:02:00,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:02:00 BoogieIcfgContainer [2024-11-09 07:02:00,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:02:00,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:02:00,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:02:00,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:02:00,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:01:59" (1/3) ... [2024-11-09 07:02:00,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15da4323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:02:00, skipping insertion in model container [2024-11-09 07:02:00,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:59" (2/3) ... [2024-11-09 07:02:00,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15da4323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:02:00, skipping insertion in model container [2024-11-09 07:02:00,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:02:00" (3/3) ... [2024-11-09 07:02:00,683 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2024-11-09 07:02:00,698 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:02:00,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2024-11-09 07:02:00,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:02:00,746 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;@7bc86d8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:02:00,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-11-09 07:02:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 54 states have (on average 2.240740740740741) internal successors, (121), 106 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 07:02:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:02:00,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:00,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:02:00,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:00,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash 235265674, now seen corresponding path program 1 times [2024-11-09 07:02:00,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:00,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177938074] [2024-11-09 07:02:00,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:00,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:01,018 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 07:02:01,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:01,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177938074] [2024-11-09 07:02:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177938074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:01,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:01,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:01,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351931546] [2024-11-09 07:02:01,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:01,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:01,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:01,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:01,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:01,061 INFO L87 Difference]: Start difference. First operand has 111 states, 54 states have (on average 2.240740740740741) internal successors, (121), 106 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) 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 07:02:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:01,198 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2024-11-09 07:02:01,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:01,200 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 07:02:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:01,208 INFO L225 Difference]: With dead ends: 108 [2024-11-09 07:02:01,208 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 07:02:01,210 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 07:02:01,213 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:01,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 168 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:02:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 07:02:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 07:02:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 52 states have (on average 2.1538461538461537) internal successors, (112), 101 states have internal predecessors, (112), 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 07:02:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2024-11-09 07:02:01,252 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 5 [2024-11-09 07:02:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:01,253 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2024-11-09 07:02:01,253 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 07:02:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2024-11-09 07:02:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:02:01,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:01,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:02:01,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:02:01,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:01,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:01,254 INFO L85 PathProgramCache]: Analyzing trace with hash 235265675, now seen corresponding path program 1 times [2024-11-09 07:02:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:01,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762070992] [2024-11-09 07:02:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:01,410 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 07:02:01,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:01,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762070992] [2024-11-09 07:02:01,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762070992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:01,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662121667] [2024-11-09 07:02:01,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:01,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:01,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:01,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:01,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:01,428 INFO L87 Difference]: Start difference. First operand 106 states and 118 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 07:02:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:01,620 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2024-11-09 07:02:01,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:01,621 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 07:02:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:01,622 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:02:01,622 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:02:01,623 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 07:02:01,624 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:01,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 172 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:02:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:02:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 07:02:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 99 states have internal predecessors, (110), 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 07:02:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2024-11-09 07:02:01,635 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 5 [2024-11-09 07:02:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:01,636 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2024-11-09 07:02:01,636 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 07:02:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2024-11-09 07:02:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:02:01,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:01,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:01,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:02:01,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1217516206, now seen corresponding path program 1 times [2024-11-09 07:02:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:01,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388062933] [2024-11-09 07:02:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:01,771 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 07:02:01,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:01,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388062933] [2024-11-09 07:02:01,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388062933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:01,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:01,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:02:01,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642444269] [2024-11-09 07:02:01,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:01,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:01,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:01,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:01,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:01,777 INFO L87 Difference]: Start difference. First operand 104 states and 116 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 07:02:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:01,846 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2024-11-09 07:02:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:01,847 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 07:02:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:01,849 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:02:01,849 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:02:01,850 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 07:02:01,851 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:01,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 198 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:02:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:02:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2024-11-09 07:02:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 54 states have (on average 2.074074074074074) internal successors, (112), 101 states have internal predecessors, (112), 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 07:02:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2024-11-09 07:02:01,875 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 10 [2024-11-09 07:02:01,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:01,875 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2024-11-09 07:02:01,876 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 07:02:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2024-11-09 07:02:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:02:01,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:01,877 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:01,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:02:01,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:01,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:01,880 INFO L85 PathProgramCache]: Analyzing trace with hash 427971795, now seen corresponding path program 1 times [2024-11-09 07:02:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:01,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287460567] [2024-11-09 07:02:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:02,095 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 07:02:02,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:02,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287460567] [2024-11-09 07:02:02,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287460567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:02,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:02,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:02,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105711018] [2024-11-09 07:02:02,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:02,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:02,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:02,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:02,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:02,098 INFO L87 Difference]: Start difference. First operand 106 states and 118 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 07:02:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:02,358 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2024-11-09 07:02:02,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:02,361 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 07:02:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:02,362 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:02:02,362 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:02:02,363 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 07:02:02,364 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:02,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 338 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:02:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:02:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-09 07:02:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 100 states have internal predecessors, (111), 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 07:02:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2024-11-09 07:02:02,379 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 18 [2024-11-09 07:02:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:02,379 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2024-11-09 07:02:02,380 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 07:02:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2024-11-09 07:02:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:02:02,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:02,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:02,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:02:02,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:02,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash 427971796, now seen corresponding path program 1 times [2024-11-09 07:02:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:02,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969752503] [2024-11-09 07:02:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:02,688 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 07:02:02,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:02,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969752503] [2024-11-09 07:02:02,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969752503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:02,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:02,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:02,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625977967] [2024-11-09 07:02:02,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:02,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:02,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:02,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:02,693 INFO L87 Difference]: Start difference. First operand 105 states and 117 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 07:02:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:02,902 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2024-11-09 07:02:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:02,903 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 07:02:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:02,904 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:02:02,904 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:02:02,904 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 07:02:02,905 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:02,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:02:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:02:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 07:02:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 54 states have (on average 2.037037037037037) internal successors, (110), 99 states have internal predecessors, (110), 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 07:02:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2024-11-09 07:02:02,920 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 18 [2024-11-09 07:02:02,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:02,925 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2024-11-09 07:02:02,925 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 07:02:02,925 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2024-11-09 07:02:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:02:02,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:02,926 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:02,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:02:02,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:02,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:02,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1035768702, now seen corresponding path program 1 times [2024-11-09 07:02:02,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:02,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310943678] [2024-11-09 07:02:02,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:03,253 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 07:02:03,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:03,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310943678] [2024-11-09 07:02:03,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310943678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:03,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491680243] [2024-11-09 07:02:03,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:03,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:03,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:02:03,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:02:03,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:02:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:03,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:02:03,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:03,477 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 07:02:03,562 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:02:03,562 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 07:02:03,638 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 07:02:03,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:02:04,061 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 07:02:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491680243] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:02:04,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [226675264] [2024-11-09 07:02:04,085 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 07:02:04,085 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:02:04,090 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:02:04,096 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:02:04,096 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:02:06,238 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2024-11-09 07:02:06,870 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:02:14,480 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1324#(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 07:02:14,481 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:02:14,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:02:14,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2024-11-09 07:02:14,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782120161] [2024-11-09 07:02:14,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:02:14,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:02:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:14,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:02:14,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=746, Unknown=1, NotChecked=0, Total=870 [2024-11-09 07:02:14,484 INFO L87 Difference]: Start difference. First operand 104 states and 116 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 07:02:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:14,956 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2024-11-09 07:02:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:02:14,956 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 07:02:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:14,958 INFO L225 Difference]: With dead ends: 103 [2024-11-09 07:02:14,958 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 07:02:14,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=132, Invalid=797, Unknown=1, NotChecked=0, Total=930 [2024-11-09 07:02:14,959 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:14,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 539 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:02:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 07:02:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 07:02:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 54 states have (on average 2.0185185185185186) internal successors, (109), 98 states have internal predecessors, (109), 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 07:02:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2024-11-09 07:02:14,967 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 20 [2024-11-09 07:02:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:14,968 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2024-11-09 07:02:14,968 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 07:02:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2024-11-09 07:02:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:02:14,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:14,970 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:14,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:02:15,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:15,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:15,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1035768701, now seen corresponding path program 1 times [2024-11-09 07:02:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:15,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898169874] [2024-11-09 07:02:15,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:15,589 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 07:02:15,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898169874] [2024-11-09 07:02:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898169874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730261326] [2024-11-09 07:02:15,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:15,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:15,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:02:15,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:02:15,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:02:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:15,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:02:15,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:15,717 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 07:02:15,725 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 07:02:15,976 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:02:15,977 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 07:02:15,995 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:02:15,996 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 07:02:16,066 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 07:02:16,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:02:16,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730261326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:16,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1444420243] [2024-11-09 07:02:16,238 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 07:02:16,238 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:02:16,238 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:02:16,239 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:02:16,239 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:02:17,198 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2024-11-09 07:02:17,649 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:02:23,207 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1636#(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 07:02:23,207 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:02:23,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:02:23,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-09 07:02:23,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619216014] [2024-11-09 07:02:23,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:02:23,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:02:23,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:23,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:02:23,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2024-11-09 07:02:23,209 INFO L87 Difference]: Start difference. First operand 103 states and 115 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 07:02:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:23,954 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2024-11-09 07:02:23,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:02:23,954 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 07:02:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:23,955 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:02:23,955 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:02:23,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 07:02:23,956 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:23,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 867 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:02:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:02:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-11-09 07:02:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 2.0) internal successors, (108), 97 states have internal predecessors, (108), 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 07:02:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2024-11-09 07:02:23,963 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 20 [2024-11-09 07:02:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:23,963 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2024-11-09 07:02:23,963 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 07:02:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2024-11-09 07:02:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:02:23,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:23,964 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 07:02:23,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:02:24,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:24,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:24,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:24,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1492786304, now seen corresponding path program 1 times [2024-11-09 07:02:24,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:24,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597010363] [2024-11-09 07:02:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:24,769 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 07:02:24,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597010363] [2024-11-09 07:02:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597010363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759337949] [2024-11-09 07:02:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:24,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:24,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:02:24,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:02:24,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:02:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:24,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:02:24,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:24,915 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 07:02:24,924 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 07:02:24,940 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:02:24,941 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 07:02:25,003 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:02:25,003 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 07:02:25,079 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:02:25,079 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 07:02:25,095 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 07:02:25,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:02:25,585 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 07:02:25,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759337949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:02:25,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [272230759] [2024-11-09 07:02:25,588 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 07:02:25,588 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:02:25,588 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:02:25,588 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:02:25,588 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:02:26,777 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 07:02:26,810 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:02:32,600 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2048#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_26| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_26|) 1)) (or (and (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_108| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_108| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 1))) (= (store |v_#memory_int_107| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_107| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_108| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_108|))) (= |v_ULTIMATE.start_sll_circular_insert_~head#1.base_26| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_26| (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_#memory_int_111| (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|)) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_111| |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)))) (= 1 (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)))) (exists ((|v_#valid_153| (Array Int Int))) (and (= (select |v_#valid_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#length_124| (Array Int Int))) (= |#length| (store |v_#length_124| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|))) (and (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_108| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_108| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 1))) (= (store |v_#memory_int_107| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_107| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_108| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_108|))) (exists ((|v_old(#memory_int)_AFTER_CALL_27| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_int_111| (Array Int (Array Int 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|)) (= (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|) (= |v_old(#memory_int)_AFTER_CALL_27| (store |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_111| |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)))))) (= |v_ULTIMATE.start_sll_circular_insert_~head#1.base_26| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_153| (Array Int Int))) (and (= (select |v_#valid_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#length_124| (Array Int Int))) (= |#length| (store |v_#length_124| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)))))) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 1 |ULTIMATE.start_sll_circular_insert_~data#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 07:02:32,600 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:02:32,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:02:32,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 20 [2024-11-09 07:02:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517327779] [2024-11-09 07:02:32,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:02:32,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:02:32,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:32,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:02:32,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1132, Unknown=2, NotChecked=68, Total=1332 [2024-11-09 07:02:32,603 INFO L87 Difference]: Start difference. First operand 102 states and 114 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 07:02:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:33,252 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2024-11-09 07:02:33,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:02:33,253 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 07:02:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:33,254 INFO L225 Difference]: With dead ends: 113 [2024-11-09 07:02:33,254 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 07:02:33,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=160, Invalid=1324, Unknown=2, NotChecked=74, Total=1560 [2024-11-09 07:02:33,255 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 277 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:33,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 329 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 409 Invalid, 0 Unknown, 121 Unchecked, 0.5s Time] [2024-11-09 07:02:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 07:02:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2024-11-09 07:02:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8518518518518519) internal successors, (100), 89 states have internal predecessors, (100), 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 07:02:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2024-11-09 07:02:33,262 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 28 [2024-11-09 07:02:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:33,262 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2024-11-09 07:02:33,263 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 07:02:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2024-11-09 07:02:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:02:33,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:33,264 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 07:02:33,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:02:33,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:33,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:33,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:33,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1492786305, now seen corresponding path program 1 times [2024-11-09 07:02:33,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:33,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285327712] [2024-11-09 07:02:33,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:33,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:02:34,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:34,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285327712] [2024-11-09 07:02:34,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285327712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:34,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962019383] [2024-11-09 07:02:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:34,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:34,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:02:34,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:02:34,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:02:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:34,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 07:02:34,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:34,346 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 07:02:34,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:02:34,396 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 07:02:34,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:34,427 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 07:02:34,465 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 07:02:34,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:34,506 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 07:02:34,569 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 07:02:34,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:34,597 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 07:02:34,603 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 07:02:34,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:02:34,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962019383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:34,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:02:34,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2024-11-09 07:02:34,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747540494] [2024-11-09 07:02:34,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:34,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:02:34,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:34,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:02:34,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-11-09 07:02:34,606 INFO L87 Difference]: Start difference. First operand 94 states and 106 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 07:02:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:34,793 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2024-11-09 07:02:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:02:34,794 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 07:02:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:34,795 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:02:34,795 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:02:34,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2024-11-09 07:02:34,796 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 32 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:34,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 256 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2024-11-09 07:02:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:02:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-09 07:02:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 84 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:02:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2024-11-09 07:02:34,801 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 28 [2024-11-09 07:02:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:34,801 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2024-11-09 07:02:34,801 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 07:02:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2024-11-09 07:02:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:02:34,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:34,802 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 07:02:34,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:02:35,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:35,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:35,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1510930011, now seen corresponding path program 1 times [2024-11-09 07:02:35,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:35,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790335225] [2024-11-09 07:02:35,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:35,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:35,086 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 07:02:35,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:35,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790335225] [2024-11-09 07:02:35,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790335225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:35,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:35,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:02:35,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791125738] [2024-11-09 07:02:35,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:35,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:35,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:35,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:35,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:35,089 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 07:02:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:35,142 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2024-11-09 07:02:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:35,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 31 [2024-11-09 07:02:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:35,144 INFO L225 Difference]: With dead ends: 92 [2024-11-09 07:02:35,144 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:02:35,144 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 07:02:35,145 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:35,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 163 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:02:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:02:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 07:02:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 87 states have internal predecessors, (100), 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 07:02:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-11-09 07:02:35,154 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 31 [2024-11-09 07:02:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:35,155 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-11-09 07:02:35,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 07:02:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-11-09 07:02:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:02:35,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:35,156 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 07:02:35,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:02:35,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:35,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:35,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1510919120, now seen corresponding path program 1 times [2024-11-09 07:02:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:35,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352026760] [2024-11-09 07:02:35,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:35,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:02:35,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:35,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352026760] [2024-11-09 07:02:35,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352026760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:35,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170277957] [2024-11-09 07:02:35,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:35,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:35,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:02:35,872 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:02:35,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:02:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:36,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 07:02:36,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:36,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 07:02:36,539 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|))) (<= (+ |v_node_create_~temp~0#1.base_58| 1) |c_#StackHeapBarrier|) (= |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 07:02:36,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:36,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:02:36,572 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 07:02:36,573 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 07:02:36,612 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 07:02:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:02:36,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:02:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170277957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:36,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:02:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2024-11-09 07:02:36,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851646126] [2024-11-09 07:02:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:36,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:02:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:36,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:02:36,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2024-11-09 07:02:36,619 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 11 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:02:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:36,898 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2024-11-09 07:02:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:02:36,899 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-09 07:02:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:36,901 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:02:36,901 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:02:36,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=438, Unknown=1, NotChecked=42, Total=552 [2024-11-09 07:02:36,902 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 59 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:36,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 328 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 159 Unchecked, 0.2s Time] [2024-11-09 07:02:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:02:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2024-11-09 07:02:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 88 states have internal predecessors, (102), 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 07:02:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2024-11-09 07:02:36,907 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 31 [2024-11-09 07:02:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:36,907 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2024-11-09 07:02:36,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:02:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2024-11-09 07:02:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:02:36,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:36,908 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 07:02:36,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:02:37,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:37,109 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:37,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:37,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1510919121, now seen corresponding path program 1 times [2024-11-09 07:02:37,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:37,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797182734] [2024-11-09 07:02:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:37,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:38,100 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 07:02:38,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:38,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797182734] [2024-11-09 07:02:38,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797182734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378022204] [2024-11-09 07:02:38,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:38,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:38,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:02:38,103 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:02:38,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:02:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:38,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 07:02:38,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:38,439 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 07:02:38,720 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 07:02:38,725 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 07:02:38,900 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_60| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_60| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |c_old(#length)| |v_node_create_~temp~0#1.base_60| (select |c_#length| |v_node_create_~temp~0#1.base_60|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_60|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_60|) 0) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_60|)) |c_#memory_$Pointer$.base|))) is different from true [2024-11-09 07:02:38,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:38,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:02:38,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:38,926 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 07:02:38,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:38,934 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 07:02:38,950 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 07:02:38,951 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 07:02:39,000 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 07:02:39,047 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 07:02:39,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:02:39,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378022204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:39,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1981634496] [2024-11-09 07:02:39,327 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 07:02:39,328 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:02:39,328 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:02:39,328 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:02:39,328 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:02:40,503 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 07:02:40,524 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:02:46,657 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3202#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (or (and (exists ((|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#valid_163| (Array Int Int))) (and (= (select |v_#valid_163| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_163| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_149| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_149| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_149| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_119| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_119| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_120| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_120|) (= |#memory_int| (store |v_#memory_int_120| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_120| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 1))))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_44| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_#memory_$Pointer$.offset_151| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_63| (Array Int (Array Int Int))) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_153| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (store |v_#memory_$Pointer$.base_153| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_153| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_44| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)) (= (select (select (store |v_#memory_$Pointer$.offset_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_44| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1) (= (store |v_#memory_int_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_#memory_int_BEFORE_CALL_63| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0))) |v_#memory_int_BEFORE_CALL_63|))) (exists ((|v_#length_139| (Array Int Int))) (= |#length| (store |v_#length_139| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8)))) (and (exists ((|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#valid_163| (Array Int Int))) (and (= (select |v_#valid_163| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_163| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_149| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_149| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_149| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_119| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_119| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_120| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_120|) (= |#memory_int| (store |v_#memory_int_120| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_120| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 1))))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_#memory_$Pointer$.offset_151| (Array Int (Array Int Int))) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_61| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_153| (Array Int (Array Int Int)))) (and (<= 4 (select |v_old(#length)_AFTER_CALL_43| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)) (= (store |v_#memory_int_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_#memory_int_BEFORE_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0))) |v_#memory_int_BEFORE_CALL_61|) (= (select (select (store |v_#memory_$Pointer$.offset_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (store |v_#memory_$Pointer$.base_153| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_153| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1))) (exists ((|v_#length_139| (Array Int Int))) (= |#length| (store |v_#length_139| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))))) (or (< (select |#length| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) (+ |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 4)) (< |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)) (= |ULTIMATE.start_main_~len~0#1| 2) (= 1 |ULTIMATE.start_sll_circular_insert_~data#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 07:02:46,658 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:02:46,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:02:46,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-11-09 07:02:46,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166648116] [2024-11-09 07:02:46,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:02:46,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 07:02:46,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:46,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 07:02:46,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2016, Unknown=2, NotChecked=90, Total=2256 [2024-11-09 07:02:46,661 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 28 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 24 states have internal predecessors, (46), 4 states have call successors, (6), 3 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 07:02:48,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:48,437 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2024-11-09 07:02:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:02:48,437 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 24 states have internal predecessors, (46), 4 states have call successors, (6), 3 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 07:02:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:48,438 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:02:48,438 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:02:48,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=244, Invalid=3180, Unknown=2, NotChecked=114, Total=3540 [2024-11-09 07:02:48,440 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 300 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:48,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 920 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 957 Invalid, 0 Unknown, 126 Unchecked, 0.9s Time] [2024-11-09 07:02:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:02:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2024-11-09 07:02:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 88 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 07:02:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-11-09 07:02:48,444 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 31 [2024-11-09 07:02:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:48,445 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-11-09 07:02:48,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 24 states have internal predecessors, (46), 4 states have call successors, (6), 3 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 07:02:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-11-09 07:02:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:02:48,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:48,446 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 07:02:48,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:02:48,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:48,647 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:48,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:48,647 INFO L85 PathProgramCache]: Analyzing trace with hash 305042236, now seen corresponding path program 1 times [2024-11-09 07:02:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505146745] [2024-11-09 07:02:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:48,752 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 07:02:48,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:48,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505146745] [2024-11-09 07:02:48,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505146745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:48,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:48,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:48,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616668521] [2024-11-09 07:02:48,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:48,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:48,754 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 07:02:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:48,916 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2024-11-09 07:02:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:48,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 33 [2024-11-09 07:02:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:48,917 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:02:48,917 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:02:48,917 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 07:02:48,918 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 19 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:48,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 258 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:02:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:02:48,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 07:02:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 85 states have internal predecessors, (98), 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 07:02:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2024-11-09 07:02:48,922 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 33 [2024-11-09 07:02:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:48,923 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-11-09 07:02:48,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 07:02:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2024-11-09 07:02:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:02:48,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:48,924 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 07:02:48,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:02:48,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash 305042237, now seen corresponding path program 1 times [2024-11-09 07:02:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:48,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967185537] [2024-11-09 07:02:48,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:02:49,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:49,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967185537] [2024-11-09 07:02:49,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967185537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:49,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448568879] [2024-11-09 07:02:49,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:49,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:49,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:02:49,044 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:02:49,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:02:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:49,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:02:49,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:49,239 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 07:02:49,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:02:49,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448568879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:49,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:02:49,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-09 07:02:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144966349] [2024-11-09 07:02:49,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:49,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:02:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:49,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:02:49,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:02:49,241 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 07:02:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:49,297 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2024-11-09 07:02:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:02:49,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 07:02:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:49,298 INFO L225 Difference]: With dead ends: 93 [2024-11-09 07:02:49,298 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 07:02:49,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:49,299 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 53 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:49,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 184 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:02:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 07:02:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-09 07:02:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 84 states have internal predecessors, (94), 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 07:02:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2024-11-09 07:02:49,302 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 33 [2024-11-09 07:02:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:49,302 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2024-11-09 07:02:49,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 07:02:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2024-11-09 07:02:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:02:49,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:49,303 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] [2024-11-09 07:02:49,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 07:02:49,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 07:02:49,504 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:49,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:49,505 INFO L85 PathProgramCache]: Analyzing trace with hash 539504052, now seen corresponding path program 1 times [2024-11-09 07:02:49,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:49,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261306577] [2024-11-09 07:02:49,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:49,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 07:02:49,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261306577] [2024-11-09 07:02:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261306577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:49,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:49,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:02:49,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721677673] [2024-11-09 07:02:49,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:49,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:02:49,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:49,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:02:49,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:02:49,599 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 07:02:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:49,720 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2024-11-09 07:02:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:02:49,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 34 [2024-11-09 07:02:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:49,722 INFO L225 Difference]: With dead ends: 88 [2024-11-09 07:02:49,722 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 07:02:49,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:02:49,723 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:49,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 179 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:02:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 07:02:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 07:02:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.631578947368421) internal successors, (93), 83 states have internal predecessors, (93), 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 07:02:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2024-11-09 07:02:49,729 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 34 [2024-11-09 07:02:49,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:49,730 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2024-11-09 07:02:49,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 07:02:49,730 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2024-11-09 07:02:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:02:49,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:49,731 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] [2024-11-09 07:02:49,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:02:49,731 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:49,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash 539504053, now seen corresponding path program 1 times [2024-11-09 07:02:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:49,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582235569] [2024-11-09 07:02:49,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:49,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 07:02:49,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:49,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582235569] [2024-11-09 07:02:49,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582235569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:49,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:49,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:02:49,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467873785] [2024-11-09 07:02:49,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:49,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:02:49,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:49,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:02:49,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:02:49,910 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 07:02:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:50,038 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2024-11-09 07:02:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:02:50,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 34 [2024-11-09 07:02:50,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:50,039 INFO L225 Difference]: With dead ends: 87 [2024-11-09 07:02:50,040 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:02:50,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:02:50,041 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:50,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 179 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:02:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:02:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 07:02:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 82 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:02:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2024-11-09 07:02:50,047 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 34 [2024-11-09 07:02:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:50,048 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2024-11-09 07:02:50,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 07:02:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2024-11-09 07:02:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:02:50,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:50,050 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:50,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:02:50,051 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:50,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash 539493161, now seen corresponding path program 1 times [2024-11-09 07:02:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:50,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370407420] [2024-11-09 07:02:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:50,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:02:50,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:50,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370407420] [2024-11-09 07:02:50,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370407420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:50,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383324808] [2024-11-09 07:02:50,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:50,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:50,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:02:50,249 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:02:50,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:02:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:50,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:02:50,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 07:02:50,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:02:50,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383324808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:50,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:02:50,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-09 07:02:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348417659] [2024-11-09 07:02:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:50,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:02:50,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:02:50,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:50,478 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 07:02:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:50,553 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-11-09 07:02:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:02:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 34 [2024-11-09 07:02:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:50,554 INFO L225 Difference]: With dead ends: 87 [2024-11-09 07:02:50,554 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:02:50,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:02:50,555 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:50,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 248 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:02:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:02:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-09 07:02:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 78 states have internal predecessors, (87), 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 07:02:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-11-09 07:02:50,560 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 34 [2024-11-09 07:02:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:50,560 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-11-09 07:02:50,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 07:02:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2024-11-09 07:02:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:02:50,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:50,561 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 07:02:50,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:02:50,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:50,762 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:50,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash -455243544, now seen corresponding path program 1 times [2024-11-09 07:02:50,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:50,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642975235] [2024-11-09 07:02:50,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 07:02:50,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:50,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642975235] [2024-11-09 07:02:50,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642975235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:50,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:50,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:50,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497443459] [2024-11-09 07:02:50,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:50,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:50,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:50,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:50,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:50,971 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 07:02:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:51,125 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2024-11-09 07:02:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:51,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 35 [2024-11-09 07:02:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:51,127 INFO L225 Difference]: With dead ends: 80 [2024-11-09 07:02:51,127 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 07:02:51,128 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 07:02:51,128 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 11 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:51,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 258 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:02:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 07:02:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 07:02:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 75 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:02:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2024-11-09 07:02:51,132 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 35 [2024-11-09 07:02:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:51,133 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2024-11-09 07:02:51,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 07:02:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2024-11-09 07:02:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:02:51,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:51,134 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] [2024-11-09 07:02:51,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:02:51,134 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:51,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:51,135 INFO L85 PathProgramCache]: Analyzing trace with hash 597619433, now seen corresponding path program 1 times [2024-11-09 07:02:51,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:51,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028280498] [2024-11-09 07:02:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:51,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 07:02:51,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:51,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028280498] [2024-11-09 07:02:51,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028280498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:51,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:51,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:51,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277784806] [2024-11-09 07:02:51,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:51,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:51,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:51,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:51,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:51,353 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 6 states, 4 states have (on average 5.75) internal successors, (23), 6 states have internal predecessors, (23), 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 07:02:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:51,460 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-11-09 07:02:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:51,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 6 states have internal predecessors, (23), 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 37 [2024-11-09 07:02:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:51,461 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:02:51,461 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:02:51,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:02:51,462 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 79 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:51,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 130 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:02:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:02:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2024-11-09 07:02:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 72 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:02:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-11-09 07:02:51,466 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 37 [2024-11-09 07:02:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:51,467 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-11-09 07:02:51,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 6 states have internal predecessors, (23), 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 07:02:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-11-09 07:02:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:02:51,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:51,468 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 07:02:51,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:02:51,468 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:02:51,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:51,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1346337029, now seen corresponding path program 1 times [2024-11-09 07:02:51,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:51,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370831265] [2024-11-09 07:02:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:51,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:02:52,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:52,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370831265] [2024-11-09 07:02:52,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370831265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:52,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234900654] [2024-11-09 07:02:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:52,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:52,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:02:52,259 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:02:52,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:02:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:52,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 07:02:52,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:52,495 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 07:02:52,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 07:02:52,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:52,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:02:52,929 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 07:02:52,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-09 07:02:53,159 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-09 07:02:53,159 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 29 treesize of output 32 [2024-11-09 07:02:53,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:02:53,273 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 07:02:53,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 34 [2024-11-09 07:02:53,299 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 07:02:53,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-09 07:02:53,450 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 07:02:53,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:02:53,790 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21| Int) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1450 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21| 1) (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21| v_ArrVal_1450) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21| v_ArrVal_1444) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21| 1)))) is different from false [2024-11-09 07:02:53,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234900654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [666542805] [2024-11-09 07:02:53,794 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 07:02:53,795 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:02:53,795 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:02:53,795 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:02:53,795 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:02:55,028 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 07:02:55,050 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:03:10,201 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5073#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_24| Int) (|v_#memory_$Pointer$.base_174| (Array Int (Array Int Int))) (|v_#memory_int_138| (Array Int (Array Int Int))) (|v_#memory_int_139| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25| Int) (|v_#memory_$Pointer$.offset_166| (Array Int (Array Int Int)))) (and (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30|) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_166| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25| (store (select |v_#memory_$Pointer$.offset_166| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_24| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30| (store (select (store |v_#memory_$Pointer$.offset_166| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25| (store (select |v_#memory_$Pointer$.offset_166| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_24| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30|) 0)))) (= |#memory_int| (store |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30| (store (select |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25|) 1) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30|)) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_174| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25| (store (select |v_#memory_$Pointer$.base_174| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_24| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30| (store (select (store |v_#memory_$Pointer$.base_174| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25| (store (select |v_#memory_$Pointer$.base_174| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_24| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_30|) 0)))) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_24| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25| 0))) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_24| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25|)) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_24|) (= (store |v_#memory_int_138| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25| (store (select |v_#memory_int_138| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_24| (select (select |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_25|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_24|))) |v_#memory_int_139|))) (= |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|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1)))' at error location [2024-11-09 07:03:10,202 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:03:10,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:03:10,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2024-11-09 07:03:10,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509420775] [2024-11-09 07:03:10,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:03:10,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 07:03:10,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:03:10,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 07:03:10,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3574, Unknown=18, NotChecked=120, Total=3906 [2024-11-09 07:03:10,204 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 35 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:03:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:03:12,630 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2024-11-09 07:03:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 07:03:12,631 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-11-09 07:03:12,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:03:12,631 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:03:12,631 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:03:12,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=394, Invalid=6234, Unknown=18, NotChecked=160, Total=6806 [2024-11-09 07:03:12,634 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 188 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:03:12,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 997 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 07:03:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:03:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 79. [2024-11-09 07:03:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 74 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:03:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2024-11-09 07:03:12,638 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 38 [2024-11-09 07:03:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:03:12,639 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2024-11-09 07:03:12,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:03:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2024-11-09 07:03:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:03:12,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:03:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:12,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:03:12,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:12,845 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:03:12,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1346337030, now seen corresponding path program 1 times [2024-11-09 07:03:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:03:12,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057937800] [2024-11-09 07:03:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:14,322 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 07:03:14,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:03:14,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057937800] [2024-11-09 07:03:14,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057937800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:03:14,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558526022] [2024-11-09 07:03:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:14,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:14,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:03:14,324 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:03:14,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:03:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:14,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-09 07:03:14,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:03:14,588 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 07:03:14,953 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 07:03:14,958 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 07:03:15,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:15,329 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 07:03:15,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:15,338 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 07:03:15,355 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 07:03:15,355 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 07:03:15,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:15,372 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 07:03:15,649 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-09 07:03:15,649 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 29 treesize of output 32 [2024-11-09 07:03:15,667 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 07:03:15,667 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 19 treesize of output 18 [2024-11-09 07:03:15,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:15,855 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 07:03:15,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 57 [2024-11-09 07:03:15,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:15,876 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 07:03:15,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 66 [2024-11-09 07:03:15,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:03:15,962 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 07:03:16,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:03:16,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 80 [2024-11-09 07:03:16,301 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 07:03:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:03:16,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:03:16,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558526022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:16,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:03:16,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [19] total 35 [2024-11-09 07:03:16,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956849543] [2024-11-09 07:03:16,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:16,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:03:16,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:03:16,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:03:16,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1150, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 07:03:16,408 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 18 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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 07:03:18,602 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 07:03:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:03:19,562 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-11-09 07:03:19,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:03:19,562 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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 38 [2024-11-09 07:03:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:03:19,563 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:03:19,563 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:03:19,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 07:03:19,564 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 105 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:03:19,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 662 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 628 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 07:03:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:03:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 85. [2024-11-09 07:03:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.421875) internal successors, (91), 80 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:03:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2024-11-09 07:03:19,568 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 38 [2024-11-09 07:03:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:03:19,569 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2024-11-09 07:03:19,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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 07:03:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2024-11-09 07:03:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:03:19,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:03:19,570 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 07:03:19,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:03:19,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:19,771 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:03:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1829393643, now seen corresponding path program 1 times [2024-11-09 07:03:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:03:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329914814] [2024-11-09 07:03:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 07:03:19,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:03:19,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329914814] [2024-11-09 07:03:19,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329914814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:03:19,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928789733] [2024-11-09 07:03:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:19,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:19,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:03:19,938 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:03:19,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:03:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:20,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:03:20,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:03:20,177 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 07:03:20,203 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|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2024-11-09 07:03:20,221 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 07:03:20,250 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 07:03:20,283 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 07:03:20,342 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 07:03:20,343 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 07:03:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 07:03:20,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:03:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 07:03:20,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928789733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:03:20,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1685000117] [2024-11-09 07:03:20,742 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-09 07:03:20,744 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:03:20,744 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:03:20,744 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:03:20,745 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:03:21,976 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 07:03:21,998 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:03:28,803 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5914#(and (exists ((|v_#memory_$Pointer$.offset_203| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_211| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_211| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_$Pointer$.base_211| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_211| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_203| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_$Pointer$.offset_203| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_203| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)))) (or (not (= (select (select |v_#memory_$Pointer$.base_211| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) 0)) (not (= (select (select |v_#memory_$Pointer$.offset_203| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) 0))))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 1) (or (< (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) 4))) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#memory_int_171| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_171| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_171| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))))) (= |ULTIMATE.start_main_~len~0#1| 2) (= 1 |ULTIMATE.start_sll_circular_insert_~data#1|) (<= 2 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 07:03:28,803 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:03:28,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:03:28,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2024-11-09 07:03:28,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374852138] [2024-11-09 07:03:28,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:03:28,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:03:28,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:03:28,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:03:28,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1427, Unknown=2, NotChecked=76, Total=1640 [2024-11-09 07:03:28,805 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 07:03:29,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:03:29,464 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2024-11-09 07:03:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:03:29,465 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 39 [2024-11-09 07:03:29,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:03:29,466 INFO L225 Difference]: With dead ends: 69 [2024-11-09 07:03:29,466 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 07:03:29,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 76 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=179, Invalid=1798, Unknown=7, NotChecked=86, Total=2070 [2024-11-09 07:03:29,467 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 202 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:03:29,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 346 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 286 Invalid, 0 Unknown, 68 Unchecked, 0.4s Time] [2024-11-09 07:03:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 07:03:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-09 07:03:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.44) internal successors, (72), 64 states have internal predecessors, (72), 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 07:03:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-11-09 07:03:29,471 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 39 [2024-11-09 07:03:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:03:29,471 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-11-09 07:03:29,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 07:03:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-11-09 07:03:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:03:29,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:03:29,472 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, 1, 1] [2024-11-09 07:03:29,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:03:29,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:29,680 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:03:29,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1035620920, now seen corresponding path program 1 times [2024-11-09 07:03:29,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:03:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891792932] [2024-11-09 07:03:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:32,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:03:32,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891792932] [2024-11-09 07:03:32,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891792932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:03:32,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080378267] [2024-11-09 07:03:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:32,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:32,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:03:32,576 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:03:32,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:03:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:32,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-09 07:03:32,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:03:33,086 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 07:03:33,409 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 07:03:33,504 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:03:33,504 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 07:03:33,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:03:33,828 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 20 treesize of output 15 [2024-11-09 07:03:33,966 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 30 treesize of output 18 [2024-11-09 07:03:33,972 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 07:03:33,978 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 07:03:33,984 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 07:03:34,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:34,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:03:34,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:34,208 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 20 treesize of output 15 [2024-11-09 07:03:34,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:34,215 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 38 treesize of output 29 [2024-11-09 07:03:34,234 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 07:03:34,234 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 07:03:34,855 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:03:34,855 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 88 treesize of output 75 [2024-11-09 07:03:34,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-09 07:03:34,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:34,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:03:35,009 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 20 treesize of output 15 [2024-11-09 07:03:35,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:35,019 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 37 treesize of output 28 [2024-11-09 07:03:35,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:35,031 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 07:03:35,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-09 07:03:35,155 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 07:03:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:35,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:03:35,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1890 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1888) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-11-09 07:03:35,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1890 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1888) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1885) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_1886 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_1886 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2024-11-09 07:03:35,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1890 (Array Int Int))) (or (not (= (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_1886 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) v_ArrVal_1886)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1886) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1888) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1885) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1887) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-11-09 07:03:35,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1890 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1886) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1888) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1885) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1887) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_1886 (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store (select |c_#memory_int| .cse0) .cse1 (select v_ArrVal_1886 .cse1)))))))) is different from false [2024-11-09 07:03:35,524 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1890 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1886) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1888) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1885) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1887) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_1886 (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store (select |c_#memory_int| .cse0) .cse1 (select v_ArrVal_1886 .cse1)))))))) is different from false [2024-11-09 07:03:35,656 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_31| Int) (v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1890 (Array Int Int)) (v_ArrVal_1902 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_31| v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_31| 1)) (not (= v_ArrVal_1886 (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_31| v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_31| v_ArrVal_1900) .cse0) .cse1 (select v_ArrVal_1886 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1886) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_31| v_ArrVal_1888) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1885) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_31| v_ArrVal_1890) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1887) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_31| v_ArrVal_1889) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_31|) 0))))) is different from false [2024-11-09 07:03:35,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080378267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:03:35,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [106230369] [2024-11-09 07:03:35,661 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-09 07:03:35,661 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:03:35,661 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:03:35,661 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:03:35,661 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:03:36,607 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 07:03:36,623 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:03:54,516 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6315#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_38| Int) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37| Int) (|v_#memory_int_195| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_232| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_224| (Array Int (Array Int Int)))) (and (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|)) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_38| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|)) (= (store |v_#memory_int_195| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| (store (select |v_#memory_int_195| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_38| (select (select |v_#memory_int_196| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_38|))) |v_#memory_int_196|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_224| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| (store (select |v_#memory_$Pointer$.offset_224| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_38| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37| (store (select (store |v_#memory_$Pointer$.offset_224| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| (store (select |v_#memory_$Pointer$.offset_224| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_38| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0)))) (= |#memory_int| (store |v_#memory_int_196| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37| (store (select |v_#memory_int_196| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) 1) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_38| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| 0))) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_38|) (= (store (store |v_#memory_$Pointer$.base_232| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| (store (select |v_#memory_$Pointer$.base_232| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_38| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37| (store (select (store |v_#memory_$Pointer$.base_232| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40| (store (select |v_#memory_$Pointer$.base_232| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_40|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_38| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 0))) |#memory_$Pointer$.base|) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_37|) 1))))' at error location [2024-11-09 07:03:54,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:03:54,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:03:54,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 47 [2024-11-09 07:03:54,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239509722] [2024-11-09 07:03:54,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:03:54,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 07:03:54,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:03:54,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 07:03:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=5132, Unknown=22, NotChecked=894, Total=6320 [2024-11-09 07:03:54,520 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 47 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 38 states have internal predecessors, (64), 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 07:03:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:03:56,864 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2024-11-09 07:03:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:03:56,865 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 38 states have internal predecessors, (64), 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 42 [2024-11-09 07:03:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:03:56,866 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:03:56,866 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:03:56,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=379, Invalid=6933, Unknown=22, NotChecked=1038, Total=8372 [2024-11-09 07:03:56,868 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 65 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:03:56,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1075 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 07:03:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:03:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2024-11-09 07:03:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 82 states have internal predecessors, (92), 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 07:03:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2024-11-09 07:03:56,873 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 42 [2024-11-09 07:03:56,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:03:56,873 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2024-11-09 07:03:56,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 38 states have internal predecessors, (64), 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 07:03:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2024-11-09 07:03:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:03:56,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:03:56,874 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, 1, 1, 1] [2024-11-09 07:03:56,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 07:03:57,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 07:03:57,075 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-09 07:03:57,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2036532750, now seen corresponding path program 1 times [2024-11-09 07:03:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:03:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069069279] [2024-11-09 07:03:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:03:58,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:03:58,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069069279] [2024-11-09 07:03:58,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069069279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:03:58,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932748314] [2024-11-09 07:03:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:58,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:58,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:03:58,166 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:03:58,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36cf1164-f23b-43d3-8901-53151f858db8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 07:03:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:58,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-09 07:03:58,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:03:58,425 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 07:03:58,432 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 07:03:58,484 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 07:03:58,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:03:58,641 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:03:58,641 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 07:03:58,651 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 07:03:58,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:03:58,859 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 07:03:59,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:59,014 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 14 treesize of output 9 [2024-11-09 07:03:59,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:59,030 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:03:59,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2024-11-09 07:03:59,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:03:59,381 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 07:03:59,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 47 [2024-11-09 07:03:59,500 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:03:59,501 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 60 treesize of output 27 [2024-11-09 07:03:59,507 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 07:03:59,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:03:59,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:03:59,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:59,884 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 07:03:59,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:59,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:03:59,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:03:59,921 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 07:03:59,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-11-09 07:03:59,973 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-09 07:03:59,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-09 07:04:00,772 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-09 07:04:00,772 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 98 treesize of output 91 [2024-11-09 07:04:00,801 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-09 07:04:00,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-11-09 07:04:00,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:04:00,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-11-09 07:04:01,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:04:02,203 INFO L349 Elim1Store]: treesize reduction 200, result has 56.8 percent of original size [2024-11-09 07:04:02,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 357 treesize of output 494 [2024-11-09 07:04:02,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:04:02,510 INFO L349 Elim1Store]: treesize reduction 112, result has 57.3 percent of original size [2024-11-09 07:04:02,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 262 treesize of output 388 [2024-11-09 07:15:36,724 WARN L286 SmtUtils]: Spent 21.71s on a formula simplification. DAG size of input: 1266 DAG size of output: 1280 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)